{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,16]],"date-time":"2026-02-16T17:03:28Z","timestamp":1771261408219,"version":"3.50.1"},"reference-count":55,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2024,10,15]],"date-time":"2024-10-15T00:00:00Z","timestamp":1728950400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,10,15]],"date-time":"2024-10-15T00:00:00Z","timestamp":1728950400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Outstanding Innovation Scholarship for Doctoral Candidate of CUMT","award":["2019YCBS057"],"award-info":[{"award-number":["2019YCBS057"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int. J. Mach. Learn. & Cyber."],"published-print":{"date-parts":[[2025,4]]},"DOI":"10.1007\/s13042-024-02414-x","type":"journal-article","created":{"date-parts":[[2024,10,15]],"date-time":"2024-10-15T07:01:59Z","timestamp":1728975719000},"page":"2671-2685","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Higher-order link prediction via light hypergraph neural network and hybrid aggregator"],"prefix":"10.1007","volume":"16","author":[{"given":"Xiaobin","family":"Rui","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiaxin","family":"Zhuang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chengcheng","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhixiao","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,10,15]]},"reference":[{"issue":"3","key":"2414_CR1","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0378-8733(03)00009-1","volume":"25","author":"LA Adamic","year":"2003","unstructured":"Adamic LA, Adar E (2003) Friends and neighbors on the web. Soc Netw 25(3):211\u2013230","journal-title":"Soc Netw"},{"key":"2414_CR2","unstructured":"Arya D, Gupta DK, Rudinac S, Worring M (2020) Hypersage: generalizing inductive representation learning on hypergraphs. arXiv preprint arXiv:2010.04558"},{"issue":"48","key":"2414_CR3","doi-asserted-by":"publisher","first-page":"11221","DOI":"10.1073\/pnas.1800683115","volume":"115","author":"AR Benson","year":"2018","unstructured":"Benson AR, Abebe R, Schaub MT, Jadbabaie A, Kleinberg J (2018) Simplicial closure and higher-order link prediction. Proc Natl Acad Sci 115(48):11221\u201311230","journal-title":"Proc Natl Acad Sci"},{"key":"2414_CR4","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, Cencetti G, Iacopini I, Latora V, Lucas M, Patania A, Young J-G, Petri G (2020) Networks beyond pairwise interactions: structure and dynamics. Phys Rep 874:1\u201392","journal-title":"Phys Rep"},{"key":"2414_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.physrep.2023.04.002","volume":"1018","author":"S Boccaletti","year":"2023","unstructured":"Boccaletti S, De Lellis P, Del Genio C, Alfaro-Bittner K, Criado R, Jalan S, Romance M (2023) The structure and dynamics of networks with higher order interactions. Phys Rep 1018:1\u201364","journal-title":"Phys Rep"},{"key":"2414_CR6","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2023.3286280","author":"C Chen","year":"2023","unstructured":"Chen C, Liu Y-Y (2023) A survey on hyperlink prediction. IEEE Trans Neural Netw Learn Syst. https:\/\/doi.org\/10.1109\/TNNLS.2023.3286280","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"issue":"1","key":"2414_CR7","doi-asserted-by":"publisher","first-page":"2375","DOI":"10.1038\/s41467-023-38110-7","volume":"14","author":"C Chen","year":"2023","unstructured":"Chen C, Liao C, Liu Y-Y (2023) Teasing out missing reactions in genome-scale metabolic networks through hypergraph learning. Nat Commun 14(1):2375","journal-title":"Nat Commun"},{"key":"2414_CR8","first-page":"27","volume":"34","author":"L Chen","year":"2020","unstructured":"Chen L, Wu L, Hong R, Zhang K, Wang M (2020) Revisiting graph based collaborative filtering: a linear residual graph convolutional network approach. Proc AAAI Conf Artif Intell 34:27\u201334","journal-title":"Proc AAAI Conf Artif Intell"},{"key":"2414_CR9","first-page":"1","volume":"56","author":"S Chen","year":"2024","unstructured":"Chen S, Zhang C, Gu F, Wang H (2024) RSGNN: residual structure graph neural network. Int J Mach Learn Cybern 56:1\u201314","journal-title":"Int J Mach Learn Cybern"},{"key":"2414_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-99-0185-2","volume-title":"Hypergraph computation","author":"Q Dai","year":"2023","unstructured":"Dai Q, Gao Y (2023) Hypergraph computation. Springer, Berlin"},{"key":"2414_CR11","unstructured":"Dong Y, Sawin W, Bengio Y (2020) HNHN: hypergraph networks with hyperedge neurons. In: Graph representation learning and beyond workshop at ICML 2020"},{"key":"2414_CR12","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2023.119875","volume":"223","author":"C Ding","year":"2023","unstructured":"Ding C, Zhao Z, Li C, Yu Y, Zeng Q (2023) Session-based recommendation with hypergraph convolutional networks and sequential information embeddings. Expert Syst Appl 223:119875","journal-title":"Expert Syst Appl"},{"key":"2414_CR13","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.jtbi.2017.11.003","volume":"438","author":"E Estrada","year":"2018","unstructured":"Estrada E, Ross GJ (2018) Centralities in simplicial complexes. Applications to protein interaction networks. J Theor Biol 438:46\u201360","journal-title":"J Theor Biol"},{"key":"2414_CR14","first-page":"3558","volume":"33","author":"Y Feng","year":"2019","unstructured":"Feng Y, You H, Zhang Z, Ji R, Gao Y (2019) Hypergraph neural networks. Proc AAAI Conf Artif Intell 33:3558\u20133565","journal-title":"Proc AAAI Conf Artif Intell"},{"issue":"3","key":"2414_CR15","doi-asserted-by":"publisher","first-page":"3181","DOI":"10.1109\/TPAMI.2022.3182052","volume":"45","author":"Y Gao","year":"2022","unstructured":"Gao Y, Feng Y, Ji S, Ji R (2022) HGNN+: general hypergraph neural networks. IEEE Trans Pattern Anal Mach Intell 45(3):3181\u20133199","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"2414_CR16","doi-asserted-by":"crossref","unstructured":"He X, Deng K, Wang X, Li Y, Zhang Y, Wang M (2020) LightGCN: simplifying and powering graph convolution network for recommendation. In: Proceedings of the 43rd international ACM SIGIR conference on research and development in information retrieval, pp 639\u2013648","DOI":"10.1145\/3397271.3401063"},{"key":"2414_CR17","doi-asserted-by":"crossref","unstructured":"Heydari S, Livi L (2022) Message passing neural networks for hypergraphs. In: International conference on artificial neural networks. Springer, pp 583\u2013592","DOI":"10.1007\/978-3-031-15931-2_48"},{"key":"2414_CR18","doi-asserted-by":"crossref","unstructured":"Hwang H, Lee S, Park C, Shin K (2022) AHP: learning to negative sample for hyperedge prediction. In: Proceedings of the 45th international ACM SIGIR conference on research and development in information retrieval, pp 2237\u20132242","DOI":"10.1145\/3477495.3531836"},{"key":"2414_CR19","doi-asserted-by":"crossref","unstructured":"Huang J, Yang J (2021) UniGNN: a unified framework for graph and hypergraph neural networks. In: Proceedings of the thirtieth international joint conference on artificial intelligence, IJCAI 2021, pp 2563\u20132569","DOI":"10.24963\/ijcai.2021\/353"},{"key":"2414_CR20","first-page":"547","volume":"37","author":"P Jaccard","year":"1901","unstructured":"Jaccard P (1901) \u00c9tude comparative de la distribution florale dans une portion des alpes et des jura. Bull Soc Vaudoise Sci Nat 37:547\u2013579","journal-title":"Bull Soc Vaudoise Sci Nat"},{"key":"2414_CR21","doi-asserted-by":"crossref","unstructured":"Ji S, Feng Y, Ji R, Zhao X, Tang W, Gao Y (2020) Dual channel hypergraph collaborative filtering. In: Proceedings of the 26th ACM SIGKDD international conference on knowledge discovery & data mining, pp 2020\u20132029","DOI":"10.1145\/3394486.3403253"},{"key":"2414_CR22","doi-asserted-by":"crossref","unstructured":"Kumar T, Darwin K, Parthasarathy S, Ravindran B (2020) HPRA: hyperedge prediction using resource allocation. In: Proceedings of the 12th ACM conference on web science, pp 135\u2013143","DOI":"10.1145\/3394231.3397903"},{"issue":"2","key":"2414_CR23","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/s00354-023-00208-3","volume":"41","author":"HM Kerkache","year":"2023","unstructured":"Kerkache HM, Sadeg-Belkacem L, Tayeb FB-S (2023) Similarity-based hybrid algorithms for link prediction problem in social networks. New Gener Comput 41(2):281\u2013314","journal-title":"New Gener Comput"},{"key":"2414_CR24","unstructured":"Ko Y, Tong H, Kim S-W (2023) Enhancing hyperedge prediction with context-aware self-supervised learning. arXiv preprint arXiv:2309.05798"},{"key":"2414_CR25","unstructured":"Kipf TN, Welling M (2017) Semi-supervised classification with graph convolutional networks. In: 5th International conference on learning representations, ICLR 2017, Toulon, France, April 24\u201326, 2017, conference track proceedings"},{"issue":"7656","key":"2414_CR26","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1038\/nature22898","volume":"546","author":"JM Levine","year":"2017","unstructured":"Levine JM, Bascompte J, Adler PB, Allesina S (2017) Beyond pairwise mechanisms of species coexistence in complex communities. Nature 546(7656):56\u201364","journal-title":"Nature"},{"key":"2414_CR27","doi-asserted-by":"crossref","unstructured":"Liu C, He T, Zhu H, Li Y, Xie S, Hosam O (2022) A survey of recommender systems based on hypergraph neural networks. In: International conference on smart computing and communication. Springer, pp. 95\u2013106","DOI":"10.1007\/978-3-031-28124-2_10"},{"key":"2414_CR28","doi-asserted-by":"crossref","unstructured":"Liben-Nowell D, Kleinberg J (2003) The link prediction problem for social networks. In: Proceedings of the twelfth international conference on information and knowledge management, pp 556\u2013559","DOI":"10.1145\/956863.956972"},{"key":"2414_CR29","doi-asserted-by":"crossref","unstructured":"Li K, Xi W-D, Xing X-X, Wang C-D (2023) Hypergraph attribute attention network for community recommendation. In: 2023 ieee international conference on data mining (ICDM). IEEE, pp 269\u2013278","DOI":"10.1109\/ICDM58522.2023.00036"},{"key":"2414_CR30","unstructured":"Mi H (2021) Link prediction of complex networks based on graph embedding. Master\u2019s thesis, China University of Mining and Technology"},{"key":"2414_CR31","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/s41745-021-00225-5","volume":"101","author":"D Maurya","year":"2021","unstructured":"Maurya D, Ravindran B (2021) Hyperedge prediction using tensor eigenvalue decomposition. J Indian Inst Sci 101:443\u2013453","journal-title":"J Indian Inst Sci"},{"issue":"1","key":"2414_CR32","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3626569","volume":"18","author":"Y Ma","year":"2023","unstructured":"Ma Y, Wang Z, Huang L, Wang J (2023) CLHHN: category-aware lossless heterogeneous hypergraph neural network for session-based recommendation. ACM Trans Web 18(1):1\u201337","journal-title":"ACM Trans Web"},{"issue":"2","key":"2414_CR33","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.64.025102","volume":"64","author":"ME Newman","year":"2001","unstructured":"Newman ME (2001) Clustering and preferential attachment in growing networks. Phys Rev E 64(2):025102","journal-title":"Phys Rev E"},{"key":"2414_CR34","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1140\/epjds\/s13688-017-0114-8","volume":"6","author":"A Patania","year":"2017","unstructured":"Patania A, Petri G, Vaccarino F (2017) The shape of collaborations. EPJ Data Sci 6:1\u201316","journal-title":"EPJ Data Sci"},{"key":"2414_CR35","doi-asserted-by":"crossref","unstructured":"Patil P, Sharma G, Murty MN (2020) Negative sampling for hyperlink prediction in networks. In: Advances in knowledge discovery and data mining: 24th Pacific-Asia conference, PAKDD 2020, Singapore, May 11\u201314, 2020, proceedings, part II 24. Springer, pp 607\u2013619","DOI":"10.1007\/978-3-030-47436-2_46"},{"issue":"3","key":"2414_CR36","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1109\/TC.2021.3057082","volume":"71","author":"H Peng","year":"2021","unstructured":"Peng H, Yang R, Wang Z, Li J, He L, Philip SY, Zomaya AY, Ranjan R (2021) LIME: low-cost and incremental learning for dynamic heterogeneous information networks. IEEE Trans Comput 71(3):628\u2013642","journal-title":"IEEE Trans Comput"},{"key":"2414_CR37","first-page":"1","volume":"42","author":"H Peng","year":"2024","unstructured":"Peng H, Zhang J, Huang X, Hao Z, Li A, Yu Z, Yu PS (2024) Unsupervised social bot detection via structural information theory. ACM Trans Inf Syst 42:1\u201342","journal-title":"ACM Trans Inf Syst"},{"key":"2414_CR38","doi-asserted-by":"crossref","unstructured":"Qin H, Li R-H, Yuan Y, Wang G, Dai Y (2023) Explainable hyperlink prediction: a hypergraph edit distance-based approach. In: 2023 IEEE 39th international conference on data engineering (ICDE).IEEE, pp 245\u2013257","DOI":"10.1109\/ICDE55515.2023.00386"},{"key":"2414_CR39","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.coisb.2017.05.007","volume":"4","author":"JL Robinson","year":"2017","unstructured":"Robinson JL, Nielsen J (2017) Anticancer drug discovery through genome-scale metabolic modeling. Curr Opin Syst Biol 4:1\u20138","journal-title":"Curr Opin Syst Biol"},{"key":"2414_CR40","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00607-024-01261-6","volume":"106","author":"C Sun","year":"2024","unstructured":"Sun C, Meng F, Li C, Rui X, Wang Z (2024) LGAT: a light graph attention network focusing on message passing for semi-supervised node classification. Computing 106:1\u201319","journal-title":"Computing"},{"key":"2414_CR41","doi-asserted-by":"crossref","unstructured":"Sharma G, Patil P, Murty MN (2021) C3MM: clique-closure based hyperlink prediction. In: Proceedings of the twenty-ninth international conference on international joint conferences on artificial intelligence, pp 3364\u20133370","DOI":"10.24963\/ijcai.2020\/465"},{"key":"2414_CR42","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11266","author":"K Tu","year":"2018","unstructured":"Tu K, Cui P, Wang X, Wang F, Zhu W (2018) Structural deep embedding for hyper-networks. Proc AAAI Conf Artif Intell. https:\/\/doi.org\/10.1609\/aaai.v32i1.11266","journal-title":"Proc AAAI Conf Artif Intell"},{"key":"2414_CR43","unstructured":"Veli\u010dkovi\u0107 P, Cucurull G, Casanova A, Romero A, Li\u00f2 P, Bengio Y (2018) Graph attention networks. In: International conference on learning representations"},{"key":"2414_CR44","unstructured":"Wu F, Souza A, Zhang T, Fifty C, Yu T, Weinberger K (2019) Simplifying graph convolutional networks. In: International conference on machine learning. PMLR, pp 6861\u20136871"},{"issue":"3","key":"2414_CR45","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1007\/s13042-022-01667-8","volume":"14","author":"Y Xue","year":"2023","unstructured":"Xue Y, Jin Z, Apasiba AT (2023) A novel message passing neural network based on neighborhood expansion. Int J Mach Learn Cybern 14(3):849\u2013860","journal-title":"Int J Mach Learn Cybern"},{"issue":"1","key":"2414_CR46","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1007\/s00138-021-01251-0","volume":"33","author":"S Xiao","year":"2022","unstructured":"Xiao S, Wang S, Dai Y, Guo W (2022) Graph neural networks in node classification: survey and evaluation. Mach Vis Appl 33(1):4","journal-title":"Mach Vis Appl"},{"key":"2414_CR47","doi-asserted-by":"crossref","unstructured":"Yang M, Liu Z, Yang L, Liu X, Wang C, Peng H, Yu PS (2023) Group identification via transitional hypergraph convolution with cross-view self-supervised learning. In: Proceedings of the 32nd ACM international conference on information and knowledge management, pp 2969\u20132979","DOI":"10.1145\/3583780.3614902"},{"key":"2414_CR48","doi-asserted-by":"crossref","unstructured":"Yang M, Liu Z, Yang L, Liu X, Wang C, Peng H, Yu PS (2024) Instruction-based hypergraph pretraining. In: Proceedings of the 47th international ACM SIGIR conference on research and development in information retrieval, SIGIR 2024, Washington DC, USA, July 14\u201318, 2024. ACM, pp 501\u2013511","DOI":"10.1145\/3626772.3657715"},{"key":"2414_CR49","doi-asserted-by":"crossref","unstructured":"Yang M, Liu Z, Yang L, Liu X, Wang C, Peng H, Yu PS (2024) Unified pretraining for recommendation via task hypergraphs. In: Proceedings of the 17th ACM international conference on web search and data mining, pp 891\u2013900","DOI":"10.1145\/3616855.3635811"},{"key":"2414_CR50","doi-asserted-by":"crossref","unstructured":"Yadati N, Nitin V, Nimishakavi M, Yadav P, Louis A, Talukdar P (2020) NHP: neural hypergraph link prediction. In: Proceedings of the 29th ACM international conference on information & knowledge management, pp 1705\u20131714","DOI":"10.1145\/3340531.3411870"},{"key":"2414_CR51","unstructured":"Yadati N, Nimishakavi M, Yadav P, Nitin V, Louis A, Talukdar P (2019) HyperGCN: a new method for training graph convolutional networks on hypergraphs. In: Advances in neural information processing systems 32"},{"issue":"9","key":"2414_CR52","doi-asserted-by":"publisher","first-page":"3863","DOI":"10.1007\/s13042-024-02124-4","volume":"15","author":"Yazhi Yang","year":"2024","unstructured":"Yang Yazhi, Shi Jiandong, Li Ming, Fujita Hamido (2024) Framelet-based dual hypergraph neural networks for student performance prediction. Int J Mach Learn Cybern 15(9):3863\u20133877. https:\/\/doi.org\/10.1007\/s13042-024-02124-4","journal-title":"Int J Mach Learn Cybern"},{"key":"2414_CR53","doi-asserted-by":"crossref","unstructured":"Yoon S-e, Song H, Shin K, Yi Y (2020) How much and when do we need higher-order information in hypergraphs? A case study on hyperedge prediction. In: Proceedings of the web conference 2020, pp 2627\u20132633","DOI":"10.1145\/3366423.3380016"},{"key":"2414_CR54","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11780","author":"M Zhang","year":"2018","unstructured":"Zhang M, Cui Z, Jiang S, Chen Y (2018) Beyond link prediction: predicting hyperlinks in adjacency space. Proc AAAI Conf Artif Intell. https:\/\/doi.org\/10.1609\/aaai.v32i1.11780","journal-title":"Proc AAAI Conf Artif Intell"},{"key":"2414_CR55","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1140\/epjb\/e2009-00335-8","volume":"71","author":"T Zhou","year":"2009","unstructured":"Zhou T, L\u00fc L, Zhang Y-C (2009) Predicting missing links via local information. Eur Phys J B 71:623\u2013630","journal-title":"Eur Phys J B"}],"container-title":["International Journal of Machine Learning and Cybernetics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-024-02414-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13042-024-02414-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-024-02414-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,7]],"date-time":"2025-04-07T07:33:21Z","timestamp":1744011201000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13042-024-02414-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,15]]},"references-count":55,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,4]]}},"alternative-id":["2414"],"URL":"https:\/\/doi.org\/10.1007\/s13042-024-02414-x","relation":{},"ISSN":["1868-8071","1868-808X"],"issn-type":[{"value":"1868-8071","type":"print"},{"value":"1868-808X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,10,15]]},"assertion":[{"value":"15 July 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 October 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 October 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}