{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T15:02:08Z","timestamp":1776351728019,"version":"3.51.2"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2023,1,9]],"date-time":"2023-01-09T00:00:00Z","timestamp":1673222400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,1,9]],"date-time":"2023-01-09T00:00:00Z","timestamp":1673222400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U1701266"],"award-info":[{"award-number":["U1701266"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Guangdong Provincial Key Laboratory Project of Intellectual Property and Big Data","award":["2018B030322016"],"award-info":[{"award-number":["2018B030322016"]}]},{"name":"Special Projects for Key Fields in Higher Education of Guangdong","award":["2020ZDZX3077"],"award-info":[{"award-number":["2020ZDZX3077"]}]},{"DOI":"10.13039\/501100003453","name":"Natural Science Foundation of Guangdong Province","doi-asserted-by":"publisher","award":["2022A1515011146"],"award-info":[{"award-number":["2022A1515011146"]}],"id":[{"id":"10.13039\/501100003453","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Key Field R &D Plan Project of Guanzhou","award":["202206070003"],"award-info":[{"award-number":["202206070003"]}]},{"name":"Youth Innovation Project of the Department of Education of Guangdong Provinc","award":["2020KQNCX040"],"award-info":[{"award-number":["2020KQNCX040"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Complex Intell. Syst."],"published-print":{"date-parts":[[2023,8]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Hypergraphs, as a powerful representation of information, effectively and naturally depict complex and non-pair-wise relationships in the real world. Hypergraph representation learning is useful for exploring complex relationships implicit in hypergraphs. However, most methods focus on the 1-order neighborhoods and ignore the higher order neighborhood relationships among data on the hypergraph structure. These often result in underutilization of hypergraph structure. In this paper, we exploit the potential of higher order neighborhoods in hypergraphs for representation and propose a Multi-Order Hypergraph Convolutional Network Integrated with Self-supervised Learning. We first encode the multi-channel network of the hypergraph by a high-order spectral convolution operator that captures the multi-order representation of nodes. Then, we introduce an inter-order attention mechanism to preserve the low-order neighborhood information. Finally, to extract valid embedding in the higher order neighborhoods, we incorporate a self-supervised learning strategy based on maximizing mutual information in the multi-order hypergraph convolutional network. Experiments on several hypergraph datasets show that the proposed model is competitive with state-of-the-art baselines, and ablation studies show the effectiveness of higher order neighborhood development, the inter-order attention mechanism, and the self-supervised learning strategy.<\/jats:p>","DOI":"10.1007\/s40747-022-00964-7","type":"journal-article","created":{"date-parts":[[2023,1,9]],"date-time":"2023-01-09T03:03:36Z","timestamp":1673233416000},"page":"4389-4401","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Multi-order hypergraph convolutional networks integrated with self-supervised learning"],"prefix":"10.1007","volume":"9","author":[{"given":"Jiahao","family":"Huang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2059-8818","authenticated-orcid":false,"given":"Fangyuan","family":"Lei","sequence":"additional","affiliation":[]},{"given":"Jianjian","family":"Jiang","sequence":"additional","affiliation":[]},{"given":"Xi","family":"Zeng","sequence":"additional","affiliation":[]},{"given":"Ruijun","family":"Ma","sequence":"additional","affiliation":[]},{"given":"Qingyun","family":"Dai","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,1,9]]},"reference":[{"key":"964_CR1","unstructured":"Abu-El-Haija S, Perozzi B, Kapoor A, Alipourfard N, Lerman K, Harutyunyan H, Ver\u00a0Steeg G, Galstyan A (2019) Mixhop: Higher-order graph convolutional architectures via sparsified neighborhood mixing. In: International conference on machine learning. PMLR, pp 21\u201329"},{"key":"964_CR2","unstructured":"Arya D, Gupta DK, Rudinac S, Worring M (2020) Hypersage: generalizing inductive representation learning on hypergraphs. arXiv preprint arXiv:2010.04558"},{"key":"964_CR3","unstructured":"Bachman P, Hjelm RD, Buchwalter W (2019) Learning representations by maximizing mutual information across views. Adv Neural Inf Process Syst 32"},{"key":"964_CR4","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2020.107637","volume":"110","author":"S Bai","year":"2021","unstructured":"Bai S, Zhang F, Torr PH (2021) Hypergraph convolution and hypergraph attention. Pattern Recogn 110:107637","journal-title":"Pattern Recogn"},{"key":"964_CR5","unstructured":"Bandyopadhyay S, Das K, Murty MN (2020) Line hypergraph convolution network: Applying graph convolution for hypergraphs. arXiv preprint arXiv:2002.03392"},{"key":"964_CR6","doi-asserted-by":"crossref","unstructured":"Banka A, Buzi I, Rekik I (2020) Multi-view brain hyperconnectome autoencoder for brain state classification. In: International workshop on predictive intelligence in medicine. Springer, pp 101\u2013110","DOI":"10.1007\/978-3-030-59354-4_10"},{"key":"964_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-00080-0","volume-title":"Hypergraph theory. An introduction. Mathematical engineering","author":"A Bretto","year":"2013","unstructured":"Bretto A (2013) Hypergraph theory. An introduction. Mathematical engineering. Springer, Cham"},{"key":"964_CR8","unstructured":"Chen M, Wei Z, Huang Z, Ding B, Li Y (2020) Simple and deep graph convolutional networks. In: International conference on machine learning. PMLR, pp 1725\u20131735"},{"key":"964_CR9","unstructured":"Defferrard M, Bresson X, Vandergheynst P (2016) Convolutional neural networks on graphs with fast localized spectral filtering. Adv Neural Inf Process Syst 29"},{"key":"964_CR10","unstructured":"Dong Y, Sawin W, Bengio Y (2020) Hnhn: hypergraph networks with hyperedge neurons. arXiv preprint arXiv:2006.12278"},{"key":"964_CR11","doi-asserted-by":"crossref","unstructured":"Fan H, Zhang F, Wei Y, Li Z, Zou C, Gao Y, Dai Q (2021) Heterogeneous hypergraph variational autoencoder for link prediction. IEEE Trans Pattern Anal Mach Intell","DOI":"10.1109\/TPAMI.2021.3059313"},{"key":"964_CR12","doi-asserted-by":"crossref","unstructured":"Feng Y, You H, Zhang Z, Ji R, Gao Y (2019) Hypergraph neural networks. In: Proceedings of the AAAI conference on artificial intelligence, vol\u00a033, pp 3558\u20133565","DOI":"10.1609\/aaai.v33i01.33013558"},{"key":"964_CR13","doi-asserted-by":"crossref","unstructured":"Gao Y, Zhang Z, Lin H, Zhao X, Du S, Zou C (2020) Hypergraph learning: methods and practices. IEEE Trans Pattern Anal Mach Intell","DOI":"10.1109\/TPAMI.2020.3039374"},{"key":"964_CR14","unstructured":"Georgiev D, Brockschmidt M, Allamanis M (2022) Heat: hyperedge attention networks. arXiv preprint arXiv:2201.12113"},{"key":"964_CR15","unstructured":"Hamilton W, Ying Z, Leskovec J (2017) Inductive representation learning on large graphs. Adv Neural Inf Process Syst 30"},{"key":"964_CR16","doi-asserted-by":"publisher","first-page":"2263","DOI":"10.1109\/TIP.2021.3051495","volume":"30","author":"X Hao","year":"2021","unstructured":"Hao X, Li J, Guo Y, Jiang T, Yu M (2021) Hypergraph neural network for skeleton-based action recognition. IEEE Trans Image Process 30:2263\u20132275","journal-title":"IEEE Trans Image Process"},{"key":"964_CR17","unstructured":"Hassani K, Khasahmadi AH (2020) Contrastive multi-view representation learning on graphs. In: International conference on machine learning. PMLR, pp 4116\u20134126"},{"key":"964_CR18","unstructured":"Hjelm R.D, Fedorov A, Lavoie-Marchildon S, Grewal K, Bachman P, Trischler A, Bengio Y (2018) Learning deep representations by mutual information estimation and maximization. arXiv preprint arXiv:1808.06670"},{"key":"964_CR19","doi-asserted-by":"crossref","unstructured":"Huang J, Yang J (2021) Unignn: a unified framework for graph and hypergraph neural networks. arXiv preprint arXiv:2105.00956","DOI":"10.24963\/ijcai.2021\/353"},{"key":"964_CR20","doi-asserted-by":"crossref","unstructured":"Huang J, Lei F, Wang S, Wang S, Dai Q (2021) Hypergraph convolutional network with hybrid higher-order neighbors. In: Chinese conference on pattern recognition and computer vision (PRCV). Springer, pp 103\u2013114","DOI":"10.1007\/978-3-030-88013-2_9"},{"issue":"1","key":"964_CR21","doi-asserted-by":"publisher","first-page":"2","DOI":"10.3390\/technologies9010002","volume":"9","author":"A Jaiswal","year":"2020","unstructured":"Jaiswal A, Babu AR, Zadeh MZ, Banerjee D, Makedon F (2020) A survey on contrastive self-supervised learning. Technologies 9(1):2","journal-title":"Technologies"},{"key":"964_CR22","doi-asserted-by":"crossref","unstructured":"Jiang J, Wei Y, Feng Y, Cao J, Gao Y (2019) Dynamic hypergraph neural networks. In: IJCAI, pp 2635\u20132641","DOI":"10.24963\/ijcai.2019\/366"},{"key":"964_CR23","doi-asserted-by":"crossref","unstructured":"Jia R, Zhou X, Dong L, Pan S (2021) Hypergraph convolutional network for group recommendation. In: 2021 IEEE international conference on data mining (ICDM). IEEE, pp 260\u2013269","DOI":"10.1109\/ICDM51629.2021.00036"},{"issue":"11","key":"964_CR24","doi-asserted-by":"publisher","first-page":"4037","DOI":"10.1109\/TPAMI.2020.2992393","volume":"43","author":"L Jing","year":"2020","unstructured":"Jing L, Tian Y (2020) Self-supervised visual feature learning with deep neural networks: a survey. IEEE Trans Pattern Anal Mach Intell 43(11):4037\u20134058","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"964_CR25","doi-asserted-by":"crossref","unstructured":"Jing B, Park C, Tong H (2021) Hdmi: high-order deep multiplex infomax. In: Proceedings of the web conference 2021, pp 2414\u20132424","DOI":"10.1145\/3442381.3449971"},{"key":"964_CR26","unstructured":"Kipf TN, Welling M (2016) Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907"},{"key":"964_CR27","unstructured":"Klicpera J, Bojchevski A, G\u00fcnnemann S (2018) Predict then propagate: graph neural networks meet personalized pagerank. arXiv preprint arXiv:1810.05997"},{"key":"964_CR28","unstructured":"Kong L, d\u2019Autume C.d.M, Ling W, Yu L, Dai Z, Yogatama D (2019) A mutual information maximization perspective of language representation learning. arXiv preprint arXiv:1910.08350"},{"key":"964_CR29","doi-asserted-by":"crossref","unstructured":"Liu S, Lv P, Zhang Y, Fu J, Cheng J, Li W, Zhou B, Xu M (2020) Semi-dynamic hypergraph neural network for 3d pose estimation. In: IJCAI, pp 782\u2013788","DOI":"10.24963\/ijcai.2020\/109"},{"key":"964_CR30","doi-asserted-by":"crossref","unstructured":"Liu X, Zhang F, Hou Z, Mian L, Wang Z, Zhang J, Tang J (2021) Self-supervised learning: generative or contrastive. IEEE Trans Knowl Data Eng","DOI":"10.1109\/TKDE.2021.3090866"},{"issue":"2","key":"964_CR31","doi-asserted-by":"publisher","first-page":"1005","DOI":"10.1007\/s40747-021-00567-8","volume":"8","author":"X Liu","year":"2022","unstructured":"Liu X, Lei F, Xia G, Zhang Y, Wei W (2022) Adjmix: simplifying and attending graph convolutional networks. Complex Intell Syst 8(2):1005\u20131014","journal-title":"Complex Intell Syst"},{"key":"964_CR32","unstructured":"Lostar M, Rekik I (2020) Deep hypergraph u-net for brain graph embedding and classification. arXiv preprint arXiv:2008.13118"},{"key":"964_CR33","unstructured":"Payne J (2019) Deep hyperedges: a framework for transductive and inductive learning on hypergraphs. arXiv preprint arXiv:1910.02633"},{"key":"964_CR34","unstructured":"Sun FY, Hoffmann J, Verma V, Tang J (2019) Infograph: unsupervised and semi-supervised graph-level representation learning via mutual information maximization. arXiv preprint arXiv:1908.01000"},{"key":"964_CR35","unstructured":"Van\u00a0der Maaten L, Hinton G (2008) Visualizing data using t-sne. J Mach Learn Res 9(11)"},{"key":"964_CR36","unstructured":"Veli\u010dkovi\u0107 P, Cucurull G, Casanova A, Romero A, Lio P, Bengio Y (2017) Graph attention networks. arXiv preprint arXiv:1710.10903"},{"key":"964_CR37","unstructured":"Veli\u010dkovi\u0107 P, Fedus W, Hamilton W.L, Li\u00f2 P, Bengio Y, Hjelm RD (2018) Deep graph infomax. arXiv preprint arXiv:1809.10341"},{"key":"964_CR38","doi-asserted-by":"crossref","unstructured":"Wang J, Ding K, Zhu Z, Caverlee J (2021) Session-based recommendation with hypergraph attention networks. In: Proceedings of the 2021 SIAM international conference on data mining (SDM). SIAM, pp 82\u201390","DOI":"10.1137\/1.9781611976700.10"},{"key":"964_CR39","doi-asserted-by":"crossref","unstructured":"Xia X, Yin H, Yu J, Wang Q, Cui L, Zhang X (2021) Self-supervised hypergraph convolutional networks for session-based recommendation. In: Proceedings of the AAAI conference on artificial intelligence, vol 35, pp 4503\u20134511","DOI":"10.1609\/aaai.v35i5.16578"},{"key":"964_CR40","unstructured":"Xu K, Hu W, Leskovec J, Jegelka S (2018) How powerful are graph neural networks? arXiv preprint arXiv:1810.00826"},{"key":"964_CR41","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. Adv Neural Inf Process Systems 32"},{"key":"964_CR42","unstructured":"Yang C, Wang R, Yao S, Abdelzaher T (2020) Hypergraph learning with line expansion. arXiv preprint arXiv:2005.04843"},{"key":"964_CR43","doi-asserted-by":"crossref","unstructured":"Yi J, Park J (2020) Hypergraph convolutional recurrent neural network. In: Proceedings of the 26th ACM SIGKDD international conference on knowledge discovery & data mining, pp 3366\u20133376","DOI":"10.1145\/3394486.3403389"},{"key":"964_CR44","doi-asserted-by":"crossref","unstructured":"Yu J, Yin H, Li J, Wang Q, Hung NQV, Zhang X (2021) Self-supervised multi-channel hypergraph convolutional network for social recommendation. In: Proceedings of the web conference 2021, pp 413\u2013424","DOI":"10.1145\/3442381.3449844"},{"key":"964_CR45","unstructured":"Zhang R, Zou Y, Ma J (2019) Hyper-sagnn: a self-attention based graph neural network for hypergraphs. arXiv preprint arXiv:1911.02613"},{"key":"964_CR46","unstructured":"Zhang J, Li F, Xiao X, Xu T, Rong Y, Huang J, Bian Y (2022) Hypergraph convolutional networks via equivalency between hypergraphs and undirected graphs. arXiv preprint arXiv:2203.16939"},{"key":"964_CR47","doi-asserted-by":"crossref","unstructured":"Zhou D, Huang J, Sch\u00f6lkopf B (2006) Learning with hypergraphs: clustering, classification, and embedding. Adv Neural Inf Process Syst 19","DOI":"10.7551\/mitpress\/7503.003.0205"},{"key":"964_CR48","unstructured":"Zhu H, Koniusz P (2020) Simple spectral graph convolution. In: International conference on learning representations"}],"container-title":["Complex &amp; Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-022-00964-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40747-022-00964-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-022-00964-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,27]],"date-time":"2023-07-27T13:26:06Z","timestamp":1690464366000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40747-022-00964-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,9]]},"references-count":48,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,8]]}},"alternative-id":["964"],"URL":"https:\/\/doi.org\/10.1007\/s40747-022-00964-7","relation":{},"ISSN":["2199-4536","2198-6053"],"issn-type":[{"value":"2199-4536","type":"print"},{"value":"2198-6053","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,1,9]]},"assertion":[{"value":"23 June 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 December 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 January 2023","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 conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}