Jaemin Yoo

Jaemin Yoo

Auto-generated profile, based on publicly available information

Jaemin Yoo

Seoul National University, Seoul, Republic of Korea

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

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

Representative Publications

View All Publications
4 August 2023
Verified
Conference Paper
Open access
MCMinyoung Choe
Minyoung Choe
SKSunwoo Kim
Sunwoo Kim
JYJaemin Yoo
Jaemin Yoo
KSKijung Shin
Kijung Shin

30 April 2023
Verified
Conference Paper
Open access
VFValeria Fionda
Valeria Fionda
OHOlaf Hartig
Olaf Hartig
RAReyhaneh Abdolazimi
Reyhaneh Abdolazimi
SASihem Amer-Yahia
Sihem Amer-Yahia
HCHongzhi Chen
Hongzhi Chen
WZWenwu Zhu
Wenwu Zhu
This paper summarizes the content of the 28 tutorials that have been given at The Web Conference 2023.

4 August 2023
Verified
Conference Paper
Open access
SKSunwoo Kim
Sunwoo Kim
FBFanchen Bu
Fanchen Bu
MCMinyoung Choe
Minyoung Choe
JYJaemin Yoo
Jaemin Yoo
KSKijung Shin
Kijung Shin
Many real-world interactions (e.g., researcher collaborations and email communication) occur among multiple entities. These group interactions are naturally modeled as hypergraphs. In graphs, transitivity is helpful to understand the connections between node pairs sharing a neighbor, and it has extensive applications in various domains. Hypergraphs, an extension of graphs, are designed to represent group relations. However, to the best of our knowledge, there has been no examination regarding the transitivity of real-world group interactions. In this work, we investigate the transitivity of group interactions in real-world hypergraphs. We first suggest intuitive axioms as necessary characteristics of hypergraph transitivity measures. Then, we propose a principled hypergraph transitivity measure HyperTrans, which satisfies all the proposed axioms, with a fast computation algorithm Fast-HyperTrans. After that, we analyze the transitivity patterns in real-world hypergraphs distinguished from those in random hypergraphs. Lastly, we propose a scalable hypergraph generator THera. It reproduces the observed transitivity patterns by leveraging community structures, which are pervasive in real-world hypergraphs. Our code and datasets are available at https://github.com/kswoo97/hypertrans.

26 April 2024 in ACM Transactions on Knowledge Discovery From Data
Verified
Journal Article
Open access
MCMinyoung Choe
Minyoung Choe
JYJaemin Yoo
Jaemin Yoo
GLGeon Lee
Geon Lee
WBWoonsung Baek
Woonsung Baek
UKU Kang
U Kang
KSKijung Shin
Kijung Shin
Graphs are widely used for representing pairwise interactions in complex systems. Since such real-world graphs are large and often evergrowing, sampling subgraphs is useful for various purposes, including simulation, visualization, stream processing, representation learning, and crawling. However, many complex systems consist of group interactions (e.g., collaborations of researchers and discussions on online Q&A platforms) and thus are represented more naturally and accurately by hypergraphs than by ordinary graphs. Motivated by the prevalence of large-scale hypergraphs, we study the problem of sampling from real-world hypergraphs, aiming at answering (Q1) how can we measure the goodness of sub-hypergraphs, and (Q2) how can we efficiently find a “good” sub-hypergraph. Regarding Q1, we distinguish between two goals: (a) representative sampling , which aims at capturing the characteristics of the input hypergraph, and (b) back-in-time sampling , which aims at closely approximating a past snapshot of the input time-evolving hypergraph. To evaluate the similarity of the sampled sub-hypergraph to the target (i.e., the input hypergraph or its past snapshot), we consider 10 graph-level, hyperedge-level, and node-level statistics. Regarding Q2, we first conduct a thorough analysis of various intuitive approaches using 11 real-world hypergraphs. Then, based on this analysis, we propose MiDaS and MiDaS-B , designed for representative sampling and back-in-time sampling, respectively. Regarding representative sampling, we demonstrate through extensive experiments that MiDaS , which employs a sampling bias toward high-degree nodes in hyperedge selection, is (a) Representative : finding overall the most representative samples among 15 considered approaches, (b) Fast : several orders of magnitude faster than the strongest competitors, and (c) Automatic : automatically tuning the degree of sampling bias. Regarding back-in-time sampling, we demonstrate that MiDaS-B inherits the strengths of MiDaS despite an additional challenge—the unavailability of the target (i.e., past snapshot). It effectively handles this challenge by focusing on replicating universal evolutionary patterns, rather than directly replicating the target.

4 August 2023
Verified
Conference Paper
Open access
JYJaemin Yoo
Jaemin Yoo
MLMeng-Chieh Lee
Meng-Chieh Lee
SSShubhranshu Shekhar
Shubhranshu Shekhar
CFChristos Faloutsos
Christos Faloutsos