{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T04:11:23Z","timestamp":1770696683804,"version":"3.49.0"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"National Key Research and Development Program of China","award":["Nos. 2023YFC3807500"],"award-info":[{"award-number":["Nos. 2023YFC3807500"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int. J. Mach. Learn. & Cyber."],"published-print":{"date-parts":[[2026,1]]},"DOI":"10.1007\/s13042-025-02827-2","type":"journal-article","created":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T07:37:19Z","timestamp":1768635439000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Heterogeneous graph structure learning for link prediction in knowledge hypergraphs"],"prefix":"10.1007","volume":"17","author":[{"given":"Dequan","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhiyong","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiaxiang","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,1,17]]},"reference":[{"key":"2827_CR1","doi-asserted-by":"crossref","unstructured":"Liu Y, Yao Q, Li Y (2020) Generalizing tensor decomposition for n-ary relational knowledge bases. In: Proceedings of the web conference 2020, pp 1104\u20131114","DOI":"10.1145\/3366423.3380188"},{"key":"2827_CR2","unstructured":"Yu D, Yang Y (2021) Improving hyper-relational knowledge graph completion. arXiv preprint arXiv:2104.08167"},{"key":"2827_CR3","doi-asserted-by":"crossref","unstructured":"Wang Q, Wang H, Lyu Y, Zhu Y (2021) Link prediction on n-ary relational facts: a graph-based approach. arXiv preprint arXiv:2105.08476","DOI":"10.18653\/v1\/2021.findings-acl.35"},{"key":"2827_CR4","doi-asserted-by":"crossref","unstructured":"Bollacker K, Evans C, Paritosh P, Sturge T, Taylor J (2008) Freebase: a collaboratively created graph database for structuring human knowledge. In: Proceedings of the 2008 ACM SIGMOD International conference on management of data, pp 1247\u20131250","DOI":"10.1145\/1376616.1376746"},{"issue":"10","key":"2827_CR5","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1145\/2629489","volume":"57","author":"D Vrande\u010di\u0107","year":"2014","unstructured":"Vrande\u010di\u0107 D, Kr\u00f6tzsch M (2014) Wikidata: a free collaborative knowledgebase. Commun ACM 57(10):78\u201385","journal-title":"Commun ACM"},{"issue":"2","key":"2827_CR6","first-page":"167","volume":"6","author":"J Lehmann","year":"2015","unstructured":"Lehmann J, Isele R, Jakob M, Jentzsch A, Kontokostas D, Mendes PN, Hellmann S, Morsey M, Van Kleef P, Auer S et al (2015) Dbpedia-a large-scale, multilingual knowledge base extracted from wikipedia. Semantic web 6(2):167\u2013195","journal-title":"Semantic web"},{"key":"2827_CR7","doi-asserted-by":"crossref","unstructured":"Suchanek FM, Kasneci G, Weikum, G.: Yago, (2007) a core of semantic knowledge. In: Proceedings of the 16th international conference on world wide web, pp 697\u2013706","DOI":"10.1145\/1242572.1242667"},{"key":"2827_CR8","unstructured":"Pujara J, Miao H, Getoor L, Cohen W (2013) Knowledge graph identification. In: The Semantic Web\u2013ISWC 2013: 12th international semantic web conference, Sydney, NSW, Australia, October 21-25, 2013, Proceedings, Part I 12, pp. 542\u2013557 . Springer"},{"key":"2827_CR9","doi-asserted-by":"crossref","unstructured":"Dong X, Gabrilovich E, Heitz G, Horn W, Lao N, Murphy K, Strohmann T, Sun S, Zhang W (2014) Knowledge vault: A web-scale approach to probabilistic knowledge fusion. In: Proceedings of the 20th ACM SIGKDD international conference on knowledge discovery and data mining, pp 601\u2013610","DOI":"10.1145\/2623330.2623623"},{"key":"2827_CR10","doi-asserted-by":"crossref","unstructured":"Krompa\u00df D, Baier S, Tresp V (2015) Type-constrained representation learning in knowledge graphs. In: The Semantic Web-ISWC 2015: 14th international semantic web conference, Bethlehem, PA, USA, October 11-15, 2015, Proceedings, Part I 14, pp. 640\u2013655 . Springer","DOI":"10.1007\/978-3-319-25007-6_37"},{"key":"2827_CR11","unstructured":"Bordes A, Usunier N, Garcia-Duran A, Weston J, Yakhnenko O (2013) Translating embeddings for modeling multi-relational data. Adv Neural Inf Process Syst 26"},{"key":"2827_CR12","doi-asserted-by":"crossref","unstructured":"Wang Z, Zhang J, Feng J, Chen Z (2014) Knowledge graph embedding by translating on hyperplanes. In: Proceedings of the AAAI conference on artificial intelligence, 28","DOI":"10.1609\/aaai.v28i1.8870"},{"key":"2827_CR13","unstructured":"Wen J, Li J, Mao Y, Chen S, Zhang R (2016) On the representation and embedding of knowledge bases beyond binary relations. arXiv preprint arXiv:1604.08642"},{"key":"2827_CR14","doi-asserted-by":"crossref","unstructured":"Fatemi B, Taslakian P, Vazquez D, Poole D (2019) Knowledge hypergraphs: prediction beyond binary relations. arXiv preprint arXiv:1906.00137","DOI":"10.24963\/ijcai.2020\/303"},{"key":"2827_CR15","doi-asserted-by":"crossref","unstructured":"Zhang R, Li J, Mei J, Mao Y (2018) Scalable instance reconstruction in knowledge bases via relatedness affiliated embedding. In: Proceedings of the 2018 World Wide Web Conference, pp 1185\u20131194","DOI":"10.1145\/3178876.3186017"},{"key":"2827_CR16","doi-asserted-by":"crossref","unstructured":"Guan S, Jin X, Wang Y, Cheng X (2019) Link prediction on n-ary relational data. In: The World Wide Web Conference, 583\u2013593","DOI":"10.1145\/3308558.3313414"},{"key":"2827_CR17","doi-asserted-by":"crossref","unstructured":"Rosso P, Yang D, Cudr\u00e9-Mauroux P (2020) Beyond triplets: hyper-relational knowledge graph embedding for link prediction. In: Proceedings of the Web Conference 2020, pp 1885\u20131896","DOI":"10.1145\/3366423.3380257"},{"key":"2827_CR18","doi-asserted-by":"crossref","unstructured":"Galkin M, Trivedi P, Maheshwari G, Usbeck R, Lehmann J (2020) Message passing for hyper-relational knowledge graphs. arXiv preprint arXiv:2009.10847","DOI":"10.18653\/v1\/2020.emnlp-main.596"},{"key":"2827_CR19","doi-asserted-by":"crossref","unstructured":"Guan S, Jin X, Guo J, Wang Y, Cheng, X (2020) Neuinfer: knowledge inference on n-ary facts. In: Proceedings of the 58th annual meeting of the association for computational linguistics, 6141\u20136151","DOI":"10.18653\/v1\/2020.acl-main.546"},{"issue":"11","key":"2827_CR20","doi-asserted-by":"publisher","first-page":"3799","DOI":"10.1007\/s13042-023-01865-y","volume":"14","author":"L Xiaonan","year":"2023","unstructured":"Xiaonan L, Bo N, Guanyu L, Jie W (2023) Relation-attention semantic-correlative knowledge graph embedding for inductive link prediction. Int J Mach Learn Cybern 14(11):3799\u20133811","journal-title":"Int J Mach Learn Cybern"},{"key":"2827_CR21","doi-asserted-by":"crossref","unstructured":"Yang X, Yan M, Pan S, Ye X, Fan D (2023) Simple and efficient heterogeneous graph neural network. In: Proceedings of the AAAI conference on artificial intelligence 37:10816\u201310824","DOI":"10.1609\/aaai.v37i9.26283"},{"key":"2827_CR22","doi-asserted-by":"publisher","first-page":"119982","DOI":"10.1016\/j.eswa.2023.119982","volume":"224","author":"Z Wang","year":"2023","unstructured":"Wang Z, Yu D, Li Q, Shen S, Yao S (2023) Sr-hgn: semantic-and relation-aware heterogeneous graph neural network. Expert Syst Appl 224:119982","journal-title":"Expert Syst Appl"},{"key":"2827_CR23","doi-asserted-by":"crossref","unstructured":"Luo H, Yang Y, Guo Y, Sun M, Yao T, Tang Z, Wan K, Song M, Lin W, et al. (2023) Hahe: Hierarchical attention for hyper-relational knowledge graphs in global and local level. arXiv preprint arXiv:2305.06588","DOI":"10.18653\/v1\/2023.acl-long.450"},{"issue":"10","key":"2827_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1140\/epjb\/s10051-024-00791-4","volume":"97","author":"Z Zhao","year":"2024","unstructured":"Zhao Z, Yang K, Guo J (2024) Heterogeneous hypergraph representation learning for link prediction. Eur Phys J B 97(10):1\u20139","journal-title":"Eur Phys J B"},{"key":"2827_CR25","doi-asserted-by":"publisher","first-page":"109818","DOI":"10.1016\/j.patcog.2023.109818","volume":"144","author":"Y Lu","year":"2023","unstructured":"Lu Y, Gao M, Liu H, Liu Z, Yu W, Li X, Jiao P (2023) Neighborhood overlap-aware heterogeneous hypergraph neural network for link prediction. Pattern Recogn 144:109818","journal-title":"Pattern Recogn"},{"issue":"8","key":"2827_CR26","first-page":"4125","volume":"44","author":"H Fan","year":"2021","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 44(8):4125\u20134138","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"2827_CR27","unstructured":"Yang B, Yih W-t, He X, Gao J, Deng L (2014) Embedding entities and relations for learning and inference in knowledge bases. arXiv preprint arXiv:1412.6575"},{"key":"2827_CR28","unstructured":"Kazemi SM, Poole D (2018) Simple embedding for link prediction in knowledge graphs. Adv Neural Inf Process Syst 31"},{"key":"2827_CR29","doi-asserted-by":"crossref","unstructured":"Bala\u017eevi\u0107 I, Allen C, Hospedales TM (2019) Tucker: tensor factorization for knowledge graph completion. arXiv preprint arXiv:1901.09590","DOI":"10.18653\/v1\/D19-1522"},{"key":"2827_CR30","doi-asserted-by":"crossref","unstructured":"Di S, Yao Q, Chen L (2021) Searching to sparsify tensor decomposition for n-ary relational data. In: Proceedings of the Web Conference 2021, pp 4043\u20134054","DOI":"10.1145\/3442381.3449853"},{"issue":"5","key":"2827_CR31","doi-asserted-by":"publisher","first-page":"1755","DOI":"10.1007\/s13042-023-01995-3","volume":"15","author":"Y Jin","year":"2024","unstructured":"Jin Y, Yang L (2024) Graph-aware tensor factorization convolutional network for knowledge graph completion. Int J Mach Learn Cybern 15(5):1755\u20131766","journal-title":"Int J Mach Learn Cybern"},{"key":"2827_CR32","unstructured":"Jing Y (2024) A relation-interactive approach for message passing in hyper-relational knowledge graphs. arXiv preprint arXiv:2402.15140"},{"key":"2827_CR33","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1016\/j.neucom.2022.04.026","volume":"492","author":"S Yan","year":"2022","unstructured":"Yan S, Zhang Z, Sun X, Xu G, Jin L, Li S (2022) Hyper2: hyperbolic embedding for hyper-relational link prediction. Neurocomputing 492:440\u2013451","journal-title":"Neurocomputing"},{"key":"2827_CR34","doi-asserted-by":"crossref","unstructured":"Xiong B, Nayyer M, Pan S, Staab S (2023) Shrinking embeddings for hyper-relational knowledge graphs. arXiv preprint arXiv:2306.02199","DOI":"10.18653\/v1\/2023.acl-long.743"},{"key":"2827_CR35","doi-asserted-by":"publisher","first-page":"128760","DOI":"10.1016\/j.neucom.2024.128760","volume":"614","author":"R Ma","year":"2025","unstructured":"Ma R, Gao B, Wang W, Wang L, Wang X, Zhao L (2025) Mhec: one-shot relational learning of knowledge graphs completion based on multi-hop information enhancement. Neurocomputing 614:128760","journal-title":"Neurocomputing"},{"key":"2827_CR36","unstructured":"Vaswani A (2017) Attention is all you need. Adv Neural Inf Process Syst"}],"container-title":["International Journal of Machine Learning and Cybernetics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-025-02827-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13042-025-02827-2","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-025-02827-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,9]],"date-time":"2026-02-09T09:37:39Z","timestamp":1770629859000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13042-025-02827-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1]]},"references-count":36,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,1]]}},"alternative-id":["2827"],"URL":"https:\/\/doi.org\/10.1007\/s13042-025-02827-2","relation":{},"ISSN":["1868-8071","1868-808X"],"issn-type":[{"value":"1868-8071","type":"print"},{"value":"1868-808X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1]]},"assertion":[{"value":"15 January 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 December 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 January 2026","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 no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"19"}}