{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T05:23:28Z","timestamp":1780637008388,"version":"3.54.1"},"reference-count":58,"publisher":"Oxford University Press (OUP)","issue":"5","license":[{"start":{"date-parts":[[2024,10,21]],"date-time":"2024-10-21T00:00:00Z","timestamp":1729468800000},"content-version":"vor","delay-in-days":41,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024,9,10]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>In this paper, we propose a scalable community detection algorithm using hypergraph modularity function, h\u2013Louvain. It is an adaptation of the classical Louvain algorithm in the context of hypergraphs. We observe that a direct application of the Louvain algorithm to optimize the hypergraph modularity function often fails to find meaningful communities. We propose a solution to this issue by adjusting the initial stage of the algorithm via carefully and dynamically tuned linear combination of the graph modularity function of the corresponding two-section graph and the desired hypergraph modularity function. The process is guided by Bayesian optimization of the hyper-parameters of the proposed procedure. Various experiments on synthetic as well as real-world networks are performed showing that this process yields improved results in various regimes.<\/jats:p>","DOI":"10.1093\/comnet\/cnae041","type":"journal-article","created":{"date-parts":[[2024,10,21]],"date-time":"2024-10-21T17:57:47Z","timestamp":1729533467000},"source":"Crossref","is-referenced-by-count":11,"title":["Modularity based community detection in hypergraphs"],"prefix":"10.1093","volume":"12","author":[{"given":"Bogumi\u0142","family":"Kami\u0144ski","sequence":"first","affiliation":[{"name":"Decision Analysis and Support Unit, SGH Warsaw School of Economics , Al. Niepodleglosci 162 , 2-554 Warsaw,","place":["Poland"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pawe\u0142","family":"Misiorek","sequence":"additional","affiliation":[{"name":"Institute of Computer Sciences, Poznan University of Technology , Piotrowo 2 , 60-965 Poznan,","place":["Poland"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pawe\u0142","family":"Pra\u0142at","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Toronto Metropolitan University , 350 Victoria St , Toronto, ON, M5B 2K3,","place":["Canada"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fran\u00e7ois","family":"Th\u00e9berge","sequence":"additional","affiliation":[{"name":"Tutte Institute for Mathematics and Computing , Ottawa, ON,","place":["Canada"]}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"286","published-online":{"date-parts":[[2024,10,21]]},"reference":[{"key":"2024102117574328500_cnae041-B1","doi-asserted-by":"crossref","first-page":"E11221","DOI":"10.1073\/pnas.1800683115","article-title":"Simplicial closure and higher-order link prediction","volume":"115","author":"Benson","year":"2018","journal-title":"Proc Natl Acad Sci USA"},{"key":"2024102117574328500_cnae041-B2","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1186\/s12859-021-04197-2","article-title":"Hypergraph models of biological networks to identify genes critical to pathogenic viral response","volume":"22","author":"Feng","year":"2021","journal-title":"BMC Bioinformatics"},{"key":"2024102117574328500_cnae041-B3","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511761942","volume-title":"Networks, Crowds, and Markets: Reasoning About a Highly Connected World","author":"Easley","year":"2010"},{"key":"2024102117574328500_cnae041-B4","doi-asserted-by":"crossref","DOI":"10.2307\/j.ctvcm4gh1","volume-title":"Social and Economic Networks","author":"Jackson","year":"2010"},{"key":"2024102117574328500_cnae041-B5","doi-asserted-by":"crossref","DOI":"10.1201\/9781003218869","volume-title":"Mining Complex Networks","author":"Kami\u0144ski","year":"2021"},{"key":"2024102117574328500_cnae041-B6","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198805090.001.0001","volume-title":"Networks","author":"Newman","year":"2018"},{"key":"2024102117574328500_cnae041-B7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.physrep.2020.05.004","article-title":"Networks beyond pairwise interactions: structure and dynamics","volume":"874","author":"Battiston","year":"2020","journal-title":"Phys Rep"},{"issue":"1","key":"2024102117574328500_cnae041-B8","article-title":"Higher-order network analysis takes off, fueled by old ideas and new data","volume":"21","author":"Benson","journal-title":"SIAM News Blog"},{"key":"2024102117574328500_cnae041-B9","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1126\/science.aad9029","article-title":"Higher-order organization of complex networks","volume":"353","author":"Benson","year":"2016","journal-title":"Science"},{"key":"2024102117574328500_cnae041-B10","author":"Lambiotte","year":"2018"},{"key":"2024102117574328500_cnae041-B11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3682112.3682114","article-title":"Higher-order networks representation and learning: A survey","volume":"26","author":"Tian","year":"2024","journal-title":"ACM SIGKDD Explorations Newsletter"},{"key":"2024102117574328500_cnae041-B12","author":"Lee","year":"2024"},{"key":"2024102117574328500_cnae041-B13","author":"Xia","year":"2021"},{"key":"2024102117574328500_cnae041-B14","first-page":"1266","volume-title":"Proceedings of the IEEE\/CVF International Conference on Computer Vision","author":"Liao","year":"2021"},{"key":"2024102117574328500_cnae041-B15","volume-title":"Be more with less: Hypergraph attention networks for inductive text classification","author":"Ding","year":"2020"},{"key":"2024102117574328500_cnae041-B16","article-title":"Generative Methods for Social Media Analysis","author":"Matwin","year":"2023","journal-title":"Springer Nat"},{"key":"2024102117574328500_cnae041-B17","doi-asserted-by":"crossref","first-page":"103402","DOI":"10.1088\/1742-5468\/ac946f","article-title":"Structure of international trade hypergraphs","volume":"2022","author":"Yi","year":"2022","journal-title":"J Stat Mech Theory Exp"},{"key":"2024102117574328500_cnae041-B18","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1016\/j.aei.2017.06.004","article-title":"Hypergraphs and extremal optimization in 3d integrated circuit design automation","volume":"33","author":"Grzesiak-Kope\u0107","year":"2017","journal-title":"Adv Eng Inf"},{"key":"2024102117574328500_cnae041-B19","first-page":"3396","author":"Lee","year":"2021"},{"key":"2024102117574328500_cnae041-B20","doi-asserted-by":"crossref","first-page":"1301994","DOI":"10.3389\/fphy.2023.1301994","article-title":"Hypergraph patterns and collaboration structure","volume":"11","author":"Juul","year":"2024","journal-title":"Frontiers in Physics"},{"key":"2024102117574328500_cnae041-B21","doi-asserted-by":"crossref","first-page":"959","DOI":"10.1109\/JSTSP.2018.2837638","article-title":"Hypergraph spectral clustering in the weighted stochastic block model","volume":"12","author":"Ahn","year":"2018","journal-title":"IEEE J Select Topics Sign Process"},{"key":"2024102117574328500_cnae041-B22","first-page":"118","author":"Benson","year":"2015"},{"key":"2024102117574328500_cnae041-B23","author":"Chien","year":"2018"},{"key":"2024102117574328500_cnae041-B24","doi-asserted-by":"crossref","first-page":"eabh1303","DOI":"10.1126\/sciadv.abh1303","article-title":"Generative hypergraph clustering: from blockmodels to modularity","volume":"7","author":"Chodrow","year":"2021","journal-title":"Sci Adv"},{"key":"2024102117574328500_cnae041-B25","doi-asserted-by":"crossref","first-page":"e0224307","DOI":"10.1371\/journal.pone.0224307","article-title":"Clustering via hypergraph modularity","volume":"14","author":"Kami\u0144ski","year":"2019","journal-title":"PLoS One"},{"key":"2024102117574328500_cnae041-B26","author":"Kami\u0144ski","year":"2020"},{"issue":"1","key":"2024102117574328500_cnae041-B27","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1007\/s41109-020-00300-3","article-title":"Hypergraph clustering by iteratively reweighted modularity maximization","volume":"5","author":"Kumar","year":"2020","journal-title":"Appl Netw Sci"},{"key":"2024102117574328500_cnae041-B28","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1007\/978-3-030-36687-2_24","volume-title":"Complex Networks and Their Applications VIII","author":"Kumar","year":"2020"},{"key":"2024102117574328500_cnae041-B29","doi-asserted-by":"crossref","first-page":"052306","DOI":"10.1103\/PhysRevE.97.052306","article-title":"Higher-order clustering in networks","volume":"97","author":"Yin","year":"2018","journal-title":"Phys Rev E"},{"key":"2024102117574328500_cnae041-B30","author":"Yin","year":"2017"},{"key":"2024102117574328500_cnae041-B31","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1109\/TKDE.2007.190689","article-title":"On modularity clustering","volume":"20","author":"Brandes","year":"2007","journal-title":"IEEE Trans Knowledge Data Eng"},{"key":"2024102117574328500_cnae041-B32","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/j.physrep.2009.11.002","article-title":"Community detection in graphs","volume":"486","author":"Fortunato","year":"2010","journal-title":"Phys Rep"},{"key":"2024102117574328500_cnae041-B33","doi-asserted-by":"crossref","first-page":"8577","DOI":"10.1073\/pnas.0601602103","article-title":"Modularity and community structure in networks","volume":"103","author":"Newman","year":"2006","journal-title":"Proc Natl Acad Sci USA"},{"key":"2024102117574328500_cnae041-B34","doi-asserted-by":"crossref","first-page":"P10008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","article-title":"Fast unfolding of communities in large networks","volume":"2008","author":"Blondel","year":"2008","journal-title":"J Stat Mech Theory Exp"},{"key":"2024102117574328500_cnae041-B35","doi-asserted-by":"crossref","first-page":"5233","DOI":"10.1038\/s41598-019-41695-z","article-title":"From Louvain to Leiden: guaranteeing well-connected communities","volume":"9","author":"Traag","year":"2019","journal-title":"Sci Rep"},{"key":"2024102117574328500_cnae041-B36","doi-asserted-by":"crossref","first-page":"114200","DOI":"10.1016\/j.chaos.2023.114200","article-title":"Detecting communities in higher-order networks by using their derivative graphs","volume":"177","author":"Contreras-Aso","year":"2023","journal-title":"Chaos Solitons Fractals"},{"key":"2024102117574328500_cnae041-B37","author":"Kami\u0144ski","year":"2023"},{"key":"2024102117574328500_cnae041-B38","doi-asserted-by":"crossref","first-page":"026113","DOI":"10.1103\/PhysRevE.69.026113","article-title":"Finding and evaluating community structure in networks","volume":"69","author":"Newman","year":"2004","journal-title":"Phys Rev E"},{"key":"2024102117574328500_cnae041-B39","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1073\/pnas.0605965104","article-title":"Resolution limit in community detection","volume":"104","author":"Fortunato","year":"2007","journal-title":"Proc Natl Acad Sci USA"},{"key":"2024102117574328500_cnae041-B40","doi-asserted-by":"crossref","first-page":"066111","DOI":"10.1103\/PhysRevE.70.066111","article-title":"Finding community structure in very large networks","volume":"70","author":"Clauset","year":"2004","journal-title":"Phys Rev E"},{"key":"2024102117574328500_cnae041-B41","doi-asserted-by":"crossref","first-page":"066122","DOI":"10.1103\/PhysRevE.84.066122","article-title":"Limits of modularity maximization in community detection","volume":"84","author":"Lancichinetti","year":"2011","journal-title":"Phys Rev E"},{"key":"2024102117574328500_cnae041-B42","doi-asserted-by":"crossref","first-page":"066133","DOI":"10.1103\/PhysRevE.69.066133","article-title":"Fast algorithm for detecting community structure in networks","volume":"69","author":"Newman","year":"2004","journal-title":"Phys Rev E"},{"key":"2024102117574328500_cnae041-B43","article-title":"Complex graphs and networks","volume":"107","author":"Chung Graham","year":"2006","journal-title":"Am Math Soc"},{"key":"2024102117574328500_cnae041-B44","doi-asserted-by":"crossref","first-page":"046110","DOI":"10.1103\/PhysRevE.78.046110","article-title":"Benchmark graphs for testing community detection algorithms","volume":"78","author":"Lancichinetti","year":"2008","journal-title":"Phys Rev E"},{"key":"2024102117574328500_cnae041-B45","doi-asserted-by":"crossref","first-page":"016118","DOI":"10.1103\/PhysRevE.80.016118","article-title":"Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities","volume":"80","author":"Lancichinetti","year":"2008","journal-title":"Phys Rev E"},{"key":"2024102117574328500_cnae041-B46","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1017\/nws.2020.45","article-title":"Artificial benchmark for community detection (abcd)\u2013fast random graph model with community structure","volume":"9","author":"Kami\u0144ski","year":"2021","journal-title":"Netw Sci"},{"key":"2024102117574328500_cnae041-B47","doi-asserted-by":"crossref","first-page":"100348","DOI":"10.1016\/j.bdr.2022.100348","article-title":"Properties and performance of the abcde random graph model with community structure","volume":"30","author":"Kaminski","year":"2022","journal-title":"Big Data Res"},{"key":"2024102117574328500_cnae041-B48","doi-asserted-by":"crossref","first-page":"cnac050","DOI":"10.1093\/comnet\/cnac050","article-title":"Modularity of the abcd random graph model with community structure","volume":"10","author":"Kami\u0144ski","year":"2022","journal-title":"J Complex Netw"},{"key":"2024102117574328500_cnae041-B49","first-page":"17","author":"Barrett","year":"2024"},{"key":"2024102117574328500_cnae041-B50","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/s41109-023-00552-9","article-title":"Artificial benchmark for community detection with outliers (abcd+o)","volume":"8","author":"Kami\u0144ski","year":"2023","journal-title":"Appl Netw Sci"},{"key":"2024102117574328500_cnae041-B51","doi-asserted-by":"crossref","first-page":"cnad028","DOI":"10.1093\/comnet\/cnad028","article-title":"Hypergraph artificial benchmark for community detection (h\u2013abcd)","volume":"11","author":"Kami\u0144ski","year":"2023","journal-title":"J Complex Netw"},{"key":"2024102117574328500_cnae041-B52","doi-asserted-by":"crossref","first-page":"e23176","DOI":"10.1371\/journal.pone.0023176","article-title":"High-resolution measurements of face-to-face contact patterns in a primary school","volume":"6","author":"Stehl\u00e9","year":"2011","journal-title":"PLoS ONE"},{"key":"2024102117574328500_cnae041-B53","doi-asserted-by":"crossref","first-page":"e0136497","DOI":"10.1371\/journal.pone.0136497","article-title":"Contact patterns in a high school: a comparison between data collected using wearable sensors, contact diaries and friendship surveys","volume":"10","author":"Mastrandrea","year":"2015","journal-title":"PLoS ONE"},{"key":"2024102117574328500_cnae041-B54","first-page":"1509","volume-title":"Advances in Neural Information Processing Systems (NeurIPS)","author":"Yadati","year":"2019"},{"key":"2024102117574328500_cnae041-B55","doi-asserted-by":"crossref","first-page":"e1602548","DOI":"10.1126\/sciadv.1602548","article-title":"The ground truth about metadata and community detection in networks","volume":"3","author":"Peel","year":"2017","journal-title":"Sci Adv"},{"key":"2024102117574328500_cnae041-B56","author":"Frazier","year":"2018"},{"key":"2024102117574328500_cnae041-B57","author":"Nogueira","year":"2014"},{"key":"2024102117574328500_cnae041-B58","author":"Barrett","year":"2024"}],"container-title":["Journal of Complex Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/comnet\/article-pdf\/12\/5\/cnae041\/59933425\/cnae041.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/comnet\/article-pdf\/12\/5\/cnae041\/59933425\/cnae041.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,21]],"date-time":"2024-10-21T17:57:57Z","timestamp":1729533477000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comnet\/article\/doi\/10.1093\/comnet\/cnae041\/7829128"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9,10]]},"references-count":58,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2024,9,10]]}},"URL":"https:\/\/doi.org\/10.1093\/comnet\/cnae041","relation":{},"ISSN":["2051-1329"],"issn-type":[{"value":"2051-1329","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2024,10]]},"published":{"date-parts":[[2024,9,10]]},"article-number":"cnae041"}}