CoChat
Sign Up
Cited by 7

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

TeCre: A Novel Temporal Conflict Resolution Method Based on Temporal Knowledge Graph Embedding

Ma, Jiangtao, Zhou, Chenyu, Chen, Yonggang, Wang, Yanjun, Hu, Guangwu, Qiao, Yaqiong·2023·Information
DOI 10.3390/info14030155
Open this paper in CoChat — free account

Abstract

Since the facts in the knowledge graph (KG) cannot be updated automatically over time, some facts have temporal conflicts. To discover and eliminate the temporal conflicts in the KG, this paper proposes a novel temporal conflict resolution method based on temporal KG embedding (named TeCre). Firstly, the predicate relation and timestamp information of time series are incorporated into the entity–relation embedding representation by leveraging the temporal KG embedding (KGE) method. Then, taking into account the chronological sequence of the evolution of the entity–relation representation over time, TeCre constrains the temporal relation in the KG according to the principles of time disjoint, time precedence, and time mutually exclusive constraints. Besides that, TeCre further considers the sequence vectorization of predicate relation to discover the temporal conflict facts in the KG. Finally, to eliminate the temporal conflict facts, TeCre deletes the tail entities of the temporal conflict facts, and employs the link prediction method to complete the missing tail entities according to the output of the score function based on the entity–relation embedding. Experimental results on four public datasets show that TeCre is significantly better than the state-of-the-art temporal KG conflict resolution model. The mean reciprocal ranking (MRR) and Hits@10 of TeCre are at least 5.46% and 3.2% higher than the baseline methods, respectively.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.3390/info14030155

Cites

