CCAHCL: Multi-Level Hypergraph Contrastive Learning for Connected Component Awareness
Zhuo Li, Gengyu Lyu, Yuena Lin, Ziang Chen, Zhiyuan Ma, Zhen Yang, Zun Li
Abstract
Hypergraph contrastive learning has emerged as a powerful unsupervised paradigm for hypergraph representation learning. Traditional hypergraph contrastive learning methods typically leverage neighbor aggregation strategy to obtain entity (node and hyperedge) representations within each connected component, and then utilize contrastive losses (e.g., node-or hyperedge-level) to update the encoders. However, since entities are usually focused equally on their respective losses, large connected components with numerous entities tend to provide a dominant contribution to the whole learning process, which inevitably hinders the effective learning of entity representations within small connected components. To address this issue, we propose a novel Connected-Component-Aware Hypergraph Contrastive Learning method (CCAHCL). Different from previous methods that only construct node or hyperedge representations, our method additionally constructs the connected component representations, and accordingly designs a hierarchical contrastive loss to balance the model's focus on different scales of connected components. Specifically, we first use the traditional neighbor aggregation strategy to aggregate and update entity (node and hyperedge) representations. Then, these entity representations are further aggregated to generate the connected component representations, where entity features are incorporated into connected components and their structural information is propagated back to enrich their corresponding entities. Afterwards, we employ node-level and hyperedge-level losses to learn the enriched entity representations, and further propose a novel connected-component-level contrastive loss to balance the model's focus on all different connected components, naturally alleviating the learning bias on large connected components. Extensive experiments on various datasets demonstrate that our proposed model achieves superior performance against other state-of-the-art methods.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Builds on6
- A Simple Framework for Contrastive Learning of Visual RepresentationsTing Chen, Simon Kornblith, Mohammad Norouzi, Geoffrey E. HintonICML 2020 · 24,064 citations
- You are AllSet: A Multiset Function Framework for Hypergraph Neural NetworksEli Chien, Chao Pan, Jianhao Peng, Olgica MilenkovicICLR 2022 · 209 citations
- Self-Supervised Hypergraph Transformer for Recommender SystemsLianghao Xia, Chao Huang, Chuxu ZhangKDD 2022 · 142 citations
- Graph Communal Contrastive LearningBolian Li, Baoyu Jing, Hanghang TongWWW 2022 · 77 citations
- Dynamic Hypergraph Structure Learning for Traffic Flow ForecastingYusheng Zhao, Xiao Luo, Wei Ju, Chong Chen et al.ICDE 2023 · 68 citations
Related papers
- From Representation to Clusters: A Contrastive Learning Approach for Attributed Hypergraph ClusteringLi Ni, Shuaikang Zeng, Lin Mu, Longlong LinWWW 2026
- I'm Me, We're Us, and I'm Us: Tri-directional Contrastive Learning on HypergraphsDongjin Lee, Kijung ShinAAAI 2023 · 69 citations
- HCL: Heterogeneity-Aware Hypergraph Contrastive Learning for Robust Representation LearningKaixuan Yao, Ting Guo, Feilong Cao, Ming LiICML 2026
- HyperNoRA: Hyperedge Prediction via Node-Level Relation-Aware Self-Supervised Hypergraph LearningMing Li, Zhanle Zhu, Xinyi Li, Lu Bai et al.AAAI 2026
- Heterophily-aware Contrastive Learning for Heterophilic HypergraphsMing Li, Yongqi Li, Yuting Chen, Feilong Cao et al.AAAI 2026
