{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T13:14:05Z","timestamp":1775913245939,"version":"3.50.1"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030366865","type":"print"},{"value":"9783030366872","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,11,26]],"date-time":"2019-11-26T00:00:00Z","timestamp":1574726400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-36687-2_24","type":"book-chapter","created":{"date-parts":[[2019,12,16]],"date-time":"2019-12-16T17:39:57Z","timestamp":1576517997000},"page":"286-297","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["A New Measure of Modularity in\u00a0Hypergraphs: Theoretical Insights and\u00a0Implications for Effective Clustering"],"prefix":"10.1007","author":[{"given":"Tarun","family":"Kumar","sequence":"first","affiliation":[]},{"given":"Sankaran","family":"Vaidyanathan","sequence":"additional","affiliation":[]},{"given":"Harini","family":"Ananthapadmanabhan","sequence":"additional","affiliation":[]},{"given":"Srinivasan","family":"Parthasarathy","sequence":"additional","affiliation":[]},{"given":"Balaraman","family":"Ravindran","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,26]]},"reference":[{"key":"24_CR1","unstructured":"Agarwal, S., Lim, J., Zelnik-Manor, L., Perona, P., Kriegman, D., Belongie, S.: Beyond pairwise clustering. In: 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR 2005), vol.\u00a02, pp. 838\u2013845, June 2005"},{"key":"24_CR2","doi-asserted-by":"crossref","unstructured":"Agarwal, S., Branson, K., Belongie, S.: Higher order learning with graphs. In: ICML 2006: Proceedings of the 23rd International Conference on Machine Learning, pp. 17\u201324 (2006)","DOI":"10.1145\/1143844.1143847"},{"issue":"10","key":"24_CR3","doi-asserted-by":"publisher","first-page":"P10008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","volume":"2008","author":"Vincent D Blondel","year":"2008","unstructured":"Blondel, V.D., loup G., J., L., R., Lefebvre, E.: Fast unfolding of communities in large networks. J. Stat. Mech.: Theory Exp. (10), P10008 (2008)","journal-title":"Journal of Statistical Mechanics: Theory and Experiment"},{"key":"24_CR4","doi-asserted-by":"crossref","unstructured":"Cantador, I., Brusilovsky, P., Kuflik, T.: 2nd workshop on information heterogeneity and fusion in recommender systems (hetrec 2011). In: Proceedings of the 5th ACM Conference on Recommender Systems, RecSys 2011. ACM, New York (2011)","DOI":"10.1145\/2043932.2044016"},{"key":"24_CR5","doi-asserted-by":"publisher","first-page":"1479","DOI":"10.1007\/978-0-387-09766-4_93","volume-title":"Encyclopedia of Parallel Computing","author":"Bruce Leasure","year":"2011","unstructured":"\u00c7ataly\u00fcrek, \u00dc., Aykanat, C.: PaToH (partitioning tool for hypergraphs), pp. 1479\u20131487. Springer, Boston (2011). https:\/\/doi.org\/10.1007\/978-0-387-09766-4_93"},{"key":"24_CR6","unstructured":"Estrada, E., Rodriguez-Velazquez, J.A.: Complex networks as hypergraphs. arXiv preprint physics\/0505137 (2005)"},{"key":"24_CR7","doi-asserted-by":"publisher","unstructured":"Feng, F., He, X., Liu, Y., Nie, L., Chua, T.S.: Learning on partial-order hypergraphs. In: Proceedings of the 2018 World Wide Web Conference, WWW 2018, pp. 1523\u20131532. International World Wide Web Conferences Steering Committee, Republic and Canton of Geneva, Switzerland (2018). https:\/\/doi.org\/10.1145\/3178876.3186064","DOI":"10.1145\/3178876.3186064"},{"key":"24_CR8","doi-asserted-by":"publisher","unstructured":"Greene, D., Sheridan, G., Smyth, B., Cunningham, P.: Aggregating content and network information to curate Twitter user lists. In: Proceedings of the 4th ACM RecSys Workshop on Recommender Systems and the Social Web, RSWeb 2012, pp. 29\u201336. ACM, New York (2012). https:\/\/doi.org\/10.1145\/2365934.2365941","DOI":"10.1145\/2365934.2365941"},{"issue":"7","key":"24_CR9","doi-asserted-by":"publisher","first-page":"885","DOI":"10.1109\/43.144852","volume":"11","author":"SW Hadley","year":"1992","unstructured":"Hadley, S.W., Mark, B.L., Vannelli, A.: An efficient eigenvector approach for finding netlist partitions. IEEE Trans. Comput.-Aided Design Integr. Circ. Syst. 11(7), 885\u2013892 (1992)","journal-title":"IEEE Trans. Comput.-Aided Design Integr. Circ. Syst."},{"key":"24_CR10","unstructured":"Hein, M., Setzer, S., Jost, L., Rangapuram, S.S.: The total variation on hypergraphs - learning on hypergraphs revisited. In: Proceedings of the 26th International Conference on Neural Information Processing Systems, NIPS 2013, vol. 2, pp. 2427\u20132435. Curran Associates Inc., USA (2013). http:\/\/dl.acm.org\/citation.cfm?id=2999792.2999883"},{"issue":"1","key":"24_CR11","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1137\/S1064827595287997","volume":"20","author":"G Karypis","year":"1998","unstructured":"Karypis, G., Kumar, V.: A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. Sci. Comput. 20(1), 359\u2013392 (1998). https:\/\/doi.org\/10.1137\/S1064827595287997","journal-title":"SIAM J. Sci. Comput."},{"issue":"3","key":"24_CR12","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1155\/2000\/19436","volume":"11","author":"G Karypis","year":"2000","unstructured":"Karypis, G., Kumar, V.: Multilevel k-way hypergraph partitioning. VLSI Design 11(3), 285\u2013300 (2000)","journal-title":"VLSI Design"},{"key":"24_CR13","unstructured":"Kim, S., Nowozin, S., Kohli, P., Yoo, C.D.: Higher-order correlation clustering for image segmentation. In: Advances in Neural Information Processing Systems, pp. 1530\u20131538 (2011)"},{"key":"24_CR14","unstructured":"Leordeanu, M., Sminchisescu, C.: Efficient hypergraph clustering. In: Proceedings of the 15th International Conference on Artificial Intelligence and Statistics. Proceedings of Machine Learning Research, vol. 22, pp. 676\u2013684. PMLR (2012). http:\/\/proceedings.mlr.press\/v22\/leordeanu12.html"},{"key":"24_CR15","unstructured":"Liu, H., Latecki, L.J., Yan, S.: Robust clustering as ensembles of affinity relations. In: Advances in Neural Information Processing Systems (2010)"},{"key":"24_CR16","doi-asserted-by":"crossref","unstructured":"Louis, A.: Hypergraph Markov operators, eigenvalues and approximation algorithms. In: Proceedings of the Forty-seventh Annual ACM Symposium on Theory of Computing, STOC 2015, pp. 713\u2013722. ACM, New York (2015)","DOI":"10.1145\/2746539.2746555"},{"issue":"23","key":"24_CR17","doi-asserted-by":"publisher","first-page":"8577","DOI":"10.1073\/pnas.0601602103","volume":"103","author":"ME Newman","year":"2006","unstructured":"Newman, M.E.: Modularity and community structure in networks. Proc. Natl. Acad. Sci. 103(23), 8577\u20138582 (2006)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"24_CR18","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199206650.001.0001","volume-title":"Networks: An Introduction","author":"ME Newman","year":"2010","unstructured":"Newman, M.E.: Networks: An Introduction. Oxford University Press Inc., New York (2010)"},{"key":"24_CR19","doi-asserted-by":"crossref","unstructured":"Papa, D.A., Markov, I.L.: Hypergraph partitioning and clustering. In: In Approximation Algorithms and Metaheuristics. Citeseer (2007)","DOI":"10.1201\/9781420010749.ch61"},{"issue":"6","key":"24_CR20","doi-asserted-by":"publisher","first-page":"1312","DOI":"10.1109\/TPAMI.2012.226","volume":"35","author":"S Rot\u00e1 Bulo","year":"2013","unstructured":"Rot\u00e1 Bulo, S., Pelillo, M.: A game-theoretic approach to hypergraph clustering. IEEE Trans. Pattern Anal. Mach. Intell. 35(6), 1312\u20131327 (2013)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"24_CR21","doi-asserted-by":"crossref","unstructured":"Saito, S., Mandic, D., Suzuki, H.: Hypergraph p-laplacian: a differential geometry view. In: AAAI Conference on Artificial Intelligence (2018)","DOI":"10.1609\/aaai.v32i1.11823"},{"issue":"3","key":"24_CR22","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1609\/aimag.v29i3.2157","volume":"29","author":"P Sen","year":"2008","unstructured":"Sen, P., Namata, G., Bilgic, M., Getoor, L., Galligher, B., Eliassi-Rad, T.: Collective classification in network data. AI Mag. 29(3), 93 (2008)","journal-title":"AI Mag."},{"key":"24_CR23","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/11744085_46","volume-title":"Computer Vision \u2013 ECCV 2006","author":"Amnon Shashua","year":"2006","unstructured":"Shashua, A., Zass, R., Hazan, T.: Multi-way clustering using super-symmetric non-negative tensor factorization. In: Proceedings of the 9th European Conference on Computer Vision, ECCV 2006, vol. IV, pp. 595\u2013608. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11744085_46"},{"key":"24_CR24","doi-asserted-by":"publisher","unstructured":"Yang, J., Leskovec, J.: Defining and evaluating network communities based on ground-truth. In: Proceedings of the ACM SIGKDD Workshop on Mining Data Semantics, MDS 2012, pp. 3:1\u20133:8. ACM, New York (2012). https:\/\/doi.org\/10.1145\/2350190.2350193","DOI":"10.1145\/2350190.2350193"},{"key":"24_CR25","doi-asserted-by":"crossref","unstructured":"Zhang, M., Cui, Z., Jiang, S., Chen, Y.: Beyond link prediction: predicting hyperlinks in adjacency space. In: AAAI Conference on Artificial Intelligence (2018)","DOI":"10.1609\/aaai.v32i1.11780"},{"key":"24_CR26","doi-asserted-by":"crossref","unstructured":"Zhao, X., Wang, N., Shi, H., Wan, H., Huang, J., Gao, Y.: Hypergraph learning with cost interval optimization. In: AAAI Conference on Artificial Intelligence (2018)","DOI":"10.1609\/aaai.v32i1.11761"},{"key":"24_CR27","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, pp. 1601\u20131608 (2007)","DOI":"10.7551\/mitpress\/7503.003.0205"}],"container-title":["Studies in Computational Intelligence","Complex Networks and Their Applications VIII"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-36687-2_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,24]],"date-time":"2023-09-24T02:49:25Z","timestamp":1695523765000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-36687-2_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,26]]},"ISBN":["9783030366865","9783030366872"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-36687-2_24","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"value":"1860-949X","type":"print"},{"value":"1860-9503","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,11,26]]},"assertion":[{"value":"26 November 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COMPLEX NETWORKS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Complex Networks and Their Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lisbon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 December 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 December 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwcna2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.complexnetworks.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}