EDBT 2026 Demo / reviewers in the wild / expert
Jaewan Chun
dblp:375/1924
· DBLP profile ↗
2ranked-venue papers
2as first author
2since 2021 · last 2025
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 2 · 2 first-author · 2 since 2021Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021
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.
| Artificial intelligence
1 paper |
Graph learning · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Graph learning › graph analytics › graph mining
attributed network analysis |
0.9 | 1 | 2025 | Attributed Hypergraph Generation with Realistic Interplay Between Structure and Attributes · ICDM 2025 |
Machine learning › Graph learning
graph generation |
0.9 | 1 | 2025 | Attributed Hypergraph Generation with Realistic Interplay Between Structure and Attributes · ICDM 2025 |
Machine learning › Graph learning › hypergraph learning
hypergraph generative model |
0.9 | 1 | 2025 | Attributed Hypergraph Generation with Realistic Interplay Between Structure and Attributes · ICDM 2025 |
Methods — techniques the papers use, named apart from their topics
stochastic generative model · 0.9parameter learning · 0.9core-fringe hierarchy · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Attributed Hypergraph Generation with Realistic Interplay Between Structure and AttributesabstractIn many real-world scenarios, interactions happen in a group-wise manner with multiple entities, and therefore, hypergraphs are a suitable tool to accurately represent such interactions. Hyperedges in real-world hypergraphs are not composed of randomly selected nodes but are instead formed through structured processes. Consequently, various hypergraph generative models have been proposed to explore fundamental mechanisms underlying hyperedge formation. However, most existing hypergraph generative models do not account for node attributes, which can play a significant role in hyperedge formation. As a result, these models fail to reflect the interactions between structure and node attributes. To address the issue above, we propose NoAH, a stochastic hypergraph generative model for attributed hypergraphs. NoAH utilizes the core-fringe node hierarchy to model hyperedge formation as a series of node attachments and determines attachment probabilities based on node attributes. We further introduce N oAHFIT, a parameter learning procedure that allows NoAH to replicate a given real-world hypergraph. Through experiments on nine datasets across four different domains, we show that NoAH with NoAHFIT more accurately reproduces the structure-attribute interplay observed in the real-world hypergraphs than eight baseline hypergraph generative models, in terms of six metrics. Jaewan Chun, Seokbum Yoon, Minyoung Choe, Kijung Shin |
ICDM | 1 |
| 2024 | Random walk with restart on hypergraphs: fast computation and an application to anomaly detection
Jaewan Chun, Kijung Shin, Jinhong Jung |
Data Min. Knowl. Discov. | 1 |