{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,20]],"date-time":"2025-06-20T04:09:27Z","timestamp":1750392567957,"version":"3.41.0"},"publisher-location":"Singapore","reference-count":21,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819681822","type":"print"},{"value":"9789819681839","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-981-96-8183-9_18","type":"book-chapter","created":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T17:38:41Z","timestamp":1750354721000},"page":"218-231","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Rule-Validated Negative Sampling for\u00a0Temporal Knowledge Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3541-9031","authenticated-orcid":false,"given":"Naimeng","family":"Yao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7895-9551","authenticated-orcid":false,"given":"Qing","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1214-6317","authenticated-orcid":false,"given":"Quan","family":"Bai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,6,20]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Ahrabian, K., Feizi, A., Salehi, Y., Hamilton, W.L., Bose, A.J.: Structure aware negative sampling in knowledge graphs. In: Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing, pp. 6093\u20136101 (2020)","DOI":"10.18653\/v1\/2020.emnlp-main.492"},{"key":"18_CR2","unstructured":"Bordes, A., Usunier, N., Garcia-Duran, A., Weston, J., Yakhnenko, O.: Translating embeddings for modeling multi-relational data. Adv. Neural Inf. Process. Syst. 26 (2013)"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Chen, J., Ren, J., Ding, W., Qu, Y.: PaTeCon: a pattern-based temporal constraint mining method for conflict detection on knowledge graphs. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol.\u00a037, pp. 4166\u20134172 (2023)","DOI":"10.1609\/aaai.v37i4.25533"},{"issue":"3","key":"18_CR4","doi-asserted-by":"publisher","DOI":"10.1016\/j.joi.2020.101057","volume":"14","author":"N Choudhury","year":"2020","unstructured":"Choudhury, N., Faisal, F., Khushi, M.: Mining temporal evolution of knowledge graphs and genealogical features for literature-based discovery prediction. J. Informet. 14(3), 101057 (2020)","journal-title":"J. Informet."},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"Dasgupta, S.S., Ray, S.N., Talukdar, P.: HyTE: hyperplane-based temporally aware knowledge graph embedding. In: Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing, pp. 2001\u20132011 (2018)","DOI":"10.18653\/v1\/D18-1225"},{"key":"18_CR6","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2024.104085","volume":"329","author":"H Dong","year":"2024","unstructured":"Dong, H., Wang, P., Xiao, M., Ning, Z., Wang, P., Zhou, Y.: Temporal inductive path neural network for temporal knowledge graph reasoning. Artif. Intell. 329, 104085 (2024)","journal-title":"Artif. Intell."},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Goel, R., Kazemi, S.M., Brubaker, M., Poupart, P.: Diachronic embedding for temporal knowledge graph completion. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol.\u00a034, pp. 3988\u20133995 (2020)","DOI":"10.1609\/aaai.v34i04.5815"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Huang, R., Wei, W., Qu, X., Zhang, S., Chen, D., Cheng, Y.: Confidence is not timeless: modeling temporal validity for rule-based temporal knowledge graph forecasting. In: Proceedings of the 62nd Annual Meeting of the Association for Computational Linguistics, pp. 10783\u201310794 (2024)","DOI":"10.18653\/v1\/2024.acl-long.580"},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"Jin, W., Qu, M., Jin, X., Ren, X.: Recurrent event network: autoregressive structure inferenceover temporal knowledge graphs. In: Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing, pp. 6669\u20136683","DOI":"10.18653\/v1\/2020.emnlp-main.541"},{"key":"18_CR10","unstructured":"Lacroix, T., Obozinski, G., Usunier, N.: Tensor decompositions for temporal knowledge base completion. arXiv preprint arXiv:2004.04926 (2020)"},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"Liang, K., et al.: A survey of knowledge graph reasoning on graph types: static, dynamic, and multi-modal. IEEE Transactions on Pattern Analysis and Machine Intelligence (2024)","DOI":"10.1109\/TPAMI.2024.3417451"},{"key":"18_CR12","doi-asserted-by":"crossref","unstructured":"Liu, Y., Ma, Y., Hildebrandt, M., Joblin, M., Tresp, V.: TLogic: temporal logical rules for explainable link forecasting on temporal knowledge graphs. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol.\u00a036, pp. 4120\u20134127 (2022)","DOI":"10.1609\/aaai.v36i4.20330"},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"Niu, G., Li, B.: Logic and commonsense-guided temporal knowledge graph completion. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol.\u00a037, pp. 4569\u20134577 (2023)","DOI":"10.1609\/aaai.v37i4.25579"},{"key":"18_CR14","doi-asserted-by":"crossref","unstructured":"Sadeghian, A., Armandpour, M., Colas, A., Wang, D.Z.: ChronoR: rotation based temporal knowledge graph embedding. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol.\u00a035, pp. 6471\u20136479 (2021)","DOI":"10.1609\/aaai.v35i7.16802"},{"key":"18_CR15","unstructured":"Sankar, A., Wu, Y., Gou, L., Zhang, W., Yang, H.: Dynamic graph representation learning via self-attention networks. arXiv preprint arXiv:1812.09430 (2018)"},{"key":"18_CR16","unstructured":"Sun, Z., Deng, Z.H., Nie, J.Y., Tang, J.: RotatE: knowledge graph embedding by relational rotation in complex space. In: International Conference on Learning Representations (2019)"},{"key":"18_CR17","unstructured":"Trouillon, T., Welbl, J., Riedel, S., Gaussier, \u00c9., Bouchard, G.: Complex embeddings for simple link prediction. International Conference on Machine Learning (2016)"},{"key":"18_CR18","doi-asserted-by":"crossref","unstructured":"Xie, Q., Ma, X., Dai, Z., Hovy, E.: An interpretable knowledge transfer model for knowledge base completion. CoRR (2017)","DOI":"10.18653\/v1\/P17-1088"},{"key":"18_CR19","doi-asserted-by":"crossref","unstructured":"Yao, N., Liu, Q., Li, X., Yang, Y., Bai, Q.: Entity similarity-based negative sampling for knowledge graph embedding. In: Pacific Rim International Conference on Artificial Intelligence, pp. 73\u201387. Springer (2022)","DOI":"10.1007\/978-3-031-20865-2_6"},{"key":"18_CR20","doi-asserted-by":"crossref","unstructured":"Zheng, S., Yin, H., Chen, T., Nguyen, Q.V.H., Chen, W., Zhao, L.: DREAM: adaptive reinforcement learning based on attention mechanism for temporal knowledge graph reasoning. In: Proceedings of the 46th International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 1578\u20131588 (2023)","DOI":"10.1145\/3539618.3591671"},{"key":"18_CR21","doi-asserted-by":"crossref","unstructured":"Zhu, C., Chen, M., Fan, C., Cheng, G., Zhang, Y.: Learning from history: modeling temporal knowledge graphs with sequential copy-generation networks. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol.\u00a035, pp. 4732\u20134740 (2021)","DOI":"10.1609\/aaai.v35i5.16604"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-8183-9_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T17:38:48Z","timestamp":1750354728000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-8183-9_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819681822","9789819681839"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-8183-9_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"20 June 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PAKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pacific-Asia Conference on Knowledge Discovery and Data Mining","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sydney, NSW","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 June 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pakdd2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/pakdd2025.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}