{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,16]],"date-time":"2026-06-16T04:29:38Z","timestamp":1781584178409,"version":"3.54.5"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,5,5]],"date-time":"2023-05-05T00:00:00Z","timestamp":1683244800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,5,5]],"date-time":"2023-05-05T00:00:00Z","timestamp":1683244800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key R &D Program of China","doi-asserted-by":"crossref","award":["2020AAA0108504"],"award-info":[{"award-number":["2020AAA0108504"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61972275"],"award-info":[{"award-number":["61972275"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Sci. Eng."],"published-print":{"date-parts":[[2023,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Link prediction in knowledge hypergraphs is essential for various knowledge-based applications, including question answering and recommendation systems. However, many current approaches simply extend binary relation methods from knowledge graphs to <jats:italic>n<\/jats:italic>-ary relations, which does not allow for capturing entity positional and role information in <jats:italic>n<\/jats:italic>-ary tuples. To address this issue, we introduce PosKHG, a method that considers entities\u2019 positions and roles within <jats:italic>n<\/jats:italic>-ary tuples. PosKHG uses an embedding space with basis vectors to represent entities\u2019 positional and role information through a linear combination, which allows for similar representations of entities with related roles and positions. Additionally, PosKHG employs a relation matrix to capture the compatibility of both information with all associated entities and a scoring function to measure the plausibility of tuples made up of entities with specific roles and positions. PosKHG achieves full expressiveness and high prediction efficiency. In experimental results, PosKHG achieved an average improvement of 4.1% on MRR compared to other state-of-the-art knowledge hypergraph embedding methods. Our code is available at <jats:ext-link xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" ext-link-type=\"uri\" xlink:href=\"https:\/\/anonymous.4open.science\/r\/PosKHG-C5B3\/\">https:\/\/anonymous.4open.science\/r\/PosKHG-C5B3\/<\/jats:ext-link>.<\/jats:p>","DOI":"10.1007\/s41019-023-00214-x","type":"journal-article","created":{"date-parts":[[2023,5,5]],"date-time":"2023-05-05T15:01:29Z","timestamp":1683298889000},"page":"135-145","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["PosKHG: A Position-Aware Knowledge Hypergraph Model for Link Prediction"],"prefix":"10.1007","volume":"8","author":[{"given":"Zirui","family":"Chen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9651-0651","authenticated-orcid":false,"given":"Xin","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chenxu","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhao","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,5,5]]},"reference":[{"key":"214_CR1","unstructured":"Bahare F, Perouz T, David V, Poole D (2020) Knowledge hypergraphs, prediction beyond binary relations In: IJCAI"},{"key":"214_CR2","doi-asserted-by":"crossref","unstructured":"Balazevic I, Allen C, Hospedales T (2019). TuckER: tensor factorization for knowledge graph completion. In: EMNLP, pp 5188\u20135197","DOI":"10.18653\/v1\/D19-1522"},{"key":"214_CR3","unstructured":"Bordes A, Usunier N, Garcia-Duran A, Weston J, Yakhnenko O (2013) Translating embeddings for modeling multi-relational data. In: NeurIPS"},{"key":"214_CR4","unstructured":"Bordes A, Usunier N, GarciaDuran A, Weston J, Yakhnenko O (2013) Translating embeddings for modeling multirelational data. In: Proceedings of the 26th international conference on neural information processing systems, pp 2787\u20132795"},{"issue":"8","key":"214_CR5","doi-asserted-by":"publisher","first-page":"6894","DOI":"10.1609\/aaai.v35i8.16850","volume":"35","author":"Z Cao","year":"2021","unstructured":"Cao Z, Xu Q, Yang Z, Cao X, Huang Q (2021) Dual quaternion knowledge graph embeddings. In: Proceedings of the AAAI conference on artificial intelligence 35(8):6894\u20136902","journal-title":"Proceedings of the AAAI conference on artificial intelligence"},{"key":"214_CR6","unstructured":"Chen Y, Minervini P, Riedel S, Stenetorp P (2021) Relation prediction as an auxiliary training objective for improving multi-relational graph representations. arXiv preprint arXiv:2110.02834"},{"key":"214_CR7","doi-asserted-by":"crossref","unstructured":"Ding B, Wang Q, Wang B, Guo L (2018) Improving knowledge graph embedding using simple constraints. In: Proceedings of the 56th annual meeting of the association for computational linguistics, pp 110\u2013121","DOI":"10.18653\/v1\/P18-1011"},{"key":"214_CR8","doi-asserted-by":"crossref","unstructured":"Ebisu T, Ichise R (2018) TorusE: knowledge graph embedding on a lie group. In: Proceedings of the 32nd AAAI conference on artificial intelligence, pp 1819-1826","DOI":"10.1609\/aaai.v32i1.11538"},{"key":"214_CR9","doi-asserted-by":"crossref","unstructured":"Guan S, Jin X, Wang Y, Cheng X (2019) Link prediction on n-ary relational data. In: Proceedings of the 2019 world wide web conference, pp 583\u2013593","DOI":"10.1145\/3308558.3313414"},{"key":"214_CR10","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, pp 6141\u20136151","DOI":"10.18653\/v1\/2020.acl-main.546"},{"key":"214_CR11","unstructured":"Kazemi SM, Poole D (2018) SimplE embedding for link prediction in knowledge graphs. In: NeurIPS"},{"key":"214_CR12","unstructured":"Lacroix T, Usunier N, Obozinski G (2018) Canonical tensor decomposition for knowledge base completion. In: ICML"},{"key":"214_CR13","doi-asserted-by":"crossref","unstructured":"Lin Y, Liu Z, Sun M, Liu Y, Zhu X (2015b) Learning entity and relation embeddings for knowledge graph completion. In: Proceedings of the 29th AAAI conference on artificial intelligence, pp 2181\u20132187","DOI":"10.1609\/aaai.v29i1.9491"},{"key":"214_CR14","doi-asserted-by":"crossref","unstructured":"Liu Y, Yao Q, Li Y (2021) Roleaware modeling for n-ary relational knowledge bases. arXiv preprint arXiv:2104.09780","DOI":"10.1145\/3442381.3449874"},{"key":"214_CR15","doi-asserted-by":"crossref","unstructured":"Nathani D, Chauhan J, Sharma C, Kaul M (2019) Learning attention-based embeddings for relation prediction in knowledge graphs. In: Proceedings of the 57th annual meeting of the association for computational linguistics, pp 4710\u20134723, Florence, Italy","DOI":"10.18653\/v1\/P19-1466"},{"key":"214_CR16","doi-asserted-by":"crossref","unstructured":"Nguyen DQ, Nguyen TD, Nguyen DQ, Phung D (2018) A novel embedding model for knowledge base completion based on convolutional neural network. In: Proceedings of the 16th annual conference of the north American chapter of the association for computational linguistics: human language technologies, pp 327\u2013333","DOI":"10.18653\/v1\/N18-2053"},{"key":"214_CR17","unstructured":"Nickel M, Tresp V, Kriegel H-P (2011) A three-way model for collective learning on multi-relational data. In: Proceedings of the 28th international conference on machine learning, pp 809\u2013816"},{"key":"214_CR18","unstructured":"Paolo R, Dingqi Y, Philippe C (2020) Beyond triplets: hyper-relational knowledge graph embedding for link prediction. In: Proceedings of the web conference 2020, pp 1885\u20131896"},{"issue":"2","key":"214_CR19","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s41019-021-00155-3","volume":"6","author":"Y Peng","year":"2021","unstructured":"Peng Y, Choi B, Xu J (2021) Graph learning for combinatorial optimization: a survey of state-of-the-art. Data Sci. Eng. 6(2):119\u2013141","journal-title":"Data Sci. Eng."},{"issue":"2","key":"214_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3424672","volume":"15","author":"A Rossi","year":"2021","unstructured":"Rossi A, Barbosa D, Firmani D, Matinata A, Merialdo P (2021) Knowledge graph embedding for link prediction: a comparative analysis. ACM Trans. Knowl. Discov. Data 15(2):1-49","journal-title":"ACM Trans. Knowl. Discov. Data"},{"key":"214_CR21","unstructured":"Sun Z, Deng Z-H, Nie J-Y, Tang J (2019) RotatE: knowledge graph embedding by relational rotation in complex space. In: ICLR, Article 14."},{"key":"214_CR22","unstructured":"Tran HN, Takasu A (2019) Analyzing knowledge graph embedding methods from a multi-embedding interaction perspective. arXiv preprint arXiv:1903.11406 (2019)"},{"key":"214_CR23","unstructured":"Trouillon T, Welbl J, Riedel S, Gaussier E, Bouchard G (2016) Complex embeddings for simple link prediction. In: Proceedings of the 33rd international conference on machine learning, pp 2071-2080"},{"key":"214_CR24","doi-asserted-by":"crossref","unstructured":"Wang Q, Mao Z, Wang B, Guo L (2017) Knowledge graph embedding: a survey of approaches and applications. TKDE 29, 12, pp 2724\u20132743","DOI":"10.1109\/TKDE.2017.2754499"},{"key":"214_CR25","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 28th AAAI conference on artificial intelligence, pp 1112\u20131119","DOI":"10.1609\/aaai.v28i1.8870"},{"issue":"4","key":"214_CR26","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/s41019-020-00140-2","volume":"5","author":"J Wawrzinek","year":"2020","unstructured":"Wawrzinek J, Pinto JMG, Wiehr O et al (2020) Exploiting latent semantic subspaces to derive associations for specific pharmaceutical semantics. Data Sci. Eng. 5(4):333\u2013345","journal-title":"Data Sci. Eng."},{"key":"214_CR27","unstructured":"Wen J, Li J, Mao Y, Chen S, Zhang R (2016) On the representation and embedding of knowledge bases beyond binary relations. In: Proceedings of the twenty-fifth international joint conference on artificial intelligence, pp 1300\u20131307"},{"issue":"4","key":"214_CR28","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/s41019-020-00135-z","volume":"5","author":"S Wu","year":"2020","unstructured":"Wu S, Zhang Y, Gao C et al (2020) GARG: anonymous recommendation of point-of-interest in mobile networks by graph convolution network. Data Sci Eng 5(4):433\u2013447","journal-title":"Data Sci. Eng."},{"key":"214_CR29","doi-asserted-by":"crossref","unstructured":"Xiao H, Huang M, Zhu X (2016) TransG: a generative model for knowledge graph embedding. In: Proceedings of the 54th annual meeting of the association for computational linguistics, pp 2316\u20132325","DOI":"10.18653\/v1\/P16-1219"},{"key":"214_CR30","unstructured":"Yu L, Quanming Y, Yong L (2020) Generalizing tensor decomposition for n-ary relational knowledge bases. In: Proceedings of the web conference 2020, pp 1104\u20131114"},{"issue":"03","key":"214_CR31","doi-asserted-by":"publisher","first-page":"3065","DOI":"10.1609\/aaai.v34i03.5701","volume":"34","author":"Z Zhang","year":"2020","unstructured":"Zhang Z, Cai J, Zhang Y, Wang J (2020) Learning hierarchy-aware knowledge graph embeddings for link prediction. In: Proceedings of the AAAI conference on artificial intelligence 34(03):3065\u20133072","journal-title":"Proceedings of the AAAI conference on artificial intelligence"},{"key":"214_CR32","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":"214_CR33","doi-asserted-by":"crossref","unstructured":"Zhang F, Wang X, Li Z, Li J (2021) Transrhs: a representation learning method for knowledge graphs with relation hierarchical structure. In: Proceedings of the twenty-ninth international conference on international joint conferences on artificial intelligence, pp. 2987\u20132993","DOI":"10.24963\/ijcai.2020\/413"},{"key":"214_CR34","doi-asserted-by":"crossref","unstructured":"Zhang Y, Yao Q, Dai W, Chen L (2020) AutoSF: searching scoring functions for knowledge graph embedding. In: 2020 IEEE 36th international conference on data engineering (ICDE). IEEE, pp 433\u2013444","DOI":"10.1109\/ICDE48307.2020.00044"},{"issue":"3","key":"214_CR35","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/s41019-021-00162-4","volume":"6","author":"M Zhu","year":"2021","unstructured":"Zhu M, Shen D, Xu L et al (2021) Scalable multi-grained cross-modal similarity query with interpretability. Data Sci Eng 6(3):280\u2013293","journal-title":"Data Sci. Eng."}],"container-title":["Data Science and Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41019-023-00214-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s41019-023-00214-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41019-023-00214-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,15]],"date-time":"2023-05-15T14:49:08Z","timestamp":1684162148000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s41019-023-00214-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,5]]},"references-count":35,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,6]]}},"alternative-id":["214"],"URL":"https:\/\/doi.org\/10.1007\/s41019-023-00214-x","relation":{},"ISSN":["2364-1185","2364-1541"],"issn-type":[{"value":"2364-1185","type":"print"},{"value":"2364-1541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,5,5]]},"assertion":[{"value":"22 December 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 March 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 April 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 May 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no conflicts of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval"}},{"value":"All authors agreed to participate.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to participate"}}]}}