activity
20122025
most citedSSumM: Sparse Summarization of Massive Graphs

39 citations · 110 across the 14 of their papers we have counts for

collaborators

14 papers

cs.SI2025★ 5 cited

Experimental Analysis and Evaluation of Cohesive Subgraph Discovery

Dahee Kim, Song Kim, Jeongseon Kim +4

Retrieving cohesive subgraphs in networks is a fundamental problem in social network analysis and graph data management. These subgraphs can be used for marketing strategies or rec…

cs.LG2024★ 1 cited

Multi-Hyperbolic Space-based Heterogeneous Graph Attention Network

Jongmin Park, Seunghoon Han, Jong-Ryul Lee +1

To leverage the complex structures within heterogeneous graphs, recent studies on heterogeneous graph embedding use a hyperbolic space, characterized by a constant negative curvatu…

cs.LG2024★ 2 cited

Hyperbolic Heterogeneous Graph Attention Networks

Jongmin Park, Seunghoon Han, Soohwan Jeong +1

Most previous heterogeneous graph embedding models represent elements in a heterogeneous graph as vector representations in a low-dimensional Euclidean space. However, because hete…

cs.SI2023★ 8 cited

Exploring Cohesive Subgraphs in Hypergraphs: The (k,g)-core Approach

Dahee Kim, Junghoon Kim, Sungsu Lim +1

Identifying cohesive subgraphs in hypergraphs is a fundamental problem that has received recent attention in data mining and engineering fields. Existing approaches mainly focus on…

cs.LG2023

Label-based Graph Augmentation with Metapath for Graph Anomaly Detection

Hwan Kim, Junghoon Kim, Byung Suk Lee +1

Graph anomaly detection has attracted considerable attention from various domain ranging from network security to finance in recent years. Due to the fact that labeling is very cos…

cs.SD2023★ 1 cited

A Unified Compression Framework for Efficient Speech-Driven Talking-Face Generation

Bo-Kyeong Kim, Jaemin Kang, Daeun Seo +5

Virtual humans have gained considerable attention in numerous industries, e.g., entertainment and e-commerce. As a core technology, synthesizing photorealistic face frames from tar…

cs.LG2022★ 4 cited

Graph Anomaly Detection with Graph Neural Networks: Current Status and Challenges

Hwan Kim, Byung Suk Lee, Won-Yong Shin +1

Graphs are used widely to model complex systems, and detecting anomalies in a graph is an important task in the analysis of complex systems. Graph anomalies are patterns in a graph…

cs.SI2022★ 1 cited

LUEM : Local User Engagement Maximization in Networks

Junghoon Kim, Jungeun Kim, Hyun Ji Jeong +1

Understanding a social network is a fundamental problem in social network analysis because of its numerous applications. Recently, user engagement in networks has received extensiv…

cs.SI2022★ 11 cited

Effective and Efficient Core Computation in Signed Networks

Junghoon Kim, Sungsu Lim, Jungeun Kim

With the proliferation of mobile technology and IT development, people can use social network services at any place and anytime. Among many social network mining problems, identify…

cs.SI2022★ 6 cited

OCSM : Finding Overlapping Cohesive Subgraphs with Minimum Degree

Junghoon Kim, Sungsu Lim, Jungeun Kim

Cohesive subgraph discovery in a network is one of the fundamental problems and investigated for several decades. In this paper, we propose the Overlapping Cohesive Subgraphs with…

cs.IR2021★ 5 cited

SiReN: Sign-Aware Recommendation Using Graph Neural Networks

Changwon Seo, Kyeong-Joong Jeong, Sungsu Lim +1

In recent years, many recommender systems using network embedding (NE) such as graph neural networks (GNNs) have been extensively studied in the sense of improving recommendation a…

cs.LG2020★ 26 cited

TornadoAggregate: Accurate and Scalable Federated Learning via the Ring-Based Architecture

Jin-woo Lee, Jaehoon Oh, Sungsu Lim +2

Federated learning has emerged as a new paradigm of collaborative machine learning; however, many prior studies have used global aggregation along a star topology without much cons…

cs.DB2020★ 39 cited

SSumM: Sparse Summarization of Massive Graphs

Kyuhan Lee, Hyeonsoo Jo, Jihoon Ko +2

Given a graph G and the desired size k in bits, how can we summarize G within k bits, while minimizing the information loss? Large-scale graphs have become omnipresent, posing cons…

cs.NI2012★ 1 cited

Stability of the Max-Weight Protocol in Adversarial Wireless Networks

Sungsu Lim, Kyomin Jung, Matthew Andrews

In this paper we consider the Max-Weight protocol for routing and scheduling in wireless networks under an adversarial model. This protocol has received a significant amount of att…