{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T19:24:03Z","timestamp":1775676243996,"version":"3.50.1"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031306716","type":"print"},{"value":"9783031306723","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-30672-3_51","type":"book-chapter","created":{"date-parts":[[2023,4,13]],"date-time":"2023-04-13T11:10:49Z","timestamp":1681384249000},"page":"758-767","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Improving Hyper-relational Knowledge Graph Representation with\u00a0Multi-grained Encoding"],"prefix":"10.1007","author":[{"given":"Ting","family":"Ma","sequence":"first","affiliation":[]},{"given":"Longtao","family":"Huang","sequence":"additional","affiliation":[]},{"given":"Hui","family":"Xue","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,4,14]]},"reference":[{"key":"51_CR1","doi-asserted-by":"crossref","unstructured":"Balazevic, I., Allen, C., Hospedales, T.M.: Hypernetwork knowledge graph embeddings. In: Proceedings of the ICANN, vol. 11731, pp. 553\u2013565 (2019)","DOI":"10.1007\/978-3-030-30493-5_52"},{"key":"51_CR2","doi-asserted-by":"crossref","unstructured":"Balazevic, I., Allen, C., Hospedales, T.M.: Tucker: Tensor factorization for knowledge graph completion. In: Proceedings of the EMNLP-IJCNLP, pp. 5184\u20135193 (2019)","DOI":"10.18653\/v1\/D19-1522"},{"key":"51_CR3","unstructured":"Bordes, A., Usunier, N., Garcia-Duran, A., Weston, J., Yakhnenko, O.: Translating embeddings for modeling multi-relational data. In: Proceedings of the NeurIPS, pp. 2787\u20132795 (2013)"},{"key":"51_CR4","doi-asserted-by":"crossref","unstructured":"Chami, I., Wolf, A., Juan, D.C., Sala, F., Ravi, S., Re, C.: Low-dimensional hyperbolic knowledge graph embeddings. In: Proceedings of the ACL, pp. 6901\u20136914 (2020)","DOI":"10.18653\/v1\/2020.acl-main.617"},{"key":"51_CR5","doi-asserted-by":"crossref","unstructured":"Dettmers, T., Minervini, P., Stenetorp, P., Riedel, S.: Convolutional 2d knowledge graph embeddings. In: Proceedings of the AAAI (2018)","DOI":"10.1609\/aaai.v32i1.11573"},{"key":"51_CR6","doi-asserted-by":"crossref","unstructured":"Ebisu, T., Ichise, R.: Toruse: Knowledge graph embedding on a lie group. In: AAAI (2018)","DOI":"10.1609\/aaai.v32i1.11538"},{"key":"51_CR7","doi-asserted-by":"crossref","unstructured":"Galkin, M., Trivedi, P., Maheshwari, G., Usbeck, R., Lehmann, J.: Message passing for hyper-relational knowledge graphs. In: Proceedings of the EMNLP, pp. 7346\u20137359 (2020)","DOI":"10.18653\/v1\/2020.emnlp-main.596"},{"key":"51_CR8","doi-asserted-by":"crossref","unstructured":"Guan, S., Jin, X., Guo, J., Wang, Y., Cheng, X.: Neuinfer: Knowledge inference on n-ary facts. In: Proceedings of the ACL, pp. 6141\u20136151 (2020)","DOI":"10.18653\/v1\/2020.acl-main.546"},{"key":"51_CR9","doi-asserted-by":"crossref","unstructured":"Guan, S., Jin, X., Wang, Y., Cheng, X.: Link prediction on n-ary relational data. In: Proceedings of the WWW, pp. 583\u2013593 (2019)","DOI":"10.1145\/3308558.3313414"},{"key":"51_CR10","doi-asserted-by":"crossref","unstructured":"Hu, Z., Cao, Y., Huang, L., Chua, T.: How knowledge graph and attention help? A qualitative analysis into bag-level relation extraction. In: Proceedings of the ACL\/IJCNLP, pp. 4662\u20134671 (2021)","DOI":"10.18653\/v1\/2021.acl-long.359"},{"key":"51_CR11","unstructured":"Kazemi, S.M., Poole, D.: Simple embedding for link prediction in knowledge graphs. In: Proceedings of the NeurIPS, pp. 4284\u20134295 (2018)"},{"key":"51_CR12","unstructured":"Kingma, D., Jimmy, B.: Adam: A method for stochastic optimization. Comput. Sci. (2014)"},{"key":"51_CR13","doi-asserted-by":"crossref","unstructured":"Kolyvakis, P., Kalousis, A., Kiritsis, D.: Hyperkg: Hyperbolic knowledge graph embeddings for knowledge base completion. In: arXiv (2019)","DOI":"10.1007\/978-3-030-49461-2_12"},{"key":"51_CR14","doi-asserted-by":"crossref","unstructured":"Nadgeri, A., et al.: Kgpool: Dynamic knowledge graph context selection for relation extraction. In: Proceedings of the ACL\/IJCNLP (Findings), pp. 535\u2013548 (2021)","DOI":"10.18653\/v1\/2021.findings-acl.48"},{"key":"51_CR15","unstructured":"Naseem, T., et al.: A semantics-aware transformer model of relation linking for knowledge base question answering. In: Proceedings of the ACL\/IJCNLP, pp. 256\u2013262 (2021)"},{"key":"51_CR16","unstructured":"Nayyeri, M., Xu, C., Yaghoobzadeh, Y., Yazdi, H.S., Lehmann, J.: Toward understanding the effect of loss function on then performance of knowledge graph embedding. In: arXiv (2019)"},{"key":"51_CR17","doi-asserted-by":"crossref","unstructured":"Nguyen, D.Q., Nguyen, T.D., Nguyen, D.Q., Phung, D.: A novel embedding model for knowledge base completion based on convolutional neural network. In: Proceedings of the NAACL, pp. 327\u2013333 (2018)","DOI":"10.18653\/v1\/N18-2053"},{"key":"51_CR18","unstructured":"Nickel, Tresp, Kriegel: A three-way model for collective learning on multi-relational data. In: Proceedings of the ICML, pp. 809\u2013816 (2011)"},{"key":"51_CR19","doi-asserted-by":"crossref","unstructured":"Rosso, P., Yang, D., Cudr\u00e9-Mauroux, P.: Beyond triplets: Hyper-relational knowledge graph embedding for link prediction. In: Proceedings of the WWW, pp. 1885\u20131896 (2020)","DOI":"10.1145\/3366423.3380257"},{"key":"51_CR20","doi-asserted-by":"publisher","unstructured":"Schlichtkrull, M., Kipf, T.N., Bloem, P., van\u00a0den Berg, R., Titov, I., Welling, M.: Modeling relational data with graph convolutional networks. In: Gangemi, A., et al. (eds.) ESWC 2018. LNCS, vol. 10843, pp. 593\u2013607. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-93417-4_38","DOI":"10.1007\/978-3-319-93417-4_38"},{"key":"51_CR21","doi-asserted-by":"crossref","unstructured":"Sun, Z., Huang, J., Hu, W., Chen, M., Guo, L., Qu, Y.: Transedge: Translating relation-contextualized embeddings for knowledge graphs. In: Proceedings of the ISWC, pp. 612\u2013629 (2019)","DOI":"10.1007\/978-3-030-30793-6_35"},{"key":"51_CR22","unstructured":"Sun, Z., Deng, Z.H., Nie, J.Y., Tang, J.: Rotate: Knowledge graph embedding by relational rotation in complex space. In: Proceedings of the ICLR (2019)"},{"key":"51_CR23","doi-asserted-by":"crossref","unstructured":"Vashishth, S., Sanyal, S., Nitin, V., Agrawal, N., Talukdar, P.P.: Interacte: Improving convolution-based knowledge graph embeddings by increasing feature interactions. In: Proceedings of the AAAI, pp. 3009\u20133016 (2020)","DOI":"10.1609\/aaai.v34i03.5694"},{"key":"51_CR24","unstructured":"Vashishth, S., Sanyal, S., Nitin, V., Talukdar, P.P.: Composition-based multi-relational graph convolutional networks. In: Proceedings of the ICLR (2020)"},{"key":"51_CR25","unstructured":"Wen, J., Li, J., Mao, Y., Chen, S., Zhang, R.: On the representation and embedding of knowledge bases beyond binary relations. In: Proceedings of the IJCAI, pp. 1300\u20131307 (2016)"},{"key":"51_CR26","unstructured":"Yang, B., Tau Yih, W., He, X., Gao, J., Deng, L.: Embedding entities and relations for learning and inference in knowledge bases. In: Proceedings of the ICLR (2015)"},{"key":"51_CR27","doi-asserted-by":"crossref","unstructured":"Yasunaga, M., Ren, H., Bosselut, A., Liang, P., Leskovec, J.: QA-GNN: Reasoning with language models and knowledge graphs for question answering. In: Proceedings of the NAACL-HLT, pp. 535\u2013546 (2021)","DOI":"10.18653\/v1\/2021.naacl-main.45"},{"key":"51_CR28","unstructured":"Yu, D., Yang, Y.: Improving hyper-relational knowledge graph completion. Arxiv (2021)"},{"key":"51_CR29","doi-asserted-by":"crossref","unstructured":"Zhang, R., Li, J., Mei, J., Mao, Y.: Scalable instance reconstruction in knowledge bases via relatedness affiliated embedding. In: Proceedings of the WWW, pp. 1185\u20131194 (2018)","DOI":"10.1145\/3178876.3186017"},{"key":"51_CR30","doi-asserted-by":"crossref","unstructured":"Zhang, W., Paudel, B., Wang, L.: Iteratively learning embeddings and rules for knowledge graph reasoning. In: Proceedings of the WWW, pp. 2366\u20132377 (2019)","DOI":"10.1145\/3308558.3313612"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-30672-3_51","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T17:33:54Z","timestamp":1710264834000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-30672-3_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031306716","9783031306723"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-30672-3_51","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":"14 April 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DASFAA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Database Systems for Advanced Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tianjin","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":"17 April 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 April 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dasfaa2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.tjudb.cn\/dasfaa2023\/","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":"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":"652","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":"125","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":"66","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":"19% - 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":"3","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":"7.3","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)"}}]}}