MEGA: Multi-View Semi-Supervised Clustering of Hypergraphs
Summary: MEGA performs semi-supervised hypergraph clustering by jointly integrating multiple relational views, entity attributes, and content with partial labels. It links normalized cut to weighted kernel K-Means and uses an efficient multilevel initializer. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Joyce Jiyoung Whang (Sungkyunkwan University)
- 2. Rundong Du (Georgia Institute of Technology)
- 3. Sangwon Jung (Sungkyunkwan University)
- 4. Geon Lee (Sungkyunkwan University)
- 5. Barry Drake (Georgia Tech Research Institute)
- 6. Qingqing Liu (Georgia Institute of Technology)
- 7. Seonggoo Kang (Naver Corporation)
- 8. Haesun Park (Georgia Institute of Technology)
BibTeX Citation
@article{whang_vldb20,
title = {{MEGA: Multi-View Semi-Supervised Clustering of Hypergraphs}},
author = {Whang, Joyce Jiyoung and Du, Rundong and Jung, Sangwon and Lee, Geon and Drake, Barry and Liu, Qingqing and Kang, Seonggoo and Park, Haesun},
journal = {PVLDB},
series = {{VLDB} '20},
volume = {13},
number = {5},
pages = {698--711},
doi = {10.14778/3377369.3377378},
url = {https://doi.org/10.14778/3377369.3377378},
year = {2020}
}Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,315 | Neighborhood-based Hypergraph Core Decomposition | 2023 | VLDB | 6.6663685e-05 |
| 6,083 | On Graph Representation for Attributed Hypergraph Clustering | 2025 | SIGMOD | 5.8894397e-05 |
| 8,364 | Efficient and Effective Attributed Hypergraph Clustering via K-Nearest Neighbor Augmentation | 2023 | SIGMOD | 5.3450813e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 4 of 4 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 375 | Graph Clustering Based on Structural/Attribute Similarities | 2009 | VLDB | 0.00019619557 |
| 2,692 | A Model-based Approach to Attributed Graph Clustering | 2012 | SIGMOD | 8.1203287e-05 |
| 3,210 | Relation Strength-Aware Clustering of Heterogeneous Information Networks with Incomplete Attributes | 2012 | VLDB | 7.5337704e-05 |
| 3,633 | Efficient and Effective Algorithms for Clustering Uncertain Graphs | 2019 | VLDB | 7.1460604e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 11,366 | Effective and Efficient Attributed Hypergraph Embedding on Nodes and Hyperedges | 2025 | VLDB |
| 2 | 3,210 | Relation Strength-Aware Clustering of Heterogeneous Information Networks with Incomplete Attributes | 2012 | VLDB |
| 3 | 375 | Graph Clustering Based on Structural/Attribute Similarities | 2009 | VLDB |
| 4 | 11,732 | Modularity-based Hypergraph Clustering: Random Hypergraph Model, Hyperedge-cluster Relation, and Computation | 2023 | SIGMOD |
| 5 | 10,816 | Efficient Hyper-truss Decomposition over Hypergraphs | 2026 | VLDB |
| 6 | 10,267 | Efficient High-Quality Clustering for Large Bipartite Graphs | 2024 | SIGMOD |
| 7 | 13,585 | Effective Clustering for Large Multi-Relational Graphs | 2026 | SIGMOD |
| 8 | 11,452 | Efficient Computation of Hyper-triangles on Hypergraphs | 2025 | VLDB |
| 9 | 6,083 | On Graph Representation for Attributed Hypergraph Clustering | 2025 | SIGMOD |
| 10 | 8,364 | Efficient and Effective Attributed Hypergraph Clustering via K-Nearest Neighbor Augmentation | 2023 | SIGMOD |