1 of 1 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Research works printed but not linked: 43

  1. Lehmann, 2015, Dbpedia—A large-scale, multilingual knowledge base extracted from wikipedia, Semant. Web, 6, 167, 10.3233/SW-140134 · DOI
  2. Mitchell, 2018, Never-ending learning, Commun. ACM, 61, 103, 10.1145/3191513 · DOI
  3. Hoffart, 2013, YAGO2: A spatially and temporally enhanced knowledge base from Wikipedia, Artif. Intell., 194, 28, 10.1016/j.artint.2012.06.001 · DOI
  4. Bollacker, K., Evans, C., Paritosh, P., Sturge, T., and Taylor, J. (2008, January 10–12). Freebase: A collaboratively created graph database for structuring human knowledge. Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data, Vancouver, BC, Canada. · DOI · Paper page
  5. Gaur, M., Gunaratna, K., Srinivasan, V., and Jin, H. (March, January 22). Iseeq: Information seeking question generation using dynamic meta-information retrieval and knowledge graphs. Proceedings of the 34th AAAI Conference on Artificial Intelligence, online.
  6. Liu, L., Du, B., Xu, J., Xia, Y., and Tong, H. (2022, January 14–18). Joint Knowledge Graph Completion and Question Answering. Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, Washington, DC, USA. · DOI
  7. Chen, Y., Yang, Y., Wang, Y., Bai, J., Song, X., and King, I. (2022, January 9). Attentive Knowledge-aware Graph Convolutional Networks with Collaborative Guidance for Personalized Recommendation. Proceedings of the 38th IEEE International Conference on Data Engineering, Kuala Lumpur, Malaysia. · DOI
  8. Xue, B., and Zou, L. (2022). Knowledge Graph Quality Management: A Comprehensive Survey. IEEE Trans. Knowl. Data Eng., 1. · DOI · Paper page
  9. Thomas, P.T., Gerhard, W., and Fabian, S. (2020, January 2–6). YAGO 4: A Reason-able Knowledge Base. Proceedings of the The Semantic Web, Athens, Greece.
  10. 2014, Wikidata: A free collaborative knowledgebase, Commun. ACM, 57, 78, 10.1145/2629489 · DOI
  11. Xu, C., Nayyeri, M., Alkhoury, F., Yazdi, H.S., and Lehmann, J. (2019). Temporal knowledge graph embedding model based on additive time series decomposition. arXiv.
  12. Dylla, 2012, Resolving Temporal Conflicts in Inconsistent RDF Knowledge Bases, Coord. Chem. Rev., 2, 474
  13. Lu, L., Fang, J., Zhao, P., Xu, J., Yin, H., and Zhao, L. (2018, January 12–15). Eliminating temporal conflicts in uncertain temporal knowledge graphs. Proceedings of the International Conference on Web Information Systems Engineering, Dubai, United Arab Emirates. · DOI
  14. Abedini, 2020, Correction Tower: A general embedding method of the error recognition for the knowledge graph correction, Int. J. Pattern Recognit. Artif. Intell., 34, 2059034, 10.1142/S021800142059034X · DOI
  15. Chekol, M., Pirrò, G., Schoenfisch, J., and Stuckenschmidt, H. (2017, January 4–9). Marrying uncertainty and time in knowledge graphs. Proceedings of the 31st AAAI Conference on Artificial Intelligence, San Francisco, CA, USA. · DOI · Paper page
  16. García-Durán, A., Dumančić, S., and Niepert, M. (, January October–November). Learning Sequence Encoders for Temporal Knowledge Graph Completion. Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing, Brussels, Belgium. · DOI · Paper page
  17. Wang, Y., Qiao, Y., Ma, J., Hu, G., Zhang, C., Sangaiah, A.K., Zhang, H., and Ren, K. (2019). A Novel Time Constraint-Based Approach for Knowledge Graph Conflict Resolution. Appl. Sci., 9. · DOI
  18. Jiang, T., Liu, T., Ge, T., Sha, L., Chang, B., Li, S., and Sui, Z. (2016, January 11–16). Towards time-aware knowledge graph completion. Proceedings of the 26th International Conference on Computational Linguistics, Osaka, Japan.
  19. Leblay, J., and Chekol, M.W. (2018, January 23–27). Deriving Validity Time in Knowledge Graph. Proceedings of the Companion of the The Web Conference 2018 on The Web Conference 2018, Lyon, France. · DOI · Paper page
  20. Bordes, A., Usunier, N., Garcia-Duran, A., Weston, J., and Yakhnenko, O. (2013, January 5–10). Translating Embeddings for Modeling Multi-relational Data. Proceedings of the 27th Advances in Neural Information Processing Systems, Lake Tahoe, NV, USA.
  21. Yang, B., Yih, S.W.t., He, X., Gao, J., and Deng, L. (2015, January 7–9). Embedding Entities and Relations for Learning and Inference in Knowledge Bases. Proceedings of the 3rd International Conference on Learning Representations, San Diego, CA, USA.
  22. Jia, B., Wang, C., Zhao, H., and Shi, L. (2022). An Entity Linking Algorithm Derived from Graph Convolutional Network and Contextualized Semantic Relevance. Symmetry, 14. · DOI
  23. Shen, M., Xu, K., Yang, K., and Chen, H.H. (2014, January 26–27). Towards efficient virtual network embedding across multiple network domains. Proceedings of the 22nd International Symposium of Quality of Service, Hong Kong, China. · DOI
  24. Messner, J., Abboud, R., and Ceylan, I.I. (March, January 22). Temporal knowledge graph completion using box embeddings. Proceedings of the AAAI Conference on Artificial Intelligence, online.
  25. Dasgupta, S.S., Ray, S.N., and Talukdar, P.P. (2018, January 7–11). HyTE: Hyperplane-based Temporally aware Knowledge Graph Embedding. Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing, Abu Dhabi, United Arab Emirates. · DOI · Paper page
  26. Trivedi, R., Dai, H., Wang, Y., and Song, L. (2017, January 6–11). Know-Evolve: Deep Temporal Reasoning for Dynamic Knowledge Graphs. Proceedings of the 34th International Conference on Machine Learning, Sydney, Australia.
  27. Goel, R., Kazemi, S.M., Brubaker, M., and Poupart, P. (2020, January 7–12). Diachronic embedding for temporal knowledge graph completion. Proceedings of the 34th AAAI Conference on Artificial Intelligence, New York, NY, USA. · DOI · Paper page
  28. Bianchi, F., Palmonari, M., and Nozza, D. (2018, January 8–12). Towards encoding time in text-based entity embeddings. Proceedings of the 17th International Semantic Web Conference, Monterey, CA, USA. · DOI
  29. Xiao, 2021, Knowledge Graph Embedding Based on Multi-View Clustering Framework, IEEE Trans. Knowl. Data Eng., 33, 585, 10.1109/TKDE.2019.2931548 · DOI
  30. Fu, 2018, Weakly supervised topic sentiment joint model with word embeddings, Knowl.-Based Syst., 147, 43, 10.1016/j.knosys.2018.02.012 · DOI
  31. Jiang, T., Liu, T., Ge, T., Sha, L., Li, S., Chang, B., and Sui, Z. (2016, January 1–5). Encoding Temporal Information for Time-Aware Link Prediction. Proceedings of the 2016 Conference on Empirical Methods in Natural Language Processing, Austin, TX, USA. · DOI
  32. Fleischhacker, D., Paulheim, H., Bryl, V., Völker, J., and Bizer, C. (2014, January 19–23). Detecting Errors in Numerical Linked Data Using Cross-Checked Outlier Detection. Proceedings of the 13th International Semantic Web Conference, Riva del Garda, Italy. · DOI
  33. Wienand, D., and Paulheim, H. (2014, January 25–29). Detecting Incorrect Numerical Data in DBpedia. Proceedings of the Semantic Web: Trends and Challenges - 11th International Conference, Anissaras, Crete, Greece. · DOI
  34. Paulheim, H. (2014, January 26). Identifying Wrong Links between Datasets by Multi-dimensional Outlier Detection. Proceedings of the 3rd International Workshop on Debugging Ontologies and Ontology Mappings, Hersonissou, Greece.
  35. Li, H., Li, Y., Xu, F., and Zhong, X. (2015, January 1–4). Probabilistic Error Detecting in Numerical Linked Data. Proceedings of the 26th International Conference on Database and Expert Systems Applications, Valencia, Spain. · DOI
  36. Gao, Y., Feng, L., Kan, Z., Han, Y., Qiao, L., and Li, D. (2022, January 23–29). Modeling Precursors for Temporal Knowledge Graph Reasoning via Auto-encoder Structure. Proceedings of the 31st International Joint Conference on Artificial Intelligence, IJCAI-22, Vienna, Austria. · DOI
  37. Padia, A. (2017, January 22). Cleaning Noisy Knowledge Graphs. Proceedings of the Doctoral Consortium at the 16th International Semantic Web Conference, Vienna, Austria.
  38. Chen, Y., and Wang, D.Z. (2014, January 22–27). Knowledge expansion over probabilistic knowledge bases. Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data, Snowbird, UT, USA. · DOI
  39. Chekol, 2017, TeCoRe: Temporal Conflict Resolution in Knowledge Graphs, Proc. VLDB Endow., 10, 1929, 10.14778/3137765.3137811 · DOI · Paper page
  40. Zhang, 2019, Toward Edge-Assisted Video Content Intelligent Caching With Long Short-Term Memory Learning, IEEE Access, 7, 152832, 10.1109/ACCESS.2019.2947067 · DOI
  41. Jin, W., Qu, M., Jin, X., and Ren, X. (2020, January 8–12). Recurrent Event Network: Autoregressive Structure Inferenceover Temporal Knowledge Graphs. Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing (EMNLP), Barcelona, Spain. · DOI
  42. Zhu, C., Chen, M., Fan, C., Cheng, G., and Zhang, Y. (March, January 22). Learning from history: Modeling temporal knowledge graphs with sequential copy-generation networks. Proceedings of the 32rd AAAI Conference on Artificial Intelligence, online.
  43. Li, Z., Guan, S., Jin, X., Peng, W., Lyu, Y., Zhu, Y., Bai, L., Li, W., Guo, J., and Cheng, X. (2022, January 22–27). Complex Evolutional Pattern Learning for Temporal Knowledge Graph Reasoning. Proceedings of the 60th Annual Meeting of the Association for Computational Linguistics (Volume 2: Short Papers), Dublin, Ireland. · DOI

