{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T17:42:23Z","timestamp":1777657343948,"version":"3.51.4"},"reference-count":81,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2025,2,10]],"date-time":"2025-02-10T00:00:00Z","timestamp":1739145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Shun Hing Institute of Advanced Engineering, The Chinese University of Hong Kong","award":["#MMT-p2-23"],"award-info":[{"award-number":["#MMT-p2-23"]}]},{"name":"Research Grants Council of the Hong Kong Special Administrative Region, China","award":["12202324, 14217622"],"award-info":[{"award-number":["12202324, 14217622"]}]},{"DOI":"10.13039\/501100006374","name":"Marsden Fund","doi-asserted-by":"publisher","award":["UOA1732"],"award-info":[{"award-number":["UOA1732"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]},{"name":"MBIE Catalyst: Strategic Fund NZ- Singapore Data Science Research Programm","award":["UOAX2001"],"award-info":[{"award-number":["UOAX2001"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. ACM Manag. Data"],"published-print":{"date-parts":[[2025,2,10]]},"abstract":"<jats:p>Attributed Hypergraph Clustering (AHC) aims at partitioning a hypergraph into clusters such that nodes in the same cluster are close to each other with both high connectedness and homogeneous attributes. Existing AHC methods are all based on matrix factorization which may incur a substantial computation cost; more importantly, they inherently require a prior knowledge of the number of clusters as an input which, if inaccurately estimated, shall lead to a significant deterioration in the clustering quality. In this paper, we propose &lt;u&gt;A&lt;\/u&gt;ttributed &lt;u&gt;H&lt;\/u&gt;ypergraph &lt;u&gt;R&lt;\/u&gt;epresentation for &lt;u&gt;C&lt;\/u&gt;lustering (AHRC), a cluster-number-free hypergraph clustering consisting of an effective integration of the hypergraph topology and node attributes for hypergraph representation, a multi-hop modularity function for optimization, and a hypergraph sparsification for scalable computation. AHRC achieves cutting-edge clustering quality and efficiency: compared to the state-of-the-art (SOTA) AHC method on 10 real hypergraphs, AHRC obtains an average of 20% higher F-measure, 24% higher ARI, 26% higher Jaccard Similarity, 10% higher Purity, and runs 5.5\u00d7 faster. As a byproduct, the intermediate result of graph representation dramatically boosts the clustering quality of SOTA contrastive-learning-based hypergraph clustering methods, showing the generality of our graph representation.<\/jats:p>","DOI":"10.1145\/3709741","type":"journal-article","created":{"date-parts":[[2025,2,11]],"date-time":"2025-02-11T15:45:06Z","timestamp":1739288706000},"page":"1-26","source":"Crossref","is-referenced-by-count":7,"title":["On Graph Representation for Attributed Hypergraph Clustering"],"prefix":"10.1145","volume":"3","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9746-8253","authenticated-orcid":false,"given":"Zijin","family":"Feng","sequence":"first","affiliation":[{"name":"Department of Systems Engineering and Engineering Management, and Shun Hing Institute of Advanced Engineering, The Chinese University of Hong Kong, Hong Kong, Hong Kong"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8374-140X","authenticated-orcid":false,"given":"Miao","family":"Qiao","sequence":"additional","affiliation":[{"name":"University of Auckland, Auckland, New Zealand"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-4942-0815","authenticated-orcid":false,"given":"Chengzhi","family":"Piao","sequence":"additional","affiliation":[{"name":"Hong Kong Baptist University, Hong Kong, Hong Kong"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4673-2587","authenticated-orcid":false,"given":"Hong","family":"Cheng","sequence":"additional","affiliation":[{"name":"Department of Systems Engineering and Engineering Management, and Shun Hing Institute of Advanced Engineering, Chinese University of Hong Kong, Hong Kong, Hong Kong"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,2,11]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2005.89"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","unstructured":"William Aiello Fan Chung and Linyuan Lu. 2000. A random graph model for massive graphs. In STOC. 171--180. https:\/\/doi.org\/10.1145\/335305.335326","DOI":"10.1145\/335305.335326"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1073\/PNAS.1800683115"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1609\/AAAI.V38I10.28983"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1088\/1742--5468\/2008\/10\/P10008"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--1--4612-0619--4"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1017\/NWS.2015.9"},{"key":"e_1_2_1_8_1","volume-title":"Maximizing modularity is hard. arXiv preprint physics\/0608255","author":"Brandes Ulrik","year":"2006","unstructured":"Ulrik Brandes, Daniel Delling, Marco Gaertler, Robert G\u00f6rke, Martin Hoefer, Zoran Nikoloski, and Dorothea Wagner. 2006. Maximizing modularity is hard. arXiv preprint physics\/0608255 (2006)."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPR.2010.764"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.231"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/1577069.1755852"},{"key":"e_1_2_1_12_1","volume-title":"Proceedings of the 37th International Conference on Machine Learning, ICML 2020, 13--18","volume":"1607","author":"Chen Ting","year":"2020","unstructured":"Ting Chen, Simon Kornblith, Mohammad Norouzi, and Geoffrey E. Hinton. 2020. A Simple Framework for Contrastive Learning of Visual Representations. In Proceedings of the 37th International Conference on Machine Learning, ICML 2020, 13--18 July 2020, Virtual Event (Proceedings of Machine Learning Research, Vol. 119). PMLR, 1597--1607."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.14778\/3632093.3632106"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1126\/sciadv.abh1303"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.252631999"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.70.066111"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASONAM.2012.215"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2566486.2567986"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-017-0578-x"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.72.027104"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","unstructured":"Issam Falih Nistor Grozavu Rushed Kanawati and Youn\u00e8s Bennani. 2018. Community detection in Attributed Network. In WWW. ACM 1299--1306. https:\/\/doi.org\/10.1145\/3184558.3191570","DOI":"10.1145\/3184558.3191570"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3617335"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2009.11.002"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511790942"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3--642--14929-02"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","unstructured":"Aditya Grover and Jure Leskovec. 2016. node2vec: Scalable Feature Learning for Networks. In SIGKDD. 855--864. https:\/\/doi.org\/10.1145\/2939672.2939754","DOI":"10.1145\/2939672.2939754"},{"key":"e_1_2_1_27_1","volume-title":"International Conference on Machine Learning. PMLR, 3887--3896","author":"Guo Ruiqi","year":"2020","unstructured":"Ruiqi Guo, Philip Sun, Erik Lindgren, Quan Geng, David Simcha, Felix Chern, and Sanjiv Kumar. 2020. Accelerating large-scale inference with anisotropic vector quantization. In International Conference on Machine Learning. PMLR, 3887--3896."},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3340531.3412034"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01908075"},{"key":"e_1_2_1_30_1","volume-title":"Node attribute-enhanced community detection in complex networks. Scientific reports","author":"Jia Caiyan","year":"2017","unstructured":"Caiyan Jia, Yafang Li, Matthew B Carson, Xiaoyang Wang, and Jian Yu. 2017. Node attribute-enhanced community detection in complex networks. Scientific reports, Vol. 7, 1 (2017), 2626."},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","unstructured":"Jinhong Jung Namyong Park Lee Sael and U Kang. 2017. BePI: Fast and Memory-Efficient Method for Billion-Scale Random Walk with Restart. In SIGMOD. ACM 789--804. https:\/\/doi.org\/10.1145\/3035918.3035950","DOI":"10.1145\/3035918.3035950"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","unstructured":"Barakeel Fanseu Kamhoua Lin Zhang Kaili Ma James Cheng Bo Li and Bo Han. 2021. HyperGraph Convolution Based Attributed HyperGraph Clustering. In CIKM. ACM 453--463. https:\/\/doi.org\/10.1145\/3459637.3482437","DOI":"10.1145\/3459637.3482437"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0224307"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/990308.990313"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687698"},{"key":"e_1_2_1_36_1","volume-title":"NIPS","volume":"24","author":"Kim Sungwoong","year":"2011","unstructured":"Sungwoong Kim, Sebastian Nowozin, Pushmeet Kohli, and Chang Yoo. 2011. Higher-order correlation clustering for image segmentation. NIPS, Vol. 24 (2011), 1530--1538."},{"key":"e_1_2_1_37_1","volume-title":"Algorithm design","author":"Kleinberg Jon M.","unstructured":"Jon M. Kleinberg and \u00c9va Tardos. 2006. Algorithm design. Addison-Wesley."},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btg113"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.2204.12656"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/S41109-020-00300--3"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/s41109-020-00300--3"},{"key":"e_1_2_1_42_1","unstructured":"Kevin J. Lang. 2005. Fixing two weaknesses of the Spectral Method. In NIPS. 715--722."},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1609\/AAAI.V37I7.26019"},{"key":"e_1_2_1_44_1","first-page":"2308","article-title":"Inhomogeneous Hypergraph Clustering with Applications","volume":"30","author":"Li Pan","year":"2017","unstructured":"Pan Li and Olgica Milenkovic. 2017. Inhomogeneous Hypergraph Clustering with Applications. In NIPS, Vol. 30. 2308--2318.","journal-title":"NIPS"},{"key":"e_1_2_1_45_1","unstructured":"Pan Li and Olgica Milenkovic. 2018. Submodular hypergraphs: p-laplacians cheeger inequalities and spectral clustering. In ICML. 3014--3023."},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/3589261"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/3474085.3475416"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511809071"},{"key":"e_1_2_1_49_1","volume-title":"Advances in Neural Information Processing Systems 19, Proceedings of the Twentieth Annual Conference on Neural Information Processing Systems","author":"Nadler Boaz","year":"2006","unstructured":"Boaz Nadler and Meirav Galun. 2006. Fundamental Limitations of Spectral Clustering. In Advances in Neural Information Processing Systems 19, Proceedings of the Twentieth Annual Conference on Neural Information Processing Systems, Vancouver, British Columbia, Canada, December 4--7, 2006, Bernhard Sch\u00f6lkopf, John C. Platt, and Thomas Hofmann (Eds.). MIT Press, 1017--1024."},{"key":"e_1_2_1_50_1","volume-title":"Proceedings of the text mining and link analysis workshop, 18th international joint conference on artificial intelligence","author":"Neville Jennifer","year":"2003","unstructured":"Jennifer Neville, Micah Adler, and David Jensen. 2003. Clustering relational data using attribute and link information. In Proceedings of the text mining and link analysis workshop, 18th international joint conference on artificial intelligence. San Francisco, CA: Morgan Kaufmann Publishers, 9--15."},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199206650.001.0001"},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.74.036104"},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D19-1018"},{"key":"e_1_2_1_54_1","unstructured":"RL Ott and Michael Longnecker. 2016. An introduction to statistical methods and data analysis. Cengage Learning."},{"key":"e_1_2_1_55_1","doi-asserted-by":"publisher","unstructured":"Bryan Perozzi Rami Al-Rfou and Steven Skiena. 2014. DeepWalk: online learning of social representations. In SIGKDD. 701--710. https:\/\/doi.org\/10.1145\/2623330.2623732","DOI":"10.1145\/2623330.2623732"},{"key":"e_1_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2007.05.001"},{"key":"e_1_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1109\/34.868688"},{"key":"e_1_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1109\/34.868688"},{"key":"e_1_2_1_59_1","doi-asserted-by":"publisher","unstructured":"Yuuki Takai Atsushi Miyauchi Masahiro Ikeda and Yuichi Yoshida. 2020. Hypergraph Clustering Based on PageRank. In KDD. 1970--1978. https:\/\/doi.org\/10.1145\/3394486.3403248","DOI":"10.1145\/3394486.3403248"},{"key":"e_1_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741093"},{"key":"e_1_2_1_61_1","volume-title":"Mehdi Azabou, Eva L. Dyer, R\u00e9mi Munos, Petar Velickovic, and Michal Valko.","author":"Thakoor Shantanu","year":"2022","unstructured":"Shantanu Thakoor, Corentin Tallec, Mohammad Gheshlaghi Azar, Mehdi Azabou, Eva L. Dyer, R\u00e9mi Munos, Petar Velickovic, and Michal Valko. 2022. Large-Scale Representation Learning on Graphs via Bootstrapping. In ICLR. OpenReview.net. https:\/\/openreview.net\/forum?id=0UXT6PpRpW"},{"key":"e_1_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2006.70"},{"key":"e_1_2_1_63_1","volume-title":"Deep graph infomax. arXiv preprint arXiv:1809.10341","author":"Veli\u010dkovi\u0107 Petar","year":"2018","unstructured":"Petar Veli\u010dkovi\u0107, William Fedus, William L Hamilton, Pietro Li\u00f2, Yoshua Bengio, and R Devon Hjelm. 2018. Deep graph infomax. arXiv preprint arXiv:1809.10341 (2018)."},{"key":"e_1_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1007\/S11222-007--9033-Z"},{"key":"e_1_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11222-007--9033-z"},{"key":"e_1_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.14778\/3377369.3377378"},{"key":"e_1_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1109\/JBHI.2019.2948456"},{"key":"e_1_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.1609\/AAAI.V35I5.16578"},{"key":"e_1_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.14778\/3377369.3377376"},{"key":"e_1_2_1_70_1","doi-asserted-by":"publisher","unstructured":"Renchi Yang Jieming Shi Yin Yang Keke Huang Shiqi Zhang and Xiaokui Xiao. 2021. Effective and Scalable Clustering on Massive Attributed Graphs. In WWW. ACM \/ IW3C2 3675--3687. https:\/\/doi.org\/10.1145\/3442381.3449875","DOI":"10.1145\/3442381.3449875"},{"key":"e_1_2_1_71_1","volume-title":"Hierarchical Graph Representation Learning with Differentiable Pooling. In Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018","author":"Ying Zhitao","year":"2018","unstructured":"Zhitao Ying, Jiaxuan You, Christopher Morris, Xiang Ren, William L. Hamilton, and Jure Leskovec. 2018. Hierarchical Graph Representation Learning with Differentiable Pooling. In Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, NeurIPS 2018, December 3--8, 2018, Montr\u00e9al, Canada. 4805--4815. https:\/\/proceedings.neurips.cc\/paper\/2018\/hash\/e77dbaf6759253c7c6d0efc5690369c7-Abstract.html"},{"key":"e_1_2_1_72_1","volume-title":"Graph Contrastive Learning with Augmentations. In Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020","author":"You Yuning","year":"2020","unstructured":"Yuning You, Tianlong Chen, Yongduo Sui, Ting Chen, Zhangyang Wang, and Yang Shen. 2020. Graph Contrastive Learning with Augmentations. In Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, NeurIPS 2020, December 6--12, 2020, virtual. https:\/\/proceedings.neurips.cc\/paper\/2020\/hash\/3fe230348e9a12c13120749e3f9fa4cd-Abstract.html"},{"key":"e_1_2_1_73_1","doi-asserted-by":"publisher","DOI":"10.1145\/1077464.1077466"},{"key":"e_1_2_1_74_1","unstructured":"Lihi Zelnik-Manor and Pietro Perona. 2004. Self-Tuning Spectral Clustering. In NIPS. 1601--1608."},{"key":"e_1_2_1_75_1","doi-asserted-by":"publisher","unstructured":"Junwei Zhang Min Gao Junliang Yu Lei Guo Jundong Li and Hongzhi Yin. 2021. Double-Scale Self-Supervised Hypergraph Learning for Group Recommendation. In CIKM. ACM 2557--2567. https:\/\/doi.org\/10.1145\/3459637.3482426","DOI":"10.1145\/3459637.3482426"},{"key":"e_1_2_1_76_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.85.066114"},{"key":"e_1_2_1_77_1","doi-asserted-by":"publisher","unstructured":"Chen Zhe Aixin Sun and Xiaokui Xiao. 2019. Community Detection on Large Complex Attribute Network. In KDD. 2041--2049. https:\/\/doi.org\/10.1145\/3292500.3330721","DOI":"10.1145\/3292500.3330721"},{"key":"e_1_2_1_78_1","doi-asserted-by":"publisher","unstructured":"Dengyong Zhou Jiayuan Huang and Bernhard Sch\u00f6lkopf. 2006. Learning with Hypergraphs: Clustering Classification and Embedding. In NeurIPS. 1601--1608. https:\/\/doi.org\/10.7551\/mitpress\/7503.003.0205","DOI":"10.7551\/mitpress\/7503.003.0205"},{"key":"e_1_2_1_79_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687709"},{"key":"e_1_2_1_80_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2010.41"},{"key":"e_1_2_1_81_1","volume-title":"Deep Graph Contrastive Representation Learning. CoRR","author":"Zhu Yanqiao","year":"2020","unstructured":"Yanqiao Zhu, Yichen Xu, Feng Yu, Qiang Liu, Shu Wu, and Liang Wang. 2020. Deep Graph Contrastive Representation Learning. CoRR, Vol. abs\/2006.04131 (2020). showeprint[arXiv]2006.04131 https:\/\/arxiv.org\/abs\/2006.04131"}],"container-title":["Proceedings of the ACM on Management of Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3709741","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3709741","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T18:18:39Z","timestamp":1774981119000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3709741"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,10]]},"references-count":81,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,2,10]]}},"alternative-id":["10.1145\/3709741"],"URL":"https:\/\/doi.org\/10.1145\/3709741","relation":{},"ISSN":["2836-6573"],"issn-type":[{"value":"2836-6573","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,2,10]]}}}