{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,24]],"date-time":"2026-09-24T20:31:22Z","timestamp":1790281882643,"version":"4.1.0"},"reference-count":128,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2024,7,24]],"date-time":"2024-07-24T00:00:00Z","timestamp":1721779200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGKDD Explor. Newsl."],"published-print":{"date-parts":[[2024,7,24]]},"abstract":"<jats:p>Network data has become widespread, larger, and more complex over the years. Traditional network data is dyadic, capturing the relations among pairs of entities. With the need to model interactions among more than two entities, significant research has focused on higher-order networks and ways to represent, analyze, and learn from them. There are two main directions to studying higher-order networks. One direction has focused on capturing higher-order patterns in traditional (dyadic) graphs by changing the basic unit of study from nodes to small frequently observed subgraphs, called motifs. As most existing network data comes in the form of pairwise dyadic relationships, studying higher-order structures within such graphs may uncover new insights. The second direction aims to directly model higher-order interactions using new and more complex representations such as simplicial complexes or hypergraphs. Some of these models have long been proposed, but improvements in computational power and the advent of new computational techniques have increased their popularity. Our goal in this paper is to provide a succinct yet comprehensive summary of the advanced higher-order network analysis techniques. We provide a systematic review of the foundations and algorithms, along with use cases and applications of higher-order networks in various scientific domains.<\/jats:p>","DOI":"10.1145\/3682112.3682114","type":"journal-article","created":{"date-parts":[[2024,7,25]],"date-time":"2024-07-25T10:27:01Z","timestamp":1721903221000},"page":"1-18","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":17,"title":["Higher-Order Networks Representation and Learning: A Survey"],"prefix":"10.1145","volume":"26","author":[{"given":"Hao","family":"Tian","sequence":"first","affiliation":[{"name":"Syracuse University, Syracuse, NY, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Reza","family":"Zafarani","sequence":"additional","affiliation":[{"name":"Syracuse University, Syracuse, NY, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2024,7,25]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Link prediction via higher-order motif features. CoRR, abs\/1902.06679","author":"AbuOda G.","year":"2019","unstructured":"G. AbuOda, G. D. F. Morales, and A. Aboulnaga. Link prediction via higher-order motif features. CoRR, abs\/1902.06679, 2019."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2015.141"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1140\/epjds\/s13688-020-00231-0"},{"key":"e_1_2_1_4_1","volume-title":"Clustering in Graphs and Hypergraphs with Categorical Edge Labels, page 706--717","author":"Amburg I.","year":"2020","unstructured":"I. Amburg, N. Veldt, and A. Benson. Clustering in Graphs and Hypergraphs with Categorical Edge Labels, page 706--717. Association for Computing Machinery, New York, NY, USA, 2020."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687713"},{"key":"e_1_2_1_6_1","volume-title":"Topological analysis of gene expression arrays identifies high risk molecular subtypes in breast cancer. Appl. Algebra Eng. Commun. Comput., 23(1--2):3--15","author":"Arsuaga J.","year":"2012","unstructured":"J. Arsuaga, N. A. Baas, D. DeWoskin, H. Mizuno, A. Pankov, and C. Park. Topological analysis of gene expression arrays identifies high risk molecular subtypes in breast cancer. Appl. Algebra Eng. Commun. Comput., 23(1--2):3--15, 2012."},{"key":"e_1_2_1_7_1","volume-title":"Hypergraph convolution and hypergraph attention. CoRR, abs\/1901.08150","author":"Bai S.","year":"2019","unstructured":"S. Bai, F. Zhang, and P. H. S. Torr. Hypergraph convolution and hypergraph attention. CoRR, abs\/1901.08150, 2019."},{"key":"e_1_2_1_8_1","volume-title":"Network science","author":"Barab\u00b4asi A.-L.","year":"2016","unstructured":"A.-L. Barab\u00b4asi and M. P\u00b4osfai. Network science. Cambridge University Press, Cambridge, 2016."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s41468-021-00071-5"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1121\/1.1906679"},{"key":"e_1_2_1_11_1","volume-title":"Three hypergraph eigenvector centralities. CoRR, abs\/1807.09644","author":"Benson A. R.","year":"2018","unstructured":"A. R. Benson. Three hypergraph eigenvector centralities. CoRR, abs\/1807.09644, 2018."},{"key":"e_1_2_1_12_1","volume-title":"Simplicial closure and higherorder link prediction. CoRR, abs\/1802.06916","author":"Benson A. R.","year":"2018","unstructured":"A. R. Benson, R. Abebe, M. T. Schaub, A. Jadbabaie, and J. M. Kleinberg. Simplicial closure and higherorder link prediction. CoRR, abs\/1802.06916, 2018."},{"key":"e_1_2_1_13_1","volume-title":"Higherorder network analysis takes o?, fueled by classical ideas and new data. CoRR, abs\/2103.05031","author":"Benson A. R.","year":"2021","unstructured":"A. R. Benson, D. F. Gleich, and D. J. Higham. Higherorder network analysis takes o?, fueled by classical ideas and new data. CoRR, abs\/2103.05031, 2021."},{"key":"e_1_2_1_14_1","volume-title":"Tensor spectral clustering for partitioning higher-order network structures. CoRR, abs\/1502.05058","author":"Benson A. R.","year":"2015","unstructured":"A. R. Benson, D. F. Gleich, and J. Leskovec. Tensor spectral clustering for partitioning higher-order network structures. CoRR, abs\/1502.05058, 2015."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.aad9029"},{"key":"e_1_2_1_16_1","volume-title":"Emergent hyperbolic network geometry. Scientific Reports, 7(1), feb","author":"Bianconi G.","year":"2017","unstructured":"G. Bianconi and C. Rahmede. Emergent hyperbolic network geometry. Scientific Reports, 7(1), feb 2017."},{"key":"e_1_2_1_17_1","volume-title":"What are higher-order networks? CoRR, abs\/2104.11329","author":"Bick C.","year":"2021","unstructured":"C. Bick, E. Gross, H. A. Harrington, and M. T. Schaub. What are higher-order networks? CoRR, abs\/2104.11329, 2021."},{"key":"e_1_2_1_18_1","volume-title":"Fast unfolding of communities in large networks. Journal of statistical mechanics: theory and experiment","author":"Blondel V. D.","year":"2008","unstructured":"V. D. Blondel, J.-L. Guillaume, R. Lambiotte, and E. Lefebvre. Fast unfolding of communities in large networks. Journal of statistical mechanics: theory and experiment, 2008(10):P10008, 2008."},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2005.10.009"},{"key":"e_1_2_1_20_1","volume-title":"Handbook of Graph Drawing and Visualization","author":"Brandes U.","year":"2013","unstructured":"U. Brandes, M. Eiglsperger, J. Lerner, and C. Pich. Graph markup language (graphml). In Handbook of Graph Drawing and Visualization, 2013."},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5334\/jors.182"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02310791"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2719026"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1093\/comnet\/cnaa018"},{"key":"e_1_2_1_25_1","volume-title":"Generative hypergraph clustering: From blockmodels to modularity. Science Advances, 7(28):eabh1303","author":"Chodrow P. S.","year":"2021","unstructured":"P. S. Chodrow, N. Veldt, and A. R. Benson. Generative hypergraph clustering: From blockmodels to modularity. Science Advances, 7(28):eabh1303, 2021."},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.252631999"},{"key":"e_1_2_1_27_1","volume-title":"Generalized network structures: The configuration model and the canonical ensemble of simplicial complexes. Physical Review E, 93(6), jun","author":"Courtney O. T.","year":"2016","unstructured":"O. T. Courtney and G. Bianconi. Generalized network structures: The configuration model and the canonical ensemble of simplicial complexes. Physical Review E, 93(6), jun 2016."},{"key":"e_1_2_1_28_1","unstructured":"V. De Silva and R. Ghrist. Coverage in sensor networks via persistent homology."},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.topol.2009.04.036"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403060"},{"key":"e_1_2_1_31_1","volume-title":"Brain network motifs are markers of loss and recovery of consciousness. bioRxiv","author":"Duclos C.","year":"2020","unstructured":"C. Duclos, D. Nadin, Y. Mahdid, V. Tarnal, P. Picton, G. Vanini, G. Golmirzaie, E. Janke, M. S. Avidan, M. B. Kelz, G. A. Mashour, and S. Blain-Moraes. Brain network motifs are markers of loss and recovery of consciousness. bioRxiv, 2020."},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.5486\/PMD.1959.6.3-4.12"},{"key":"e_1_2_1_33_1","volume-title":"Towards random uniform sampling of bipartite graphs with given degree sequence","author":"Erd\u00a8os P. L.","year":"2010","unstructured":"P. L. Erd\u00a8os, I. Mikl\u00b4os, and L. Soukup. Towards random uniform sampling of bipartite graphs with given degree sequence. 2010."},{"key":"e_1_2_1_34_1","volume-title":"Hypergraph neural networks","author":"Feng Y.","year":"2018","unstructured":"Y. Feng, H. You, Z. Zhang, R. Ji, and Y. Gao. Hypergraph neural networks, 2018."},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3274895.3274952"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.5555\/1147685.1147729"},{"key":"e_1_2_1_37_1","volume-title":"Two's company, three (or more) is a simplex: Algebraictopological tools for understanding higher-order structure in neural data","author":"Giusti C.","year":"2016","unstructured":"C. Giusti, R. Ghrist, and D. S. Bassett. Two's company, three (or more) is a simplex: Algebraictopological tools for understanding higher-order structure in neural data, 2016."},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1506407112"},{"key":"e_1_2_1_39_1","volume-title":"Pagerank beyond the web. CoRR, abs\/1407.5107","author":"Gleich D. F.","year":"2014","unstructured":"D. F. Gleich. Pagerank beyond the web. CoRR, abs\/1407.5107, 2014."},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-023-27565-9"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1086\/225469"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.5555\/1758222.1758229"},{"key":"e_1_2_1_43_1","volume-title":"Simplicial complex representation learning. CoRR, abs\/2103.04046","author":"Hajij M.","year":"2021","unstructured":"M. Hajij, G. Zamzmi, and X. Cai. Simplicial complex representation learning. CoRR, abs\/2103.04046, 2021."},{"key":"e_1_2_1_44_1","volume-title":"Topological deep learning: Going beyond graph data","author":"Hajij M.","year":"2023","unstructured":"M. Hajij, G. Zamzmi, T. Papamarkou, N. Miolane, A. Guzm\u00b4an-S\u00b4aenz, K. N. Ramamurthy, T. Birdal, T. K. Dey, S. Mukherjee, S. N. Samaga, N. Livesay, R. Walters, P. Rosen, and M. T. Schaub. Topological deep learning: Going beyond graph data, 2023."},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2014.03.030"},{"key":"e_1_2_1_46_1","volume-title":"Models and conditions for an \"explanatory\" multi-model factor analysis","author":"Harshman R. A.","year":"1970","unstructured":"R. A. Harshman. Foundations of the parafac procedure: Models and conditions for an \"explanatory\" multi-model factor analysis. 1970."},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1155\/2014\/352327"},{"key":"e_1_2_1_48_1","volume-title":"Jun","author":"Iacopini I.","year":"2019","unstructured":"I. Iacopini, G. Petri, A. Barrat, and V. Latora. Simplicial models of social contagion. Nature Communications, 10(1), Jun 2019."},{"key":"e_1_2_1_49_1","volume-title":"Hypernetwork science: From multidimensional networks to computational topology. CoRR, abs\/2003.11782","author":"Joslyn C. A.","year":"2020","unstructured":"C. A. Joslyn, S. Aksoy, T. J. Callahan, L. E. Hunter, B. A. Jefferson, B. Praggastis, E. A. H. Purvine, and I. J. Tripodi. Hypernetwork science: From multidimensional networks to computational topology. CoRR, abs\/2003.11782, 2020."},{"key":"e_1_2_1_50_1","volume-title":"Topology of random simplicial complexes: a survey","author":"Kahle M.","year":"2013","unstructured":"M. Kahle. Topology of random simplicial complexes: a survey, 2013."},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.83.016107"},{"key":"e_1_2_1_52_1","first-page":"10","article-title":"Kavosh : a new algorithm for finding network motifs","author":"Kashani Z. R. M.","year":"2009","unstructured":"Z. R. M. Kashani, H. Ahrabian, E. Elahi, A. Nowzari- Dalini, E. Ansari, S. Asadi, S. Mohammadi, F. Schreiber, and A. Masoudi-Nejad. Kavosh : a new algorithm for finding network motifs. BMC Bioinformatics, 10, 2009. Article Number: 318.","journal-title":"BMC Bioinformatics"},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0503610102"},{"key":"e_1_2_1_54_1","first-page":"1746","article-title":"Efficient sampling algorithm for estimating subgraph concentrations and detecting network motifs. Bioinformatics (Oxford","volume":"20","author":"Kashtan N.","year":"2004","unstructured":"N. Kashtan, S. Itzkovitz, R. Milo, and U. Alon. Efficient sampling algorithm for estimating subgraph concentrations and detecting network motifs. Bioinformatics (Oxford, England), 20:1746--58, 08 2004.","journal-title":"England)"},{"key":"e_1_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-023-00952-6"},{"key":"e_1_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1093\/comnet\/cnu016"},{"issue":"26","key":"e_1_2_1_57_1","first-page":"1","article-title":"Tensorly: Tensor learning in python","volume":"20","author":"Kossaifi J.","year":"2019","unstructured":"J. Kossaifi, Y. Panagakis, A. Anandkumar, and M. Pantic. Tensorly: Tensor learning in python. Journal of Machine Learning Research, 20(26):1--6, 2019.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_2_1_58_1","volume-title":"Understanding complex systems: From networks to optimal higher-order models","author":"Lambiotte R.","year":"2018","unstructured":"R. Lambiotte, M. Rosvall, and I. Scholtes. Understanding complex systems: From networks to optimal higher-order models, 2018."},{"key":"e_1_2_1_59_1","volume-title":"A survey on hypergraph mining: Patterns, tools, and generators","author":"Lee G.","year":"2024","unstructured":"G. Lee, F. Bu, T. Eliassi-Rad, and K. Shin. A survey on hypergraph mining: Patterns, tools, and generators, 2024."},{"key":"e_1_2_1_60_1","volume-title":"How do hyperedges overlap in real-world hypergraphs? - patterns, measures, and generators. CoRR, abs\/2101.07480","author":"Lee G.","year":"2021","unstructured":"G. Lee, M. Choe, and K. Shin. How do hyperedges overlap in real-world hypergraphs? - patterns, measures, and generators. CoRR, abs\/2101.07480, 2021."},{"key":"e_1_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.14778\/3407790.3407823"},{"key":"e_1_2_1_62_1","volume-title":"The structure of positive interpersonal relations in small groups. Sociological Theories in Progress","author":"Leinhardt S.","year":"1971","unstructured":"S. Leinhardt and J. Berger. The structure of positive interpersonal relations in small groups. Sociological Theories in Progress. Boston: Houghton Mi?in, 1971."},{"key":"e_1_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1145\/1753326.1753532"},{"key":"e_1_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.18637\/jss.v087.i10"},{"key":"e_1_2_1_65_1","first-page":"684","volume-title":"Multi-Layered Network Embedding","author":"Li J.","unstructured":"J. Li, C. Chen, H. Tong, and H. Liu. Multi-Layered Network Embedding, pages 684--692."},{"key":"e_1_2_1_66_1","volume-title":"Hodge laplacians on graphs. CoRR, abs\/1507.05379","author":"Lim L.","year":"2015","unstructured":"L. Lim. Hodge laplacians on graphs. CoRR, abs\/1507.05379, 2015."},{"key":"e_1_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449887"},{"key":"e_1_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2010.07.014"},{"key":"e_1_2_1_69_1","volume-title":"Apr.","author":"Lotito Q. F.","year":"2022","unstructured":"Q. F. Lotito, F. Musciotto, A. Montresor, and F. Battiston. Higher-order motif analysis in hypergraphs. Communications Physics, 5(1), Apr. 2022."},{"key":"e_1_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-21286-4_2"},{"key":"e_1_2_1_71_1","volume-title":"A survey of shortest-path algorithms. CoRR, abs\/1705.02044","author":"Madkour A.","year":"2017","unstructured":"A. Madkour, W. G. Aref, F. U. Rehman, M. A. Rahman, and S. M. Basalamah. A survey of shortest-path algorithms. CoRR, abs\/1705.02044, 2017."},{"key":"e_1_2_1_72_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2011.08.019"},{"key":"e_1_2_1_73_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2017.07.007"},{"key":"e_1_2_1_74_1","volume-title":"Explosive higher-order kuramoto dynamics on simplicial complexes. Physical Review Letters, 124(21), may","author":"A. P.","year":"2020","unstructured":"A. P. Mill\u00b4a n, J. J. Torres, and G. Bianconi. Explosive higher-order kuramoto dynamics on simplicial complexes. Physical Review Letters, 124(21), may 2020."},{"key":"e_1_2_1_75_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.1089167"},{"key":"e_1_2_1_76_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.298.5594.824"},{"key":"e_1_2_1_77_1","doi-asserted-by":"publisher","DOI":"10.1145\/1998196.1998229"},{"key":"e_1_2_1_78_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-013-9529-6"},{"key":"e_1_2_1_79_1","first-page":"1024","volume-title":"Proc. of 17th International Symposium on Mathematical Theory of Networks and Systems","author":"Muhammad A.","year":"2006","unstructured":"A. Muhammad and M. Egerstedt. Control using higher order laplacians in network topologies. In Proc. of 17th International Symposium on Mathematical Theory of Networks and Systems, Kyoto, pages 1024-- 1038, 2006."},{"key":"e_1_2_1_80_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.101.062313"},{"key":"e_1_2_1_81_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40193-0_6"},{"key":"e_1_2_1_82_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btm033"},{"key":"e_1_2_1_83_1","volume-title":"Moda: An efficient algorithm for network motif discovery in biological networks. Genes & genetic systems, 84:385--95, 10","author":"Omidi S.","year":"2009","unstructured":"S. Omidi and F. Schreiber. Moda: An efficient algorithm for network motif discovery in biological networks. Genes & genetic systems, 84:385--95, 10 2009."},{"key":"e_1_2_1_84_1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2018.2820126"},{"key":"e_1_2_1_85_1","volume-title":"Towards spectral sparsification of simplicial complexes based on generalized effective resistance. CoRR, abs\/1708.08436","author":"Osting B.","year":"2017","unstructured":"B. Osting, S. Palande, and B. Wang. Towards spectral sparsification of simplicial complexes based on generalized effective resistance. CoRR, abs\/1708.08436, 2017."},{"key":"e_1_2_1_87_1","volume-title":"Motifs in temporal networks. CoRR, abs\/1612.09259","author":"Paranjape A.","year":"2016","unstructured":"A. Paranjape, A. R. Benson, and J. Leskovec. Motifs in temporal networks. CoRR, abs\/1612.09259, 2016."},{"key":"e_1_2_1_88_1","doi-asserted-by":"publisher","DOI":"10.7717\/peerj.6917"},{"key":"e_1_2_1_89_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btt224"},{"key":"e_1_2_1_90_1","doi-asserted-by":"publisher","DOI":"10.1098\/rsif.2014.0873"},{"key":"e_1_2_1_91_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bth436"},{"key":"e_1_2_1_92_1","doi-asserted-by":"publisher","DOI":"10.1145\/1774088.1774422"},{"key":"e_1_2_1_93_1","volume-title":"Community discovery in dynamic networks: A survey. ACM Comput. Surv., 51(2), feb","author":"Rossetti G.","year":"2018","unstructured":"G. Rossetti and R. Cazabet. Community discovery in dynamic networks: A survey. ACM Comput. Surv., 51(2), feb 2018."},{"key":"e_1_2_1_94_1","volume-title":"Hone: Higher-order network embeddings","author":"Rossi R. A.","year":"2018","unstructured":"R. A. Rossi, N. K. Ahmed, E. Koh, S. Kim, A. Rao, and Y. A. Yadkori. Hone: Higher-order network embeddings, 2018."},{"key":"e_1_2_1_95_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2014.2329213"},{"key":"e_1_2_1_96_1","volume-title":"Discrete signal processing on graphs. CoRR, abs\/1210.4752","author":"Sandryhaila A.","year":"2012","unstructured":"A. Sandryhaila and J. M. F. Moura. Discrete signal processing on graphs. CoRR, abs\/1210.4752, 2012."},{"key":"e_1_2_1_97_1","volume-title":"Random walks on simplicial complexes and the normalized hodge laplacian. CoRR, abs\/1807.05044","author":"Schaub M. T.","year":"2018","unstructured":"M. T. Schaub, A. R. Benson, P. Horn, G. Lippner, and A. Jadbabaie. Random walks on simplicial complexes and the normalized hodge laplacian. CoRR, abs\/1807.05044, 2018."},{"key":"e_1_2_1_98_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2021.108149"},{"key":"e_1_2_1_99_1","unstructured":"S. Schlag. High-Quality Hypergraph Partitioning. PhD thesis Karlsruhe Institute of Technology Germany 2020."},{"key":"e_1_2_1_100_1","doi-asserted-by":"publisher","DOI":"10.5555\/2137821.2137828"},{"key":"e_1_2_1_101_1","volume-title":"Network embedding via motifs. ACM Trans. Knowl. Discov. Data, 16(3), oct","author":"Shao P.","year":"2021","unstructured":"P. Shao, Y. Yang, S. Xu, and C. Wang. Network embedding via motifs. ACM Trans. Knowl. Discov. Data, 16(3), oct 2021."},{"key":"e_1_2_1_102_1","doi-asserted-by":"publisher","DOI":"10.1038\/ng881"},{"key":"e_1_2_1_103_1","volume-title":"Signal processing on graphs: Extending high-dimensional data analysis to networks and other irregular data domains. CoRR, abs\/1211.0053","author":"Shuman D. I.","year":"2012","unstructured":"D. I. Shuman, S. K. Narang, P. Frossard, A. Ortega, and P. Vandergheynst. Signal processing on graphs: Extending high-dimensional data analysis to networks and other irregular data domains. CoRR, abs\/1211.0053, 2012."},{"key":"e_1_2_1_104_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2017.2690524"},{"key":"e_1_2_1_105_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10827-017-0672-6"},{"key":"e_1_2_1_106_1","volume-title":"Analyzing, exploring, and visualizing complex networks via hypergraphs using SimpleHypergraphs.jl. Internet Mathematics, apr","author":"Spagnuolo C.","year":"2020","unstructured":"C. Spagnuolo, G. Cordasco, P. Szufel, P. Pralat, V. Scarano, B. Kaminski, and A. Antelmi. Analyzing, exploring, and visualizing complex networks via hypergraphs using SimpleHypergraphs.jl. Internet Mathematics, apr 2020."},{"key":"e_1_2_1_107_1","doi-asserted-by":"crossref","unstructured":"E. H. Spanier. Algebraic topology. McGraw-Hill Book New York 1966. Includes index.","DOI":"10.1007\/978-1-4684-9322-1_5"},{"key":"e_1_2_1_108_1","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pbio.0020369"},{"key":"e_1_2_1_109_1","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2010.2047541"},{"key":"e_1_2_1_110_1","volume-title":"Using rich social media information for music recommendation via hypergraph model. ACM Trans. Multimedia Comput. Commun. Appl., 7S(1), nov","author":"Tan S.","year":"2011","unstructured":"S. Tan, J. Bu, C. Chen, B. Xu, C. Wang, and X. He. Using rich social media information for music recommendation via hypergraph model. ACM Trans. Multimedia Comput. Commun. Appl., 7S(1), nov 2011."},{"key":"e_1_2_1_111_1","volume-title":"Proceedings of ICMS 2014","author":"Tausz A.","year":"2014","unstructured":"A. Tausz, M. Vejdemo-Johansson, and H. Adams. JavaPlex: A research software package for persistent (co)homology. In H. Hong and C. Yap, editors, Proceedings of ICMS 2014, Lecture Notes in Computer Science 8592, pages 129--136, 2014. Software available at http:\/\/appliedtopology.github.io\/javaplex\/."},{"key":"e_1_2_1_112_1","volume-title":"Graph neural networks designed for di?erent graph types: A survey, 04","author":"Thomas J.","year":"2022","unstructured":"J. Thomas, A. Moallemy-Oureh, S. Beddar-Wiesing, and C. Holzh\u00a8uter. Graph neural networks designed for di?erent graph types: A survey, 04 2022."},{"key":"e_1_2_1_113_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDMW58026.2022.00156"},{"key":"e_1_2_1_114_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02289464"},{"key":"e_1_2_1_115_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488388.2488502"},{"key":"e_1_2_1_116_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICMLA.2019.00299"},{"key":"e_1_2_1_117_1","volume-title":"Minimizing Localized Ratio Cut Objectives in Hypergraphs, page 1708--1718","author":"Veldt N.","year":"2020","unstructured":"N. Veldt, A. R. Benson, and J. Kleinberg. Minimizing Localized Ratio Cut Objectives in Hypergraphs, page 1708--1718. Association for Computing Machinery, New York, NY, USA, 2020."},{"key":"e_1_2_1_118_1","volume-title":"Hypergraph cuts with general splitting functions. CoRR, abs\/2001.02817","author":"Veldt N.","year":"2020","unstructured":"N. Veldt, A. R. Benson, and J. M. Kleinberg. Hypergraph cuts with general splitting functions. CoRR, abs\/2001.02817, 2020."},{"key":"e_1_2_1_119_1","volume-title":"Next-Item Recommendation with Sequential Hypergraphs, page 1101--1110","author":"Wang J.","year":"2020","unstructured":"J. Wang, K. Ding, L. Hong, H. Liu, and J. Caverlee. Next-Item Recommendation with Sequential Hypergraphs, page 1101--1110. Association for Computing Machinery, New York, NY, USA, 2020."},{"key":"e_1_2_1_120_1","volume-title":"Sessionbased recommendation with hypergraph attention networks. CoRR, abs\/2112.14266","author":"Wang J.","year":"2021","unstructured":"J. Wang, K. Ding, Z. Zhu, and J. Caverlee. Sessionbased recommendation with hypergraph attention networks. CoRR, abs\/2112.14266, 2021."},{"key":"e_1_2_1_121_1","doi-asserted-by":"publisher","DOI":"10.1038\/30918"},{"key":"e_1_2_1_122_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2006.51"},{"key":"e_1_2_1_123_1","doi-asserted-by":"publisher","DOI":"10.1126\/sciadv.1600028"},{"key":"e_1_2_1_124_1","volume-title":"Hypergcn: A new method of training graph convolutional networks on hypergraphs","author":"Yadati N.","year":"2018","unstructured":"N. Yadati, M. Nimishakavi, P. Yadav, V. Nitin, A. Louis, and P. Talukdar. Hypergcn: A new method of training graph convolutional networks on hypergraphs, 2018."},{"key":"e_1_2_1_125_1","volume-title":"Heterogeneous network representation learning: Survey, benchmark, evaluation, and beyond. CoRR, abs\/2004.00216","author":"Yang C.","year":"2020","unstructured":"C. Yang, Y. Xiao, Y. Zhang, Y. Sun, and J. Han. Heterogeneous network representation learning: Survey, benchmark, evaluation, and beyond. CoRR, abs\/2004.00216, 2020."},{"key":"e_1_2_1_126_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.97.052306"},{"key":"e_1_2_1_127_1","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098069"},{"key":"e_1_2_1_128_1","volume-title":"Construction of and efficient sampling from the simplicial configuration model. Physical Review E, 96(3), sep","author":"Young J.-G.","year":"2017","unstructured":"J.-G. Young, G. Petri, F. Vaccarino, and A. Patania. Construction of and efficient sampling from the simplicial configuration model. Physical Review E, 96(3), sep 2017."},{"key":"e_1_2_1_129_1","volume-title":"Self-supervised multi-channel hypergraph convolutional network for social recommendation. CoRR, abs\/2101.06448","author":"Yu J.","year":"2021","unstructured":"J. Yu, H. Yin, J. Li, Q. Wang, N. Q. V. Hung, and X. Zhang. Self-supervised multi-channel hypergraph convolutional network for social recommendation. CoRR, abs\/2101.06448, 2021."}],"container-title":["ACM SIGKDD Explorations Newsletter"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3682112.3682114","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3682112.3682114","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T22:54:03Z","timestamp":1750287243000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3682112.3682114"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,24]]},"references-count":128,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,7,24]]}},"alternative-id":["10.1145\/3682112.3682114"],"URL":"https:\/\/doi.org\/10.1145\/3682112.3682114","relation":{},"ISSN":["1931-0145","1931-0153"],"issn-type":[{"value":"1931-0145","type":"print"},{"value":"1931-0153","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,7,24]]},"assertion":[{"value":"2024-07-25","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}