{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T16:22:00Z","timestamp":1772641320286,"version":"3.50.1"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031322952","type":"print"},{"value":"9783031322969","type":"electronic"}],"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_6","type":"book-chapter","created":{"date-parts":[[2023,5,15]],"date-time":"2023-05-15T23:03:02Z","timestamp":1684191782000},"page":"83-98","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Multilayer Hypergraph Clustering Using the\u00a0Aggregate Similarity Matrix"],"prefix":"10.1007","author":[{"given":"Kalle","family":"Alaluusua","sequence":"first","affiliation":[]},{"given":"Konstantin","family":"Avrachenkov","sequence":"additional","affiliation":[]},{"given":"B. R. Vinay","family":"Kumar","sequence":"additional","affiliation":[]},{"given":"Lasse","family":"Leskel\u00e4","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,5,16]]},"reference":[{"key":"6_CR1","first-page":"1","volume":"18","author":"E Abb\u00e9","year":"2018","unstructured":"Abb\u00e9, E.: Community detection and stochastic block models: recent developments. J. Mach. Learn. Res. 18, 1\u201386 (2018)","journal-title":"J. Mach. Learn. Res."},{"issue":"5","key":"6_CR2","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. Sign. Process. 12(5), 959\u2013974 (2018)","journal-title":"IEEE J. Sel. Top. Sign. Process."},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Alaluusua, K., Leskel\u00e4, L.: Consistent Bayesian community recovery in multilayer networks. In: IEEE International Symposium on Information Theory (ISIT), pp. 2726\u20132731 (2022)","DOI":"10.1109\/ISIT50566.2022.9834757"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Angelini, M.C., Caltagirone, F., Krzakala, F., Zdeborov\u00e1, L.: Spectral detection on sparse hypergraphs. In: Annual Allerton Conference on Communication, Control, and Computing (2015)","DOI":"10.1109\/ALLERTON.2015.7446987"},{"key":"6_CR5","doi-asserted-by":"publisher","DOI":"10.1561\/9781638280514","volume-title":"Statistical Analysis of Networks","author":"K Avrachenkov","year":"2022","unstructured":"Avrachenkov, K., Dreveton, M.: Statistical Analysis of Networks. Now Publishers Inc, Delft (2022)"},{"key":"6_CR6","unstructured":"Avrachenkov, K., Dreveton, M., Leskel\u00e4, L.: Community recovery in non-binary and temporal stochastic block models (2022). https:\/\/arxiv.org\/abs\/2008.04790"},{"key":"6_CR7","unstructured":"Bergman, E., Leskel\u00e4, L.: Connectivity of random hypergraphs with a given hyperedge size distribution (2022). https:\/\/arxiv.org\/abs\/2207.04799"},{"key":"6_CR8","unstructured":"Brusa, L., Matias, C.: Model-based clustering in simple hypergraphs through a stochastic blockmodel (2022). https:\/\/arxiv.org\/abs\/2210.05983"},{"key":"6_CR9","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 (AISTATS) (2018)"},{"issue":"12","key":"6_CR10","doi-asserted-by":"publisher","first-page":"8095","DOI":"10.1109\/TIT.2019.2928301","volume":"65","author":"IE Chien","year":"2019","unstructured":"Chien, I.E., Lin, C.Y., Wang, I.H.: On the minimax misclassification ratio of hypergraph community detection. IEEE Trans. Inf. Theor. 65(12), 8095\u20138118 (2019)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"6_CR11","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/j.laa.2020.01.039","volume":"593","author":"S Cole","year":"2020","unstructured":"Cole, S., Zhu, Y.: Exact recovery in the hypergraph stochastic block model: a spectral algorithm. Linear Algebra Appl. 593, 45\u201373 (2020)","journal-title":"Linear Algebra Appl."},{"key":"6_CR12","unstructured":"Gaudio, J., Joshi, N.: Community detection in the hypergraph SBM: optimal recovery given the similarity matrix (2022). https:\/\/arxiv.org\/abs\/2208.12227"},{"key":"6_CR13","unstructured":"Ghoshdastidar, D., Dukkipati, A.: Consistency of spectral partitioning of uniform hypergraphs under planted partition model. In: Advances in Neural Information Processing Systems (NeurIPS) (2014)"},{"key":"6_CR14","unstructured":"Ghoshdastidar, D., Dukkipati, A.: A provable generalized tensor spectral method for uniform hypergraph partitioning. In: International Conference on Machine Learning (ICML) (2015)"},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"Ghoshdastidar, D., Dukkipati, A.: Spectral clustering using multilinear SVD: analysis, approximations and applications. In: AAAI Conference on Artificial Intelligence (2015)","DOI":"10.1609\/aaai.v29i1.9556"},{"issue":"1","key":"6_CR16","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1214\/16-AOS1453","volume":"45","author":"D Ghoshdastidar","year":"2017","unstructured":"Ghoshdastidar, D., Dukkipati, A.: Consistency of spectral hypergraph partitioning under planted partition model. Ann. Stat. 45(1), 289\u2013315 (2017)","journal-title":"Ann. Stat."},{"key":"6_CR17","unstructured":"G\u00f6sgens, M.M., Tikhonov, A., Prokhorenkova, L.: Systematic analysis of cluster similarity indices: how to validate validation measures. In: International Conference on Machine Learning (ICML) (2021)"},{"issue":"04","key":"6_CR18","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1142\/S2196888820500220","volume":"7","author":"JD Guerrero-Sosa","year":"2020","unstructured":"Guerrero-Sosa, J.D., Men\u00e9ndez-Dom\u00ednguez, V.H., Castellanos-Bola\u00f1os, M.E., Curi-Quintal, L.F.: Analysis of internal and external academic collaboration in an institution through graph theory. Vietnam J. Comput. Sci. 7(04), 391\u2013415 (2020)","journal-title":"Vietnam J. Comput. Sci."},{"issue":"5","key":"6_CR19","doi-asserted-by":"publisher","first-page":"2788","DOI":"10.1109\/TIT.2016.2546280","volume":"62","author":"B Hajek","year":"2016","unstructured":"Hajek, B., Wu, Y., Xu, J.: Achieving exact cluster recovery threshold via semidefinite programming. IEEE Trans. Inf. Theor. 62(5), 2788\u20132797 (2016)","journal-title":"IEEE Trans. Inf. Theor."},{"issue":"1","key":"6_CR20","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF01908075","volume":"2","author":"L Hubert","year":"1985","unstructured":"Hubert, L., Arabie, P.: Comparing partitions. J. Classif. 2(1), 193\u2013218 (1985)","journal-title":"J. Classif."},{"issue":"11","key":"6_CR21","doi-asserted-by":"publisher","first-page":"1","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), 1\u201315 (2019)","journal-title":"PLoS ONE"},{"key":"6_CR22","doi-asserted-by":"crossref","unstructured":"Kami\u0144ski, B., Pra\u0142at, P., Th\u00e9berge, F.: Community detection algorithm using hypergraph modularity. In: International Conference on Complex Networks and their Applications (2021)","DOI":"10.1201\/9781003218869-5"},{"key":"6_CR23","doi-asserted-by":"crossref","unstructured":"Kami\u0144ski, B., Pra\u0142at, P., Th\u00e9berge, F.: Hypergraph artificial benchmark for community detection (h-ABCD) (2022). https:\/\/arxiv.org\/abs\/2210.15009","DOI":"10.1093\/comnet\/cnad028"},{"key":"6_CR24","unstructured":"Ke, Z.T., Shi, F., Xia, D.: Community detection for hypergraph networks via regularized tensor power iteration (2020). https:\/\/arxiv.org\/abs\/1909.06503"},{"key":"6_CR25","doi-asserted-by":"crossref","unstructured":"Kim, C., Bandeira, A.S., Goemans, M.X.: Community detection in hypergraphs, spiked tensor models, and sum-of-squares. In: International Conference on Sampling Theory and Applications (SampTA) (2017)","DOI":"10.1109\/SAMPTA.2017.8024470"},{"key":"6_CR26","unstructured":"Kim, C., Bandeira, A.S., Goemans, M.X.: Stochastic block model for hypergraphs: statistical limits and a semidefinite programming approach (2018). https:\/\/arxiv.org\/abs\/1807.02884"},{"issue":"3","key":"6_CR27","first-page":"203","volume":"2","author":"M Kivel\u00e4","year":"2014","unstructured":"Kivel\u00e4, M., Arenas, A., Barthelemy, M., Gleeson, J.P., Moreno, Y., Porter, M.A.: Multilayer networks. Journal of ComplexJournal of ComplexJournal of ComplexJournal of ComplexJournal of ComplexJ. Complex 2(3), 203\u2013271 (2014)","journal-title":"Journal of ComplexJournal of ComplexJournal of ComplexJournal of ComplexJournal of ComplexJ. Complex"},{"key":"6_CR28","doi-asserted-by":"crossref","unstructured":"Kumar, T., Vaidyanathan, S., Ananthapadmanabhan, H., Parthasarathy, S., Ravindran, B.: A new measure of modularity in hypergraphs: theoretical insights and implications for effective clustering. In: International Conference on Complex Networks and their Applications (2019)","DOI":"10.1007\/978-3-030-36687-2_24"},{"issue":"1","key":"6_CR29","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). https:\/\/doi.org\/10.1007\/s41109-020-00300-3","journal-title":"Appl. Netw. Sci."},{"issue":"3","key":"6_CR30","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1109\/JSAIT.2020.3037170","volume":"1","author":"J Lee","year":"2020","unstructured":"Lee, J., Kim, D., Chung, H.W.: Robust hypergraph clustering via convex relaxation of truncated MLE. IEEE J. Sel. Areas Inf. Theor. 1(3), 613\u2013631 (2020)","journal-title":"IEEE J. Sel. Areas Inf. Theor."},{"issue":"1","key":"6_CR31","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1093\/biomet\/asz068","volume":"107","author":"J Lei","year":"2020","unstructured":"Lei, J., Chen, K., Lynch, B.: Consistent community detection in multi-layer network data. Biometrika 107(1), 61\u201373 (2020)","journal-title":"Biometrika"},{"key":"6_CR32","doi-asserted-by":"crossref","unstructured":"Lesieur, T., Miolane, L., Lelarge, M., Krzakala, F., Zdeborov\u00e1, L.: Statistical and computational phase transitions in spiked tensor estimation. In: 2017 IEEE International Symposium on Information Theory (ISIT), pp. 511\u2013515. IEEE (2017)","DOI":"10.1109\/ISIT.2017.8006580"},{"key":"6_CR33","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1002\/rsa.21006","volume":"59","author":"S Pal","year":"2021","unstructured":"Pal, S., Zhu, Y.: Community detection in the sparse hypergraph stochastic block model. Random Struct. Algorithms 59, 407\u2013463 (2021)","journal-title":"Random Struct. Algorithms"},{"issue":"1","key":"6_CR34","first-page":"678","volume":"13","author":"M Pensky","year":"2019","unstructured":"Pensky, M., Zhang, T.: Spectral clustering in the dynamic stochastic block model. Electr. J. Stat. 13(1), 678\u2013709 (2019)","journal-title":"Electr. J. Stat."},{"key":"6_CR35","doi-asserted-by":"crossref","unstructured":"Stephan, L., Zhu, Y.: Sparse random hypergraphs: Non-backtracking spectra and community detection (2022). https:\/\/arxiv.org\/abs\/2203.07346","DOI":"10.1109\/FOCS54457.2022.00060"},{"issue":"1","key":"6_CR36","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1109\/TIT.2022.3205959","volume":"69","author":"Q Zhang","year":"2023","unstructured":"Zhang, Q., Tan, V.Y.F.: Exact recovery in the general hypergraph stochastic block model. IEEE Trans. Inf. Theor. 69(1), 453\u2013471 (2023)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"6_CR37","unstructured":"Zhen, Y., Wang, J.: Community detection in general hypergraph via graph embedding. J. Am. Stat. Assoc. 1\u201310 (2022)"},{"key":"6_CR38","doi-asserted-by":"crossref","unstructured":"Zhou, D., Huang, J., Sch\u00f6lkopf, B.: Learning with hypergraphs: clustering, classification, and embedding. In: Advances in Neural Information Processing Systems (NeurIPS) (2006)","DOI":"10.7551\/mitpress\/7503.003.0205"}],"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_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T18:41:29Z","timestamp":1710268889000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-32296-9_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031322952","9783031322969"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-32296-9_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"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)"}}]}}