{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,30]],"date-time":"2025-03-30T20:46:09Z","timestamp":1743367569258,"version":"3.40.3"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031322952"},{"type":"electronic","value":"9783031322969"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-32296-9_4","type":"book-chapter","created":{"date-parts":[[2023,5,15]],"date-time":"2023-05-15T23:03:02Z","timestamp":1684191782000},"page":"52-67","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Modularity Based Community Detection in\u00a0Hypergraphs"],"prefix":"10.1007","author":[{"given":"Bogumi\u0142","family":"Kami\u0144ski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pawe\u0142","family":"Misiorek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pawe\u0142","family":"Pra\u0142at","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fran\u00e7ois","family":"Th\u00e9berge","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,5,16]]},"reference":[{"issue":"5","key":"4_CR1","doi-asserted-by":"publisher","first-page":"959","DOI":"10.1109\/JSTSP.2018.2837638","volume":"12","author":"K Ahn","year":"2018","unstructured":"Ahn, K., Lee, K., Suh, C.: Hypergraph spectral clustering in the weighted stochastic block model. IEEE J. Sel. Top. Signal Process. 12(5), 959\u2013974 (2018)","journal-title":"IEEE J. Sel. Top. Signal Process."},{"key":"4_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.physrep.2020.05.004","volume":"874","author":"F Battiston","year":"2020","unstructured":"Battiston, F., et al.: Networks beyond pairwise interactions: structure and dynamics. Phys. Rep. 874, 1\u201392 (2020)","journal-title":"Phys. Rep."},{"issue":"48","key":"4_CR3","doi-asserted-by":"publisher","first-page":"E11221","DOI":"10.1073\/pnas.1800683115","volume":"115","author":"AR Benson","year":"2018","unstructured":"Benson, A.R., Abebe, R., Schaub, M.T., Jadbabaie, A., Kleinberg, J.: Simplicial closure and higher-order link prediction. Proc. Natl. Acad. Sci. 115(48), E11221\u2013E11230 (2018)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"4_CR4","unstructured":"Benson, A.R., Gleich, D.F., Higham, D.J.: Higher-order network analysis takes off, fueled by classical ideas and new data. arXiv preprint arXiv:2103.05031 (2021)"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Benson, A.R., Gleich, D.F., Leskovec, J.: Tensor spectral clustering for partitioning higher-order network structures. In: Proceedings of the 2015 SIAM International Conference on Data Mining, pp. 118\u2013126. SIAM (2015)","DOI":"10.1137\/1.9781611974010.14"},{"issue":"6295","key":"4_CR6","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1126\/science.aad9029","volume":"353","author":"AR Benson","year":"2016","unstructured":"Benson, A.R., Gleich, D.F., Leskovec, J.: Higher-order organization of complex networks. Science 353(6295), 163\u2013166 (2016)","journal-title":"Science"},{"issue":"10","key":"4_CR7","doi-asserted-by":"publisher","first-page":"P10008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","volume":"2008","author":"VD Blondel","year":"2008","unstructured":"Blondel, V.D., Guillaume, J.L., Lambiotte, R., Lefebvre, E.: Fast unfolding of communities in large networks. J. Stat. Mech: Theory Exp. 2008(10), P10008 (2008)","journal-title":"J. Stat. Mech: Theory Exp."},{"key":"4_CR8","unstructured":"Chien, I., Lin, C.Y., Wang, I.H.: Community detection in hypergraphs: optimal statistical limit and efficient algorithms. In: International Conference on Artificial Intelligence and Statistics, pp. 871\u2013879. PMLR (2018)"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Chodrow, P.S., Veldt, N., Benson, A.R.: Generative hypergraph clustering: from blockmodels to modularity. Sci. Adv. 7(28), eabh1303 (2021)","DOI":"10.1126\/sciadv.abh1303"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Chung Graham, F., Lu, L.: Complex graphs and networks. No. 107, American Mathematical Society (2006)","DOI":"10.1090\/cbms\/107"},{"issue":"6","key":"4_CR11","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.70.066111","volume":"70","author":"A Clauset","year":"2004","unstructured":"Clauset, A., Newman, M.E., Moore, C.: Finding community structure in very large networks. Phys. Rev. E 70(6), 066111 (2004)","journal-title":"Phys. Rev. E"},{"key":"4_CR12","first-page":"1","volume":"7","author":"J Dem\u0161ar","year":"2006","unstructured":"Dem\u0161ar, J.: Statistical comparisons of classifiers over multiple data sets. J. Mach. Learn. Res. 7, 1\u201330 (2006)","journal-title":"J. Mach. Learn. Res."},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Easley, D., Kleinberg, J.: Networks, Crowds, and Markets: Reasoning About a Highly Connected World. Cambridge University Press, Cambridge (2010)","DOI":"10.1017\/CBO9780511761942"},{"issue":"1","key":"4_CR14","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1073\/pnas.0605965104","volume":"104","author":"S Fortunato","year":"2007","unstructured":"Fortunato, S., Barthelemy, M.: Resolution limit in community detection. Proc. Natl. Acad. Sci. 104(1), 36\u201341 (2007)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"4_CR15","unstructured":"Jackson, M.O.: Social and Economic Networks. Princeton University Press, Princeton (2010)"},{"key":"4_CR16","unstructured":"Juul, J.L., Benson, A.R., Kleinberg, J.: Hypergraph patterns and collaboration structure. arXiv preprint arXiv:2210.02163 (2022)"},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"Kami\u0144ski, B., Pankratz, B., Pra\u0142at, P., Th\u00e9berge, F.: Modularity of the abcd random graph model with community structure. preprint arXiv:2203.01480 (2022)","DOI":"10.1093\/comnet\/cnac050"},{"issue":"11","key":"4_CR18","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0224307","volume":"14","author":"B Kami\u0144ski","year":"2019","unstructured":"Kami\u0144ski, B., Poulin, V., Pra\u0142at, P., Szufel, P., Th\u00e9berge, F.: Clustering via hypergraph modularity. PLoS ONE 14(11), e0224307 (2019)","journal-title":"PLoS ONE"},{"key":"4_CR19","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/978-3-030-65347-7_13","volume-title":"Complex Networks and Their Applications","author":"B Kami\u0144ski","year":"2020","unstructured":"Kami\u0144ski, B., Pra\u0142at, P., Th\u00e9berge, F.: Community detection algorithm using hypergraph modularity. In: Benito, R.M., Cherifi, C., Cherifi, H., Moro, E., Rocha, L.M., Sales-Pardo, M. (eds.) Complex Networks and Their Applications, pp. 152\u2013163. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-65347-7_13"},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"Kami\u0144ski, B., Pra\u0142at, P., Th\u00e9berge, F.: Artificial benchmark for community detection (ABCD)-fast random graph model with community structure. Netw. Sci. 1\u201326 (2021)","DOI":"10.1201\/9781003218869-5"},{"key":"4_CR21","doi-asserted-by":"crossref","unstructured":"Kami\u0144ski, B., Pra\u0142at, P., Th\u00e9berge, F.: Mining Complex Networks. Chapman and Hall\/CRC, Boca Raton (2021)","DOI":"10.1201\/9781003218869"},{"key":"4_CR22","doi-asserted-by":"crossref","unstructured":"Kami\u0144ski, B., Pra\u0142at, P., Th\u00e9berge, F.: Hypergraph artificial benchmark for community detection (h-ABCD). arXiv preprint arXiv:2210.15009 (2022)","DOI":"10.1093\/comnet\/cnad028"},{"key":"4_CR23","doi-asserted-by":"crossref","unstructured":"Kami\u0144ski, B., Pra\u0142at, P., Th\u00e9berge, F.: Outliers in the ABCD random graph model with community structure (ABCD+O). In: Proceedings of the 11th International Conference on Complex Networks and their Applications (2022, in press)","DOI":"10.1093\/comnet\/cnac050"},{"key":"4_CR24","doi-asserted-by":"publisher","DOI":"10.1016\/j.bdr.2022.100348","volume":"30","author":"B Kami\u0144ski","year":"2022","unstructured":"Kami\u0144ski, B., Olczak, T., Pankratz, B., Pra\u0142at, P., Th\u00e9berge, F.: Properties and performance of the ABCDE random graph model with community structure. Big Data Res. 30, 100348 (2022)","journal-title":"Big Data Res."},{"issue":"1","key":"4_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s41109-020-00300-3","volume":"5","author":"T Kumar","year":"2020","unstructured":"Kumar, T., Vaidyanathan, S., Ananthapadmanabhan, H., Parthasarathy, S., Ravindran, B.: Hypergraph clustering by iteratively reweighted modularity maximization. Appl. Netw. Sci. 5(1), 1\u201322 (2020)","journal-title":"Appl. Netw. Sci."},{"key":"4_CR26","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/978-3-030-36687-2_24","volume-title":"Complex Networks and Their Applications VIII","author":"T Kumar","year":"2020","unstructured":"Kumar, T., Vaidyanathan, S., Ananthapadmanabhan, H., Parthasarathy, S., Ravindran, B.: A new measure of modularity in\u00a0hypergraphs: theoretical insights and\u00a0implications for effective clustering. In: Cherifi, H., Gaito, S., Mendes, J.F., Moro, E., Rocha, L.M. (eds.) COMPLEX NETWORKS 2019. SCI, vol. 881, pp. 286\u2013297. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-36687-2_24"},{"issue":"1","key":"4_CR27","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.80.016118","volume":"80","author":"A Lancichinetti","year":"2009","unstructured":"Lancichinetti, A., Fortunato, S.: Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities. Phys. Rev. E 80(1), 016118 (2009)","journal-title":"Phys. Rev. E"},{"issue":"6","key":"4_CR28","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.84.066122","volume":"84","author":"A Lancichinetti","year":"2011","unstructured":"Lancichinetti, A., Fortunato, S.: Limits of modularity maximization in community detection. Phys. Rev. E 84(6), 066122 (2011)","journal-title":"Phys. Rev. E"},{"issue":"4","key":"4_CR29","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.78.046110","volume":"78","author":"A Lancichinetti","year":"2008","unstructured":"Lancichinetti, A., Fortunato, S., Radicchi, F.: Benchmark graphs for testing community detection algorithms. Phys. Rev. E 78(4), 046110 (2008)","journal-title":"Phys. Rev. E"},{"key":"4_CR30","doi-asserted-by":"crossref","unstructured":"Lee, G., Choe, M., Shin, K.: How do hyperedges overlap in real-world hypergraphs?-patterns, measures, and generators. In: Proceedings of the Web Conference 2021, pp. 3396\u20133407 (2021)","DOI":"10.1145\/3442381.3450010"},{"key":"4_CR31","doi-asserted-by":"crossref","unstructured":"Newman, M.: Networks. Oxford University Press, Oxford (2018)","DOI":"10.1093\/oso\/9780198805090.001.0001"},{"issue":"6","key":"4_CR32","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.69.066133","volume":"69","author":"ME Newman","year":"2004","unstructured":"Newman, M.E.: Fast algorithm for detecting community structure in networks. Phys. Rev. E 69(6), 066133 (2004)","journal-title":"Phys. Rev. E"},{"issue":"2","key":"4_CR33","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.69.026113","volume":"69","author":"ME Newman","year":"2004","unstructured":"Newman, M.E., Girvan, M.: Finding and evaluating community structure in networks. Phys. Rev. E 69(2), 026113 (2004)","journal-title":"Phys. Rev. E"},{"issue":"5","key":"4_CR34","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.97.052306","volume":"97","author":"H Yin","year":"2018","unstructured":"Yin, H., Benson, A.R., Leskovec, J.: Higher-order clustering in networks. Phys. Rev. E 97(5), 052306 (2018)","journal-title":"Phys. Rev. E"},{"key":"4_CR35","doi-asserted-by":"crossref","unstructured":"Yin, H., Benson, A.R., Leskovec, J., Gleich, D.F.: Local higher-order graph clustering. In: Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 555\u2013564 (2017)","DOI":"10.1145\/3097983.3098069"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Models for the Web Graph"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-32296-9_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T18:41:36Z","timestamp":1710268896000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-32296-9_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031322952","9783031322969"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-32296-9_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"16 May 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WAW","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Algorithms and Models for the Web-Graph","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Toronto, ON","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 May 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 May 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"waw2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/math.ryerson.ca\/waw2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easy Chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"21","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"12","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"12","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"57% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"More than 3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}