{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T10:13:54Z","timestamp":1781086434616,"version":"3.54.1"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031466632","type":"print"},{"value":"9783031466649","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-46664-9_6","type":"book-chapter","created":{"date-parts":[[2023,11,4]],"date-time":"2023-11-04T13:02:29Z","timestamp":1699102949000},"page":"78-90","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Two Birds with\u00a0One Stone: A Link Prediction Model for\u00a0Knowledge Hypergraph Based on\u00a0Fully-Connected Tensor Decomposition"],"prefix":"10.1007","author":[{"given":"Jun","family":"Pang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hong-Chao","family":"Qin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yan","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiao-Qi","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,11,5]]},"reference":[{"key":"6_CR1","unstructured":"Wen, J.F., Li, J.X., Mao, Y.Y., et al.: On the representation and embedding of knowledge bases beyond binary relations. In: Twenty-Fifth International Joint Conference on Artificial Intelligence (IJCAI), pp. 1300\u20131307 (2016)"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Almousa, M., Benlamri, R., Khoury, R.: A novel word sense disambiguation approach using wordnet knowledge graph. arXiv preprint arXiv:2101.02875 (2021)","DOI":"10.1016\/j.csl.2021.101337"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Dai, Z., Li, L., Xu, W.: CFO: conditional focused neural question answering with largescale knowledge bases. In: 54th Annual Meeting of the Association for Computational Linguistics (ACL), pp. 800\u2013810 (2016)","DOI":"10.18653\/v1\/P16-1076"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Chen, Y., Wu, L., Zaki, M.J.: Bidirectional attentive memory networks for question answering over knowledge bases. In: ACL, pp. 2913\u20132923 (2019)","DOI":"10.18653\/v1\/N19-1299"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Ji, S., Feng, Y., Ji, R., et al.: Dual channel hypergraph collaborative filtering. In: 26th ACM International Conference on Knowledge Discovery and Data Mining (SIGKDD), pp. 2020\u20132029 (2020)","DOI":"10.1145\/3394486.3403253"},{"key":"6_CR6","unstructured":"Yu, W., Qin, Z.: Graph convolutional network for recommendation with low-pass collaborative filters. In: International Conference on Machine Learning (ICML), pp. 10936\u201310945 (2020)"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Liu, Y., Yao, Q.M., Li, Y.: Generalizing tensor decomposition for N-ary relational knowledge bases. In: 29th International World Wide Web Conferences (WWW), pp. 1104\u20131114 (2020)","DOI":"10.1145\/3366423.3380188"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Balaevi, I., Allen, C., Hospedales, T.M.: TuckER: tensor factorization for knowledge graph completion. In: ICML, pp. 5184\u20135193 (2019)","DOI":"10.18653\/v1\/D19-1522"},{"key":"6_CR9","unstructured":"Zhao, QB., Zhou, G.X., Xie, S.L., et al.: Tensor ring decomposition. arXiv preprint arXiv:1606.05535 (2016)"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Zheng, Y.B., Huang, T.Z., Zhao, X.L., et al.: Fully-connected tensor network decomposition and its application to higher-order tensor completion. In: AAAI, vol. 35(12), pp. 11071\u201311078 (2021)","DOI":"10.1609\/aaai.v35i12.17321"},{"key":"6_CR11","unstructured":"Bordes, A., Usunier, N., Garcia-Duran, A., et al.: Translating embeddings for modeling multi-relational data. In: 27th Annual Conference on Neural Information Processing Systems (NIPS), pp. 2787\u20132795 (2013)"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Zhang, R.C., Li, J.P., Mei, J.J., et al.: Scalable instance reconstruction in knowledge bases via relatedness affiliated embedding. In: WWW, pp. 1185\u20131194 (2018)","DOI":"10.1145\/3178876.3186017"},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"Guan, S.P., Jin, X.L., Wang, Y.Z., et al.: Link prediction on N-ary relational data. In: WWW, pp. 583\u2013593 (2019)","DOI":"10.1145\/3308558.3313414"},{"key":"6_CR14","unstructured":"Kazemi, S.M., Poole, D.: Simple embedding for link prediction in knowledge graphs. In: NIPS, pp. 4289\u20134300 (2018)"},{"key":"6_CR15","unstructured":"Trouillon, T., Welbl, J., Riedel, S., et al.: Complex embeddings for simple link prediction. In: ICML, pp. 2071\u20132080 (2016)"},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"Guan, S.P., Jin, X.L., Guo, J.F., et al.: Link prediction on n-ary relational data based on relatedness evaluation. IEEE Trans. Knowl. Data Eng. (TKDE) 35(1), 672\u2013685 (2023)","DOI":"10.1109\/TKDE.2021.3073483"},{"key":"6_CR17","doi-asserted-by":"crossref","unstructured":"Nguyen, D.Q., Nguyen, T.D., Dat, Q.N., et al.: A novel embedding model for knowledge base completion based on convolutional neural network. In: ACL, pp. 327\u2013333 (2018)","DOI":"10.18653\/v1\/N18-2053"},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"Dettmers, T., Minervini, P., Stenetorp, P., et al.: Convolutional 2D knowledge graph embeddings. In: AAAI, pp. 1811\u20131818 (2018)","DOI":"10.1609\/aaai.v32i1.11573"},{"key":"6_CR19","doi-asserted-by":"crossref","unstructured":"Chen, Z., Wang, X., Wang, C., et al.: Explainable link prediction in knowledge hypergraphs. In: 31st ACM International Conference on Information and Knowledge Management (CIKM), pp. 262\u2013271 (2020)","DOI":"10.1145\/3511808.3557316"},{"key":"6_CR20","doi-asserted-by":"crossref","unstructured":"Gao, Y., Tian, X., Zhou, J., et al.: Knowledge graph embedding based on quaternion transformation and convolutional neural network. In: 17th International Conference on Advanced Data Mining and Applications (ADMA), pp. 128\u2013136 (2021)","DOI":"10.1007\/978-3-030-95408-6_10"},{"key":"6_CR21","doi-asserted-by":"crossref","unstructured":"Hou, R., Zhu, W., Zhu, C.: Global relation auxiliary graph attention network for knowledge graph completion. In: 5th International Conference on Artificial Intelligence and Big Data (ICAIBD), pp. 532\u2013538 (2022)","DOI":"10.1109\/ICAIBD55127.2022.9820227"},{"issue":"4","key":"6_CR22","doi-asserted-by":"publisher","first-page":"959","DOI":"10.3233\/IDA-216007","volume":"26","author":"YW Xu","year":"2022","unstructured":"Xu, Y.W., Zhang, H.J., Cheng, K., et al.: Knowledge graph embedding with entity attributes using hypergraph neural networks. Intell. Data Anal. 26(4), 959\u2013975 (2022)","journal-title":"Intell. Data Anal."},{"issue":"2","key":"6_CR23","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s10994-013-5363-6","volume":"94","author":"A Bordes","year":"2013","unstructured":"Bordes, A., Glorot, X., Weston, J., Bengio, Y.: A semantic matching energy function for learning with multi-relational data. Mach. Learn. 94(2), 233\u2013259 (2013). https:\/\/doi.org\/10.1007\/s10994-013-5363-6","journal-title":"Mach. Learn."},{"key":"6_CR24","unstructured":"Antoine, B., Nicolas, U., Alberto, G.D., et al.: Irreflexive and hierarchical relations as translations. arXiv preprint arXiv:1304.7158 (2013)"},{"key":"6_CR25","unstructured":"Yang, B.S., Yih, W.T., He, X.D., et al.: Embedding entities and relations for learning and inference in knowledge bases. In: International Conference on Learning Representations (ICLR) (2015)"}],"container-title":["Lecture Notes in Computer Science","Advanced Data Mining and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-46664-9_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,1]],"date-time":"2024-11-01T11:08:57Z","timestamp":1730459337000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-46664-9_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031466632","9783031466649"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-46664-9_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"5 November 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ADMA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Advanced Data Mining and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shenyang","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 August 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 August 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"adma2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/adma2023.uqcloud.net\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes. Microsoft CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"503","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"216","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"43% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.97","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.77","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}