{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T03:29:19Z","timestamp":1769743759738,"version":"3.49.0"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031446955","type":"print"},{"value":"9783031446962","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-44696-2_12","type":"book-chapter","created":{"date-parts":[[2023,10,7]],"date-time":"2023-10-07T09:03:59Z","timestamp":1696669439000},"page":"148-160","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Novel Semantic-Enhanced Time-Aware Model for\u00a0Temporal Knowledge Graph Completion"],"prefix":"10.1007","author":[{"given":"Yashen","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Li","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Meng","family":"Jian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yi","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoye","family":"Ouyang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,10,8]]},"reference":[{"key":"12_CR1","unstructured":"Bordes, A., Usunier, N., Garcia-Duran, A., Weston, J., Yakhnenko, O.: Translating embeddings for modeling multi-relational data. In: NIPS\u201913, pp. 2787\u20132795 (2013)"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Dasgupta, S.S., Ray, S.N., Talukdar, P.P.: Hyte: hyperplane-based temporally aware knowledge graph embedding. In: Conference on Empirical Methods in Natural Language Processing (2018)","DOI":"10.18653\/v1\/D18-1225"},{"key":"12_CR3","unstructured":"Ding, Z., Ma, Y., He, B., Tresp, V.: A simple but powerful graph encoder for temporal knowledge graph completion. arXiv abs\/2112.07791 (2022)"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Garc\u00eda-Dur\u00e1n, A., Dumancic, S., Niepert, M.: Learning sequence encoders for temporal knowledge graph completion. In: Conference on Empirical Methods in Natural Language Processing (2018)","DOI":"10.18653\/v1\/D18-1516"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Goel, R., Kazemi, S.M., Brubaker, M.A., Poupart, P.: Diachronic embedding for temporal knowledge graph completion. In: AAAI Conference on Artificial Intelligence (2019)","DOI":"10.1609\/aaai.v34i04.5815"},{"key":"12_CR6","unstructured":"Han, Z., Chen, P., Ma, Y., Tresp, V.: xerte: Explainable reasoning on temporal knowledge graphs for forecasting future links. arXiv abs\/2012.15537 (2020)"},{"issue":"7","key":"12_CR7","doi-asserted-by":"publisher","first-page":"1282","DOI":"10.1109\/TKDE.2017.2787709","volume":"30","author":"H Huang","year":"2018","unstructured":"Huang, H., Wang, Y., Feng, C., Liu, Z., Zhou, Q.: Leveraging conceptualization for short-text embedding. IEEE Trans. Knowl. Data Eng. 30(7), 1282\u20131295 (2018)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Jain, P., Rathi, S., Mausam, Chakrabarti, S.: Temporal knowledge base completion: new algorithms and evaluation protocols. arXiv abs\/2005.05035 (2020)","DOI":"10.18653\/v1\/2020.emnlp-main.305"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Jung, J., Jung, J., Kang, U.: Learning to walk across time for interpretable temporal knowledge graph completion. In: Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (2021)","DOI":"10.1145\/3447548.3467292"},{"key":"12_CR10","unstructured":"Kazemi, S.M., Poole, D.L.: Simple embedding for link prediction in knowledge graphs. arXiv abs\/1802.04868 (2018)"},{"key":"12_CR11","unstructured":"Lacroix, T., Obozinski, G., Usunier, N.: Tensor decompositions for temporal knowledge base completion. arXiv abs\/2004.04926 (2020)"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Leblay, J., Chekol, M.W.: Deriving validity time in knowledge graph. In: Companion Proceedings of the Web Conference 2018 (2018)","DOI":"10.1145\/3184558.3191639"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Nathani, D., Chauhan, J., Sharma, C., Kaul, M.: Learning attention-based embeddings for relation prediction in knowledge graphs. In: Annual Meeting of the Association for Computational Linguistics (2019)","DOI":"10.18653\/v1\/P19-1466"},{"key":"12_CR14","unstructured":"Trouillon, T., Welbl, J., Riedel, S., \u00c9ric Gaussier, Bouchard, G.: Complex embeddings for simple link prediction (2016)"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Wang, F., Wang, Z., Li, Z., Wen, J.R.: Concept-based short text classification and ranking. In: The ACM International Conference, pp. 1069\u20131078 (2014)","DOI":"10.1145\/2661829.2662067"},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"Wang, J., Zhu, C., Zhu, W.: Dynamic embedding graph attention networks for temporal knowledge graph completion. In: KSEM (2022)","DOI":"10.1007\/978-3-031-10983-6_55"},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"Wang, Y., Huang, H., Feng, C., Zhou, Q., Gu, J., Gao, X.: CSE: conceptual sentence embeddings based on attention model. In: 54th Annual Meeting of the Association for Computational Linguistics, pp. 505\u2013515 (2016)","DOI":"10.18653\/v1\/P16-1048"},{"key":"12_CR18","doi-asserted-by":"crossref","unstructured":"Wang, Y., Liu, Y., Zhang, H., Xie, H.: Leveraging lexical semantic information for learning concept-based multiple embedding representations for knowledge graph completion. In: APWeb\/WAIM (2019)","DOI":"10.1007\/978-3-030-26072-9_28"},{"key":"12_CR19","first-page":"1","volume":"17","author":"Y Wang","year":"2022","unstructured":"Wang, Y., Wang, Z., Zhang, H., Liu, Z.: Microblog retrieval based on concept-enhanced pre-training model. ACM Trans. Knowl. Discov. Data 17, 1\u201332 (2022)","journal-title":"ACM Trans. Knowl. Discov. Data"},{"key":"12_CR20","doi-asserted-by":"crossref","unstructured":"Wu, J., Cao, M., Cheung, J.C.K., Hamilton, W.L.: Temp: temporal message passing for temporal knowledge graph completion. arXiv abs\/2010.03526 (2020)","DOI":"10.18653\/v1\/2020.emnlp-main.462"},{"key":"12_CR21","doi-asserted-by":"crossref","unstructured":"Wu, W., Li, H., Wang, H., Zhu, K.Q.: Probase: a probabilistic taxonomy for text understanding. In: ACM SIGMOD International Conference on Management of Data, pp. 481\u2013492 (2012)","DOI":"10.1145\/2213836.2213891"},{"key":"12_CR22","doi-asserted-by":"crossref","unstructured":"Xu, C., Chen, Y.Y., Nayyeri, M., Lehmann, J.: Temporal knowledge graph completion using a linear temporal regularizer and multivector embeddings. In: North American Chapter of the Association for Computational Linguistics (2021)","DOI":"10.18653\/v1\/2021.naacl-main.202"},{"key":"12_CR23","unstructured":"Xu, C., Nayyeri, M., Alkhoury, F., Lehmann, J., Yazdi, H.S.: Temporal knowledge graph embedding model based on additive time series decomposition. arXiv abs\/1911.07893 (2019)"},{"key":"12_CR24","doi-asserted-by":"crossref","unstructured":"Xu, C., Nayyeri, M., Alkhoury, F., Yazdi, H.S., Lehmann, J.: Tero: a time-aware knowledge graph embedding via temporal rotation. In: International Conference on Computational Linguistics (2020)","DOI":"10.18653\/v1\/2020.coling-main.139"},{"key":"12_CR25","unstructured":"Yang, B., tau Yih, W., He, X., Gao, J., Deng, L.: Embedding entities and relations for learning and inference in knowledge bases. CoRR abs\/1412.6575 (2014)"}],"container-title":["Lecture Notes in Computer Science","Natural Language Processing and Chinese Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-44696-2_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,7]],"date-time":"2023-10-07T09:05:45Z","timestamp":1696669545000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-44696-2_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031446955","9783031446962"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-44696-2_12","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":"8 October 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NLPCC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"CCF International Conference on Natural Language Processing and Chinese Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Foshan","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":"12 October 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 October 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"nlpcc2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/tcci.ccf.org.cn\/conference\/2023\/index.php","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":"Softconf","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"478","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":"143","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":"30% - 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":"4","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)"}}]}}