{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T13:14:08Z","timestamp":1775913248581,"version":"3.50.1"},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,8,20]],"date-time":"2020-08-20T00:00:00Z","timestamp":1597881600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2020,8,20]],"date-time":"2020-08-20T00:00:00Z","timestamp":1597881600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Netw Sci"],"published-print":{"date-parts":[[2020,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Learning on graphs is a subject of great interest due to the abundance of relational data from real-world systems. Many of these systems involve higher-order interactions (super-dyadic) rather than mere pairwise (dyadic) relationships; examples of these are co-authorship, co-citation, and metabolic reaction networks. Such super-dyadic relations are more adequately modeled using hypergraphs rather than graphs. Learning on hypergraphs has thus been garnering increased attention with potential applications in network analysis, VLSI design, and computer vision, among others. Especially, hypergraph clustering is gaining attention because of its enormous applications such as component placement in VLSI, group discovery in bibliographic systems, image segmentation in CV, etc. For the problem of clustering on graphs, modularity maximization has been known to work well in the pairwise setting. Our primary contribution in this article is to provide a generalization of the modularity maximization framework for clustering on hypergraphs. In doing so, we introduce a null model for graphs generated by hypergraph reduction and prove its equivalence to the configuration model for undirected graphs. The proposed graph reduction technique preserves the node degree sequence from the original hypergraph. The modularity function can be defined on a thus reduced graph, which can be maximized using any standard modularity maximization method, such as the Louvain method. We additionally propose an iterative technique that provides refinement over the obtained clusters. We demonstrate both the efficacy and efficiency of our methods on several real-world datasets.<\/jats:p>","DOI":"10.1007\/s41109-020-00300-3","type":"journal-article","created":{"date-parts":[[2020,8,20]],"date-time":"2020-08-20T11:02:45Z","timestamp":1597921365000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":48,"title":["Hypergraph clustering by iteratively reweighted modularity maximization"],"prefix":"10.1007","volume":"5","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6265-629X","authenticated-orcid":false,"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":[[2020,8,20]]},"reference":[{"key":"300_CR1","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1145\/1143844.1143847","volume-title":"ICML\u201906: Proceedings of the 23rd International Conference on Machine Learning","author":"S Agarwal","year":"2006","unstructured":"Agarwal, S, Branson K, Belongie S (2006) Higher order learning with graphs In: ICML\u201906: Proceedings of the 23rd International Conference on Machine Learning, 17\u201324.. Association for Computing Machinery, New York. https:\/\/doi.org\/10.1145\/1143844.1143847."},{"key":"300_CR2","doi-asserted-by":"publisher","first-page":"838","DOI":"10.1109\/CVPR.2005.89","volume-title":"2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR\u201905), vol. 2","author":"S Agarwal","year":"2005","unstructured":"Agarwal, S, Lim J, Zelnik-Manor L, Perona P, Kriegman D, Belongie S (2005) Beyond pairwise clustering In: 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR\u201905), vol. 2, 838\u20138452.. IEEE Computer Society, USA. https:\/\/doi.org\/10.1109\/CVPR.2005.89."},{"issue":"10","key":"300_CR3","doi-asserted-by":"crossref","first-page":"10008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","volume":"2008","author":"VD Blondel","year":"2008","unstructured":"Blondel, VD, Guillaume J-l, Lambiotte R, Lefebvre E (2008) Fast unfolding of communities in large networks. J Stat Mech Theory Exp 2008(10):10008. https:\/\/iopscience.iop.org\/article\/10.1088\/1742-5468\/2008\/10\/P10008\/meta.","journal-title":"J Stat Mech Theory Exp"},{"key":"300_CR4","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/j.laa.2014.10.039","volume":"473","author":"M Bolla","year":"2015","unstructured":"Bolla, M, Bullins B, Chaturapruek S, Chen S, Friedl K (2015) Spectral properties of modularity matrices. Linear Algebra Appl 473:359\u2013376.","journal-title":"Linear Algebra Appl"},{"key":"300_CR5","doi-asserted-by":"crossref","unstructured":"Bretto, A, et al. (2013) Hypergraph Theory: An Introduction. Springer Publishing Company, Incorporated. https:\/\/dl.acm.org\/doi\/book\/10.5555\/2500991.","DOI":"10.1007\/978-3-319-00080-0"},{"issue":"6","key":"300_CR6","doi-asserted-by":"crossref","first-page":"1312","DOI":"10.1109\/TPAMI.2012.226","volume":"35","author":"SR Bulo","year":"2013","unstructured":"Bulo, SR, Pelillo M (2013) A game-theoretic approach to hypergraph clustering. IEEE Trans Pattern Anal Mach Intell 35(6):1312\u20131327.","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"300_CR7","doi-asserted-by":"crossref","unstructured":"Chodrow, PS (2019) Configuration models of random hypergraphs and their applications. arXiv preprint arXiv:1902.09302.","DOI":"10.1093\/comnet\/cnaa018"},{"key":"300_CR8","doi-asserted-by":"crossref","unstructured":"Chodrow, P, Mellor A (2019) Annotated hypergraphs: Models and applications. arXiv preprint arXiv:1911.01331.","DOI":"10.1007\/s41109-020-0252-y"},{"issue":"2","key":"300_CR9","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/PL00012580","volume":"6","author":"F Chung","year":"2002","unstructured":"Chung, F, Lu L (2002) Connected components in random graphs with given expected degree sequences. Ann Comb 6(2):125\u2013145.","journal-title":"Ann Comb"},{"issue":"6","key":"300_CR10","doi-asserted-by":"crossref","first-page":"066111","DOI":"10.1103\/PhysRevE.70.066111","volume":"70","author":"A Clauset","year":"2004","unstructured":"Clauset, A, Newman ME, Moore C (2004) Finding community structure in very large networks. Phys Rev E 70(6):066111.","journal-title":"Phys Rev E"},{"issue":"6","key":"300_CR11","doi-asserted-by":"crossref","first-page":"062311","DOI":"10.1103\/PhysRevE.93.062311","volume":"93","author":"OT Courtney","year":"2016","unstructured":"Courtney, OT, Bianconi G (2016) Generalized network structures: The configuration model and the canonical ensemble of simplicial complexes. Phys Rev E 93(6):062311.","journal-title":"Phys Rev E"},{"key":"300_CR12","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1109\/ICDM.2002.1183896","volume-title":"2002 IEEE International Conference on Data Mining, 2002. Proceedings","author":"C Ding","year":"2002","unstructured":"Ding, C, He X (2002) Cluster merging and splitting in hierarchical clustering algorithms In: 2002 IEEE International Conference on Data Mining, 2002. Proceedings, 139\u2013146.. IEEE Computer Society, USA. https:\/\/dl.acm.org\/doi\/10.5555\/844380.844756."},{"key":"300_CR13","unstructured":"Estrada, E, Rodriguez-Velazquez JA (2005) Complex networks as hypergraphs. arXiv preprint physics\/0505137."},{"key":"300_CR14","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1016\/j.laa.2015.06.013","volume":"502","author":"D Fasino","year":"2016","unstructured":"Fasino, D, Tudisco F (2016) Generalized modularity matrices. Linear Algebra Appl 502:327\u2013345.","journal-title":"Linear Algebra Appl"},{"key":"300_CR15","first-page":"1523","volume-title":"Proceedings of the 2018 World Wide Web Conference. WWW \u201918","author":"F Feng","year":"2018","unstructured":"Feng, F, He X, Liu Y, Nie L, Chua T-S (2018) Learning on partial-order hypergraphs In: Proceedings of the 2018 World Wide Web Conference. WWW \u201918, 1523\u20131532.. International World Wide Web Conferences Steering Committee, Republic and Canton of Geneva, Switzerland."},{"issue":"1","key":"300_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10827-016-0608-6","volume":"41","author":"C Giusti","year":"2016","unstructured":"Giusti, C, Ghrist R, Bassett DS (2016) Two\u2019s company, three (or more) is a simplex. J Comput Neurosci 41(1):1\u201314.","journal-title":"J Comput Neurosci"},{"key":"300_CR17","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1145\/2365934.2365941","volume-title":"Proceedings of the 4th ACM RecSys Workshop on Recommender Systems and the Social Web. RSWeb \u201912","author":"D Greene","year":"2012","unstructured":"Greene, D, Sheridan G, Smyth B, Cunningham P (2012) 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 \u201912, 29\u201336.. ACM, New York."},{"issue":"7","key":"300_CR18","doi-asserted-by":"crossref","first-page":"885","DOI":"10.1109\/43.144852","volume":"11","author":"SW Hadley","year":"1992","unstructured":"Hadley, SW, Mark BL, Vannelli A (1992) An efficient eigenvector approach for finding netlist partitions. IEEE Trans Comput Aided Des Integr Circ Syst 11(7):885\u2013892.","journal-title":"IEEE Trans Comput Aided Des Integr Circ Syst"},{"issue":"11","key":"300_CR19","doi-asserted-by":"crossref","first-page":"e0224307","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 (2019) Clustering via hypergraph modularity. PLoS ONE 14(11):e0224307. https:\/\/journals.plos.org\/plosone\/article?id=10.1371\/journal.pone.0224307.","journal-title":"PLoS ONE"},{"issue":"1","key":"300_CR20","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1137\/S1064827595287997","volume":"20","author":"G Karypis","year":"1998","unstructured":"Karypis, G, Kumar V (1998) A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J Sci Comput 20(1):359\u2013392.","journal-title":"SIAM J Sci Comput"},{"key":"300_CR21","first-page":"1530","volume-title":"Advances in Neural Information Processing Systems","author":"S Kim","year":"2011","unstructured":"Kim, S, Nowozin S, Kohli P, Yoo CD (2011) Higher-order correlation clustering for image segmentation In: Advances in Neural Information Processing Systems, 1530\u20131538.. Curran Associates Inc., Red Hook."},{"issue":"5","key":"300_CR22","doi-asserted-by":"crossref","first-page":"e1000385","DOI":"10.1371\/journal.pcbi.1000385","volume":"5","author":"S Klamt","year":"2009","unstructured":"Klamt, S, Haus U-U, Theis F (2009) Hypergraphs and cellular networks. PLoS Comput Biol 5(5):e1000385. https:\/\/journals.plos.org\/ploscompbiol\/article?id=10.1371\/journal.pcbi.1000385.","journal-title":"PLoS Comput Biol"},{"key":"300_CR23","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1145\/3394231.3397903","volume-title":"12th ACM Conference on Web Science","author":"T Kumar","year":"2020","unstructured":"Kumar, T, Darwin K, Parthasarathy S, Ravindran B (2020) HPRA: Hyperedge prediction using resource allocation In: 12th ACM Conference on Web Science, 135\u2013143.. Association for Computing Machinery, New York. https:\/\/doi.org\/10.1145\/3394231.3397903."},{"key":"300_CR24","first-page":"286","volume-title":"International Conference on Complex Networks and Their Applications","author":"T Kumar","year":"2019","unstructured":"Kumar, T, Vaidyanathan S, Ananthapadmanabhan H, Parthasarathy S, Ravindran B (2019) A new measure of modularity in hypergraphs: Theoretical insights and implications for effective clustering In: International Conference on Complex Networks and Their Applications, 286\u2013297.. Springer International Publishing, Cham. https:\/\/link.springer.com\/chapter\/10.1007\/978-3-030-36687-2_24."},{"key":"300_CR25","first-page":"676","volume-title":"Proceedings of the Fifteenth International Conference on Artificial Intelligence and Statistics. Proceedings of Machine Learning Research, vol. 22","author":"M Leordeanu","year":"2012","unstructured":"Leordeanu, M, Sminchisescu C (2012) Efficient hypergraph clustering. In: Lawrence ND Girolami M (eds)Proceedings of the Fifteenth International Conference on Artificial Intelligence and Statistics. Proceedings of Machine Learning Research, vol. 22, 676\u2013684.. PMLR, La Palma."},{"key":"300_CR26","unstructured":"Liu, H, Latecki LJ, Yan S (2010) Robust clustering as ensembles of affinity relations In: Advances in Neural Information Processing Systems."},{"issue":"3","key":"300_CR27","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1023\/A:1019269409432","volume":"10","author":"D-R Liu","year":"2001","unstructured":"Liu, D-R, Wu M-Y (2001) A hypergraph based approach to declustering problems. Distrib Parallel Databases 10(3):269\u2013288.","journal-title":"Distrib Parallel Databases"},{"key":"300_CR28","doi-asserted-by":"crossref","first-page":"713","DOI":"10.1145\/2746539.2746555","volume-title":"Proceedings of the Forty-seventh Annual ACM Symposium on Theory of Computing. STOC \u201915","author":"A Louis","year":"2015","unstructured":"Louis, A (2015) Hypergraph markov operators, eigenvalues and approximation algorithms In: Proceedings of the Forty-seventh Annual ACM Symposium on Theory of Computing. STOC \u201915, 713\u2013722.. ACM, New York."},{"issue":"3","key":"300_CR29","doi-asserted-by":"crossref","first-page":"1361","DOI":"10.1007\/s11192-018-2908-2","volume":"117","author":"RI Lung","year":"2018","unstructured":"Lung, RI, Gask\u00f3 N, Suciu MA (2018) A hypergraph model for representing scientific output. Scientometrics 117(3):1361\u20131379.","journal-title":"Scientometrics"},{"key":"300_CR30","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511809071","volume-title":"Introduction to information retrieval","author":"CD Manning","year":"2008","unstructured":"Manning, CD, Sch\u00fctze H, Raghavan P (2008) Introduction to information retrieval. Cambridge University Press, USA."},{"issue":"23","key":"300_CR31","doi-asserted-by":"crossref","first-page":"8577","DOI":"10.1073\/pnas.0601602103","volume":"103","author":"ME Newman","year":"2006","unstructured":"Newman, ME (2006) Modularity and community structure in networks. Proc Natl Acad Sci 103(23):8577\u20138582.","journal-title":"Proc Natl Acad Sci"},{"key":"300_CR32","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780199206650.001.0001","volume-title":"Networks: An Introduction","author":"ME Newman","year":"2010","unstructured":"Newman, ME (2010) Networks: An Introduction. Oxford University Press, Inc., New York."},{"key":"300_CR33","first-page":"849","volume-title":"Advances in Neural Information Processing Systems","author":"AY Ng","year":"2002","unstructured":"Ng, AY, Jordan MI, Weiss Y (2002) On spectral clustering: Analysis and an algorithm In: Advances in Neural Information Processing Systems, 849\u2013856.. MIT Press, Cambridge."},{"issue":"336","key":"300_CR34","doi-asserted-by":"crossref","first-page":"846","DOI":"10.1080\/01621459.1971.10482356","volume":"66","author":"WM Rand","year":"1971","unstructured":"Rand, WM (1971) Objective criteria for the evaluation of clustering methods. J Am Stat Assoc 66(336):846\u2013850.","journal-title":"J Am Stat Assoc"},{"key":"300_CR35","unstructured":"Saito, S, Mandic D, Suzuki H (2018) Hypergraph p-laplacian: A differential geometry view In: AAAI Conference on Artificial Intelligence.. AAAI Press. http:\/\/dblp.unitrier.de\/db\/conf\/aaai\/aaai2018.html#SaitoMS18."},{"key":"300_CR36","volume-title":"Twenty-Fourth International Joint Conference on Artificial Intelligence","author":"V Sankar","year":"2015","unstructured":"Sankar, V, Ravindran B, Shivashankar S (2015) Ceil: A scalable, resolution limit free approach for detecting communities in large networks In: Twenty-Fourth International Joint Conference on Artificial Intelligence.. AAAI Press, Buenos Aires. https:\/\/dl.acm.org\/doi\/10.5555\/2832415.2832540."},{"key":"300_CR37","volume-title":"Twenty-Fourth International Joint Conference on Artificial Intelligence","author":"SN Satchidanand","year":"2015","unstructured":"Satchidanand, SN, Ananthapadmanaban H, Ravindran B (2015) Extended discriminative random walk: a hypergraph approach to multi-view multi-relational transductive learning In: Twenty-Fourth International Joint Conference on Artificial Intelligence.. AAAI Press, Buenos Aires. https:\/\/dl.acm.org\/doi\/10.5555\/2832747.2832778."},{"key":"300_CR38","doi-asserted-by":"crossref","unstructured":"Satchidanand, SN, Jain SK, Maurya A, Ravindran B (2014) Studying indian railways network using hypergraphs In: 2014 Sixth International Conference on Communication Systems and Networks (COMSNETS), 1\u20136.. IEEE. http:\/\/dblp.unitrier.de\/db\/conf\/comsnets\/comsnets2014.html#SatchidanandJMR14.","DOI":"10.1109\/COMSNETS.2014.6734941"},{"key":"300_CR39","doi-asserted-by":"publisher","first-page":"737","DOI":"10.1145\/1557019.1557101","volume-title":"Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Paris, France, June 28 - July 1, 2009","author":"V Satuluri","year":"2009","unstructured":"Satuluri, V, Parthasarathy S (2009) Scalable graph clustering using stochastic flows: applications to community discovery In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Paris, France, June 28 - July 1, 2009, 737\u2013746.. Association for Computing Machinery, New York. https:\/\/doi.org\/10.1145\/1557019.1557101."},{"issue":"1","key":"300_CR40","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/j.cosrev.2007.05.001","volume":"1","author":"SE Schaeffer","year":"2007","unstructured":"Schaeffer, SE (2007) Graph clustering. Comput Sci Rev 1(1):27\u201364.","journal-title":"Comput Sci Rev"},{"issue":"3","key":"300_CR41","first-page":"93","volume":"29","author":"P Sen","year":"2008","unstructured":"Sen, P, Namata G, Bilgic M, Getoor L, Galligher B, Eliassi-Rad T (2008) Collective classification in network data. AI Mag 29(3):93.","journal-title":"AI Mag"},{"key":"300_CR42","first-page":"595","volume-title":"Proceedings of the 9th European Conference on Computer Vision - Volume Part IV. ECCV\u201906","author":"A Shashua","year":"2006","unstructured":"Shashua, A, Zass R, Hazan T (2006) Multi-way clustering using super-symmetric non-negative tensor factorization In: Proceedings of the 9th European Conference on Computer Vision - Volume Part IV. ECCV\u201906, 595\u2013608.. Springer, Berlin."},{"issue":"8","key":"300_CR43","doi-asserted-by":"crossref","first-page":"888","DOI":"10.1109\/34.868688","volume":"22","author":"J Shi","year":"2000","unstructured":"Shi, J, Malik J (2000) Normalized cuts and image segmentation. IEEE Trans Pattern Anal Mach Intell 22(8):888\u2013905.","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"300_CR44","doi-asserted-by":"crossref","first-page":"990","DOI":"10.1145\/1401890.1402008","volume-title":"Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. KDD \u201908","author":"J Tang","year":"2008","unstructured":"Tang, J, Zhang J, Yao L, Li J, Zhang L, Su Z (2008) Arnetminer: Extraction and mining of academic social networks In: Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. KDD \u201908, 990\u2013998.. Association for Computing Machinery, New York."},{"key":"300_CR45","unstructured":"Veldt, N, Benson AR, Kleinberg J (2020) Hypergraph cuts with general splitting functions. arXiv preprint arXiv:2001.02817."},{"key":"300_CR46","doi-asserted-by":"crossref","first-page":"889","DOI":"10.1145\/3132847.3132967","volume-title":"Proceedings of the 2017 ACM on Conference on Information and Knowledge Management. CIKM \u201917","author":"C Wang","year":"2017","unstructured":"Wang, C, Pan S, Long G, Zhu X, Jiang J (2017) Mgae: Marginalized graph autoencoder for graph clustering In: Proceedings of the 2017 ACM on Conference on Information and Knowledge Management. CIKM \u201917, 889\u2013898.. Association for Computing Machinery, New York."},{"key":"300_CR47","first-page":"3","volume-title":"Proceedings of the ACM SIGKDD Workshop on Mining Data Semantics. MDS \u201912","author":"J Yang","year":"2012","unstructured":"Yang, J, Leskovec J (2012) Defining and evaluating network communities based on ground-truth In: Proceedings of the ACM SIGKDD Workshop on Mining Data Semantics. MDS \u201912, 3\u2013138.. ACM, New York."},{"key":"300_CR48","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1145\/2433396.2433471","volume-title":"Proceedings of the Sixth ACM International Conference on Web Search and Data Mining","author":"J Yang","year":"2013","unstructured":"Yang, J, Leskovec J (2013) Overlapping community detection at scale: a nonnegative matrix factorization approach In: Proceedings of the Sixth ACM International Conference on Web Search and Data Mining, 587\u2013596.. Association for Computing Machinery, New York. https:\/\/doi.org\/10.1145\/2433396.2433471."},{"issue":"3","key":"300_CR49","doi-asserted-by":"crossref","first-page":"032312","DOI":"10.1103\/PhysRevE.96.032312","volume":"96","author":"J-G Young","year":"2017","unstructured":"Young, J-G, Petri G, Vaccarino F, Patania A (2017) Construction of and efficient sampling from the simplicial configuration model. Phys Rev E 96(3):032312.","journal-title":"Phys Rev E"},{"key":"300_CR50","unstructured":"Zhang, M, Cui Z, Jiang S, Chen Y (2018) Beyond link prediction: Predicting hyperlinks in adjacency space In: AAAI Conference on Artificial Intelligence.. AAAI Press. http:\/\/dblp.unitrier.de\/db\/conf\/aaai\/aaai2018.html#ZhangCJC18."},{"key":"300_CR51","doi-asserted-by":"crossref","unstructured":"Zhao, X, Wang N, Shi H, Wan H, Huang J, Gao Y (2018) Hypergraph learning with cost interval optimization In: AAAI Conference on Artificial Intelligence.","DOI":"10.1609\/aaai.v32i1.11761"},{"key":"300_CR52","first-page":"1601","volume-title":"Advances in Neural Information Processing Systems","author":"D Zhou","year":"2007","unstructured":"Zhou, D, Huang J, Sch\u00f6lkopf B (2007) Learning with hypergraphs: Clustering, classification, and embedding In: Advances in Neural Information Processing Systems, 1601\u20131608.. MIT Press, Cambridge."}],"container-title":["Applied Network Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41109-020-00300-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s41109-020-00300-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41109-020-00300-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,6]],"date-time":"2023-10-06T02:38:25Z","timestamp":1696559905000},"score":1,"resource":{"primary":{"URL":"https:\/\/appliednetsci.springeropen.com\/articles\/10.1007\/s41109-020-00300-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8,20]]},"references-count":52,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,12]]}},"alternative-id":["300"],"URL":"https:\/\/doi.org\/10.1007\/s41109-020-00300-3","relation":{},"ISSN":["2364-8228"],"issn-type":[{"value":"2364-8228","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,8,20]]},"assertion":[{"value":"17 March 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 August 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 August 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare that they have no competing interests.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"52"}}