Eunho Koo

Eunho Koo

Auto-generated profile, based on publicly available information

Eunho Koo

Department of Big Data Convergence, Chonnam National University, Gwangju, Republic of Korea

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
9 September 2023 in Expert Systems with Applications
Verified
Journal Article
Closed access
EKEunho Koo
Eunho Koo
Geonwoo KimGeonwoo Kim
Geonwoo Kim

5 April 2023 in Geophysical Research Letters
Verified
Journal Article
Open access
TBTakumi Bannai
Takumi Bannai
HXHaoyang Xu
Haoyang Xu
NUNobuyuki Utsumi
Nobuyuki Utsumi
EKEunho Koo
Eunho Koo
KLKeming Lu
Keming Lu
Hyungjun KimHyungjun Kim
Hyungjun Kim
Satellite‐based precipitation estimations provide frequent, large‐scale measurements. Deep learning has recently shown significant potential for improving estimation accuracy. Most studies have employed a two‐stage framework, which is a sequential architecture of a rain/no‐rain binary classification task followed by a rain rate regression task. This study proposes a novel precipitation retrieval framework in which these two tasks are simultaneously trained using multi‐task learning approach (MTL). Furthermore, a novel network architecture and loss function were designed to reap the benefits of MTL. The proposed two‐task model successfully achieved a better performance than the conventional single‐task model possibly due to efficient knowledge transfer between tasks. Furthermore, the product intercomparison showed that our product outperformed existing products in rain rate retrieval and also yielded better skills in the rain/no‐rain retrieval task.

15 January 2025 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
EKEunho Koo
Eunho Koo
TLTongseok Lim
Tongseok Lim
In the node classification task, it is natural to presume that densely connected nodes tend to exhibit similar attributes. Given this, it is crucial to first define what constitutes a dense connection and to develop a reliable mathematical tool for assessing node cohesiveness. In this article, we propose a probability-based objective function for semi-supervised node classification that takes advantage of higher order networks’ capabilities. The proposed function reflects the philosophy aligned with the intuition behind classifying within higher order networks, as it is designed to reduce the likelihood of nodes interconnected through higher order networks bearing different labels. In addition, we propose the stochastic block tensor model (SBTM) as a graph generation model designed specifically to address a significant limitation of the traditional stochastic block model (SBM), which does not adequately represent the distribution of higher order structures in real networks. We evaluate the objective function using networks generated by the SBTM, which include both balanced and imbalanced scenarios. Furthermore, we present an approach that integrates the objective function with graph neural network (GNN)-based semi-supervised node classification methodologies, aiming for additional performance gains. Our results demonstrate that in challenging classification scenarios—characterized by a low probability of homo-connections, a high probability of hetero-connections, and limited prior node information—models based on the higher order network outperform pairwise interaction-based models. Furthermore, the experimental results suggest that integrating our proposed objective function with existing GNN-based node classification approaches enhances the classification performance by efficiently learning higher order structures distributed in the network.

16 October 2023 in arXiv
Verified
Preprint
Open access
PDF file
EKEunho Koo
Eunho Koo
TLTongseok Lim
Tongseok Lim
In the node classification task, it is intuitively understood that densely connected nodes tend to exhibit similar attributes. However, it is crucial to first define what constitutes a dense connection and to develop a reliable mathematical tool for assessing node cohesiveness. In this paper, we propose a probability-based objective function for semi-supervised node classification that takes advantage of higher-order networks' capabilities. The proposed function embodies the philosophy most aligned with the intuition behind classifying within higher-order networks, as it is designed to reduce the likelihood of nodes interconnected through higher-order networks bearing different labels. We evaluate the function using both balanced and imbalanced datasets generated by the Planted Partition Model (PPM), as well as a real-world political book dataset. According to the results, in challenging classification contexts characterized by low homo-connection probability, high hetero-connection probability, and limited prior information of nodes, higher-order networks outperform pairwise interactions in terms of objective function performance. Notably, the objective function exhibits elevated Recall and F1-score relative to Precision in the imbalanced dataset, indicating its potential applicability in many domains where detecting false negatives is critical, even at the expense of some false positives.

1 October 2025 in Neurocomputing
Verified
Journal Article
Closed access
EKEunho Koo
Eunho Koo
TLTongseok Lim
Tongseok Lim