Dongwoo Kim

Dongwoo Kim

Auto-generated profile, based on publicly available information

Dongwoo Kim

Pohang University of Science and Technology, Pohang, Republic of Korea

Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

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

Representative Publications

View All Publications
19 September 2022 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Open access
Zhenyue QinZhenyue Qin
Zhenyue Qin
YLYang Liu
Yang Liu
PJPan Ji
Pan Ji
DKDongwoo Kim
Dongwoo Kim
Lei WangLei Wang
Lei Wang
Tom GedeonTom Gedeon
Tom Gedeon
Skeleton sequences are lightweight and compact and thus are ideal candidates for action recognition on edge devices. Recent skeleton-based action recognition methods extract features from 3-D joint coordinates as spatial–temporal cues, using these representations in a graph neural network for feature fusion to boost recognition performance. The use of first-and second-order features, that is, joint and bone representations, has led to high accuracy. Nonetheless, many models are still confused by actions that have similar motion trajectories. To address these issues, we propose fusing higher-order features in the form of angular encoding (AGE) into modern architectures to robustly capture the relationships between joints and body parts. This simple fusion with popular spatial–temporal graph neural networks achieves new state-of-the-art accuracy in two large benchmarks, including NTU60 and NTU120, while employing fewer parameters and reduced run time. Our source code is publicly available at: https://github.com/ZhenyueQin/Angular-Skeleton-Encoding.

1 April 2020 in Applied Surface Science
Verified
Journal Article
Closed access
ACAhrom Choi
Ahrom Choi
JPJuyun Park
Juyun Park
JKJisoo Kang
Jisoo Kang
OJOliver Jonas
Oliver Jonas
DKDong-Woo Kim
Dong-Woo Kim
YKYong-Cheol Kang
Yong-Cheol Kang

21 October 2023
Verified
Conference Paper
Open access
DKDain Kim
Dain Kim
JPJinhyeok Park
Jinhyeok Park
DKDongwoo Kim
Dongwoo Kim
Popularity bias is a widespread problem in the field of recommender systems, where popular items tend to dominate recommendation results. In this work, we propose 'Test Time Embedding Normalization' as a simple yet effective strategy for mitigating popularity bias, which surpasses the performance of the previous mitigation approaches by a significant margin. Our approach utilizes the normalized item embedding during the inference stage to control the influence of embedding magnitude, which is highly correlated with item popularity. Through extensive experiments, we show that our method combined with the sampled softmax loss effectively reduces popularity bias compare to previous approaches for bias mitigation. We further investigate the relationship between user and item embeddings and find that the angular similarity between embeddings distinguishes preferable and non-preferable items regardless of their popularity. The analysis explains the mechanism behind the success of our approach in eliminating the impact of popularity bias. Our code is available at https://github.com/ml-postech/TTEN.

30 April 2014 in The Journal of the Korea institute of electronic communication sciences
Verified
Journal Article
Open access
YHYoung-Oh Han
Young-Oh Han
DKDong-Woo Kim
Dong-Woo Kim

30 January 2019
Verified
Conference Paper
Open access
MSMinjeong Shin
Minjeong Shin
DKDongwoo Kim
Dongwoo Kim
JLJae Hee Lee
Jae Hee Lee
UBUmanga Bista
Umanga Bista
LXLexing Xie
Lexing Xie

26 March 2024 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
YZYiqun Zhang
Yiqun Zhang
Zhenyue QinZhenyue Qin
Zhenyue Qin
SASaeed Anwar
Saeed Anwar
DKDongwoo Kim
Dongwoo Kim
YLYang Liu
Yang Liu
Tom GedeonTom Gedeon
Tom Gedeon
Most existing graph neural networks (GNNs) learn node embeddings using the framework of message passing and aggregation. Such GNNs are incapable of learning relative positions between graph nodes within a graph. To empower GNNs with the awareness of node positions, some nodes are set as anchors. Then, using the distances from a node to the anchors, GNNs can infer relative positions between nodes. However, position-aware GNNs (P-GNNs) arbitrarily select anchors, leading to compromising position awareness and feature extraction. To eliminate this compromise, we demonstrate that selecting evenly distributed and asymmetric anchors is essential. On the other hand, we show that choosing anchors that can aggregate embeddings of all the nodes within a graph is NP-complete. Therefore, devising efficient optimal algorithms in a deterministic approach is practically not feasible. To ensure position awareness and bypass NP-completeness, we propose position-sensing GNNs (PSGNNs), learning how to choose anchors in a backpropagatable fashion. Experiments verify the effectiveness of PSGNNs against state-of-the-art GNNs, substantially improving performance on various synthetic and real-world graph datasets while enjoying stable scalability. Specifically, PSGNNs on average boost area under the curve (AUC) more than 14% for pairwise node classification and 18% for link prediction over the existing state-of-the-art position-aware methods. Our source code is publicly available at: https://github.com/ZhenyueQin/PSGNN.