Metadata

Authors
Ma, J., Zhou, C., Chen, Y., Wang, Y., Hu, G., & Qiao, Y.
Venue
Information
Publisher
MDPI AG
Published
2023-03-01
Volume
14
Issue
3
Pages
155
ISSN
2078-2489
DOI
10.3390/info14030155
Cited by
7
References
1
Language
en
Licence
creativecommons.org/licenses/by/4.0/ (vor)
Funders
  • National Natural Science Foundation of China (62272163, YYJC012022023, 222300420230, 222102210027, HNTS2022005, 2021MK067, 2022A1515010417, JSGG20211029095545002, XQ2021, 489-29)
  • Songshan Laboratory Pre-research Project (62272163, YYJC012022023, 222300420230, 222102210027, HNTS2022005, 2021MK067, 2022A1515010417, JSGG20211029095545002, XQ2021, 489-29)
  • Henan Province Science Foundation for Youths (62272163, YYJC012022023, 222300420230, 222102210027, HNTS2022005, 2021MK067, 2022A1515010417, JSGG20211029095545002, XQ2021, 489-29)
  • Henan Province Science and Technology Department Foundation (62272163, YYJC012022023, 222300420230, 222102210027, HNTS2022005, 2021MK067, 2022A1515010417, JSGG20211029095545002, XQ2021, 489-29)
  • Open Foundation of Henan Key Laboratory of Cyberspace Situation Awareness (62272163, YYJC012022023, 222300420230, 222102210027, HNTS2022005, 2021MK067, 2022A1515010417, JSGG20211029095545002, XQ2021, 489-29)
  • Science and Technology Plan Projects of State Administration for Market Regulation (62272163, YYJC012022023, 222300420230, 222102210027, HNTS2022005, 2021MK067, 2022A1515010417, JSGG20211029095545002, XQ2021, 489-29)
  • Natural Science Foundation of Guangdong Province (62272163, YYJC012022023, 222300420230, 222102210027, HNTS2022005, 2021MK067, 2022A1515010417, JSGG20211029095545002, XQ2021, 489-29)
  • Key project of Shenzhen municipality (62272163, YYJC012022023, 222300420230, 222102210027, HNTS2022005, 2021MK067, 2022A1515010417, JSGG20211029095545002, XQ2021, 489-29)
  • School-enterprise Collaborative Innovation Project of SZIIT (62272163, YYJC012022023, 222300420230, 222102210027, HNTS2022005, 2021MK067, 2022A1515010417, JSGG20211029095545002, XQ2021, 489-29)
  • Undergraduate Universities Smart Teaching Special Research Project of Henan Province (62272163, YYJC012022023, 222300420230, 222102210027, HNTS2022005, 2021MK067, 2022A1515010417, JSGG20211029095545002, XQ2021, 489-29)

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review