Woncheol Lee

dblp:74/9332 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
3since 2021 · last 2024
0000-0001-9088-7124ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 3 · 2 since 2021Databases, data management, data science and information retrieval · 3 · 3 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
2 papers
Data mining · 68% Web and social media mining · 32%
Artificial intelligence
1 paper
Graph learning · 100%

Topics — the 8 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Data mining › structured data mining › graph mining
community detection
1.222023
A Framework for Accurate Community Detection on Signed Networks Using Adversarial Learning · IEEE Trans. Knowl. Data Eng. 2023
Adversarial Learning of Balanced Triangles for Accurate Community Detection on Signed Networks · ICDM 2021
Data mining › structured data mining › graph mining
network embedding
0.712023
A Framework for Accurate Community Detection on Signed Networks Using Adversarial Learning · IEEE Trans. Knowl. Data Eng. 2023
Web and social media mining › social network analysis
signed social networks
0.712023
A Framework for Accurate Community Detection on Signed Networks Using Adversarial Learning · IEEE Trans. Knowl. Data Eng. 2023
Web and social media mining
social network analysis
0.712023
A Framework for Accurate Community Detection on Signed Networks Using Adversarial Learning · IEEE Trans. Knowl. Data Eng. 2023
Machine learning › Graph learning
network embedding
0.512021
Adversarial Learning of Balanced Triangles for Accurate Community Detection on Signed Networks · ICDM 2021
Machine learning › Graph learning › network embedding
signed network embedding
0.512021
Adversarial Learning of Balanced Triangles for Accurate Community Detection on Signed Networks · ICDM 2021
Data mining › structured data mining
graph mining
0.512021
Adversarial Learning of Balanced Triangles for Accurate Community Detection on Signed Networks · ICDM 2021
Data mining › structured data mining › graph mining › community detection
signed network community detection
0.512021
Adversarial Learning of Balanced Triangles for Accurate Community Detection on Signed Networks · ICDM 2021

Methods — techniques the papers use, named apart from their topics

balance theory · 1.7adversarial learning · 1.7clustering · 1.0k-means clustering · 0.7
YearPublicationVenuePosition
2024 Course Recommendation System for Company Job Placement Using Collaborative Filtering and Hybrid Model
Jaeheon Park, Suan Lee, Woncheol Lee
DATA3
2023 A Framework for Accurate Community Detection on Signed Networks Using Adversarial Learning
abstract
In this article, we propose a framework for embedding-based community detection on signed networks, namelyAdversarial learning ofBalanced triangle forCommunity detection, in short${{\sf ABC}}$. It first represents all the nodes of a signed network as vectors in low-dimensional embedding space and conducts a clustering algorithm (e.g.,k-means) on vectors, thereby detecting a community structure in the network. When performing the embedding process,${{\sf ABC}}$learns only the edges belonging to balanced triangles whose edge signs follow the balance theory, significantly excluding noise edges in learning. To address the sparsity of balanced triangles in a signed network,${{\sf ABC}}$learns not only the edges in balancedreal-triangles but those in balancedvirtual-triangles that do not actually exist but are produced by our generator. Finally,${{\sf ABC}}$employs adversarial learning to generate more-realistic balanced virtual-triangles with less noise edges. Through extensive experiments using seven real-world networks, we validate the effectiveness of (1) learning edges belonging to balanced real/virtual-triangles and (2) employing adversarial learning for signed network embedding. We show that${{\sf ABC}}$consistently and significantly outperforms the state-of-the-art community detection methods in all datasets.
David Yoon Suk Kang, Woncheol Lee, Yeon-Chang Lee, Kyungsik Han, Sang-Wook Kim
IEEE Trans. Knowl. Data Eng.2
2021 Adversarial Learning of Balanced Triangles for Accurate Community Detection on Signed Networks
abstract
In this paper, we propose a framework for embedding-based community detection on signed networks. It first represents all the nodes of a signed network as vectors in low-dimensional embedding space and conducts a clustering algorithm (e.g., k-means) on vectors, thereby detecting a community structure in the network. When performing the embedding process, our framework learns only the edges belonging to balanced triangles whose edge signs follow the balance theory, significantly excluding noise edges in learning. To address the sparsity of balanced triangles in a signed network, our framework learns not only the edges in balanced real-triangles but those in balanced virtual-triangles that are produced by our generator. Finally, our framework employs adversarial learning to generate more-realistic balanced virtual-triangles with less noise edges. Through extensive experiments using seven real-world networks, we validate the effectiveness of (1) learning edges belonging to balanced real/virtual-triangles and (2) employing adversarial learning for signed network embedding. We show that our framework consistently and significantly outperforms the state-of-the-art community detection methods in all datasets.
David Yoon Suk Kang, Woncheol Lee, Yeon-Chang Lee, Kyungsik Han, Sang-Wook Kim
ICDM2
1997 On a cepstral pitch alteration technique for prosody control in the speech synthesis system with high quality
Myungjin Bae, Kyuhong Kim, Woncheol Lee
EUROSPEECH3