Agustín Borrego
Inma Hernández
David Ruiz
ABSTRACT
Knowledge Graphs (KGs) contain large amounts of structured information. Due to their inherent incompleteness, a process known as KG completion is often carried out to find the missing triples in a KG, usually by training a fact checking model that is able to discern between correct and incorrect knowledge. After the fact checking model has been trained and evaluated, it has to be applied to a set of candidate triples, and those that are considered correct are added to the KG as new knowledge. However, this process needs a set of candidate triples of a reasonable size that represents possible new knowledge, in order to be evaluated by the fact checking task and, if considered to be correct, added to the KG, enriching it. Current approaches for selecting candidate triples for their correctness checking either use the full set possible missing candidate triples (and thus provide no filtering) or apply very basic rules to filter out unlikely candidates, which may have a negative effect on the completion performance as very few candidate triples are filtered out. In this paper we present CHAI, a method for producing more complex rules that are able to filter candidate triples by combining a set of criteria to optimize a fitness function. Our experiments show that CHAI is able to generate rules that, when applied, yield smaller candidate sets than similar proposals while still including promising candidate triples.
- Daniel Ayala, Agustín Borrego, Inma Hernández, Carlos R. Rivero, and David Ruiz. 2019. AYNEC: All You Need for Evaluating Completion Techniques in Knowledge Graphs. In ESWC. 397--411. https://doi.org/10.1007/978--3-030--21348-0_26Google Scholar
- Daniel Ayala, Inma Hernández, David Ruiz, and Miguel Toro. 2019. TAPON: A two-phase machine learning approach for semantic labelling. Knowledge-Based Systems 163 (2019), 931--943. https://doi.org/10.1016/j.knosys.2018.10.017Google ScholarCross Ref
- Kurt Bollacker, Colin Evans, Praveen Paritosh, Tim Sturge, and Jamie Taylor. 2008. Freebase: A Collaboratively Created Graph Database for Structuring Human Knowledge. In SIGMOD. ACM, 1247--1250. https://doi.org/10.1145/1376616. 1376746Google Scholar
- Antoine Bordes, Sumit Chopra, and JasonWeston. 2014. Question Answering with Subgraph Embeddings. In EMNLP. ACL, 615--620. http://aclweb.org/anthology/ D/D14/D14--1067.pdfGoogle Scholar
- Antoine Bordes and Evgeniy Gabrilovich. 2014. Constructing and Mining Webscale Knowledge Graphs. In SIGKDD. ACM, 1967--1967. https://doi.org/10.1145/ 2623330.2630803Google Scholar
- Antoine Bordes, Xavier Glorot, Jason Weston, and Yoshua Bengio. 2014. A semantic matching energy function for learning with multi-relational data - Application to word-sense disambiguation. Machine Learning 94, 2 (2014), 233-- 259. https://doi.org/10.1007/s10994-013--5363--6Google ScholarDigital Library
- Antoine Bordes, Nicolas Usunier, Alberto García-Durán, Jason Weston, and Oksana Yakhnenko. 2013. Translating embeddings for modeling multi-relational data. In NIPS. 2787--2795. https://papers.nips.cc/paper/5071-translatingembeddings- for-modeling-multi-relational-dataGoogle Scholar
- Xin Dong, Evgeniy Gabrilovich, Geremy Heitz, Wilko Horn, Ni Lao, Kevin Murphy, Thomas Strohmann, Shaohua Sun, and Wei Zhang. 2014. Knowledge Vault: A Web-scale Approach to Probabilistic Knowledge Fusion. In SIGKDD. ACM, 601--610. https://doi.org/10.1145/2623330.2623623Google Scholar
- Sébastien Ferré. 2019. Link Prediction in Knowledge Graphs with Concepts of Nearest Neighbours. In ESWC. Springer International Publishing, 84--100. https://doi.org/10.1007/978--3-030--21348-0_6Google Scholar
- Luis Galárraga, Christina Teflioudi, Katja Hose, and Fabian M. Suchanek. 2015. Fast rule mining in ontological knowledge bases with AMIE+. VLDB J. 24, 6 (2015), 707--730. https://doi.org/10.1007/s00778-015-0394--1Google ScholarDigital Library
- Matt Gardner and Tom Mitchell. 2015. Efficient and expressive knowledge base completion using subgraph feature extraction. In EMNLP. The Association for Computational Linguistics, 1488--1498. https://aclweb.org/anthology/D/D15/ D15--1173.pdfGoogle Scholar
- Matt Gardner, Partha Pratim Talukdar, Jayant Krishnamurthy, and Tom M. Mitchell. 2014. Incorporating Vector Space Similarity in Random Walk Inference over Knowledge Bases. In EMNLP. 397--406. http://aclweb.org/anthology/D/D14/ D14--1044.pdfGoogle Scholar
- Michael Glass and Alfio Gliozzo. 2018. A Dataset for Web-Scale Knowledge Base Population. In ESWC. Springer, 256--271. https://doi.org/10.1007/978--3--319- 93417--4_17Google Scholar
- Vinh Thinh Ho, Daria Stepanova, Mohamed H. Gad-Elrab, Evgeny Kharlamov, and Gerhard Weikum. 2018. Learning Rules from Incomplete KGs using Embeddings. In ISWC, Vol. 2180. http://ceur-ws.org/Vol-2180/paper-25.pdfGoogle Scholar
- Ni Lao and William W Cohen. 2010. Relational retrieval using a combination of path-constrained random walks. Machine learning 81, 1 (2010), 53--67. https: //doi.org/10.1007/s10994-010--5205--8Google Scholar
- Jens Lehmann, Robert Isele, Max Jakob, Anja Jentzsch, Dimitris Kontokostas, Pablo N Mendes, Sebastian Hellmann, Mohamed Morsey, Patrick Van Kleef, Sören Auer, and Christian Bizer. 2015. DBpedia - A large-scale, multilingual knowledge base extracted from Wikipedia. Semantic Web 6, 2 (2015), 167--195. https://doi.org/10.3233/SW-140134Google ScholarCross Ref
- Peng Lin, Qi Song, and Yinghui Wu. 2018. Fact Checking in Knowledge Graphs with Ontological Subgraph Patterns. Data Science and Engineering 3 (2018), 341--358. https://doi.org/10.1007/s41019-018-0082--4Google ScholarCross Ref
- Sahisnu Mazumder and Bing Liu. 2017. Context-aware Path Ranking for Knowledge Base Completion. In IJCAI. AAAI Press, 1195--1201. https://doi.org/10. 24963/ijcai.2017/166Google Scholar
- Christian Meilicke, Melisachew Wudage Chekol, Daniel Ruffinelli, and Heiner Stuckenschmidt. 2019. Anytime Bottom-Up Rule Learning for Knowledge Graph Completion. In IJCAI. ijcai.org, 3137--3143. https://doi.org/10.24963/ijcai.2019/435Google Scholar
- George A. Miller. 1995. WordNet: A Lexical Database for English. Commun. ACM 38, 11 (1995), 39--41. https://doi.org/10.1145/219717.219748Google ScholarDigital Library
- T. Mitchell,W. Cohen, E. Hruschka, P. Talukdar, B. Yang, J. Betteridge, A. Carlson, B. Dalvi, M. Gardner, B. Kisiel, J. Krishnamurthy, N. Lao, K. Mazaitis, T. Mohamed, N. Nakashole, E. Platanios, A. Ritter, M. Samadi, B. Settles, R. Wang, D. Wijaya, A. Gupta, X. Chen, A. Saparov, M. Greaves, and J. Welling. 2018. Never-ending Learning. Commun. ACM 61, 5 (2018), 103--115. https://doi.org/10.1145/3191513Google ScholarDigital Library
- Maximilian Nickel, Volker Tresp, and Hans-Peter Kriegel. 2012. Factorizing YAGO: scalable machine learning for linked data. In WWW. ACM, 271--280. https://doi.org/10.1145/2187836.2187874Google Scholar
- Pouya Ghiasnezhad Omran, Kewen Wang, and Zhe Wang. 2018. Scalable Rule Learning via Learning Representation. In IJCAI. ijcai.org, 2149--2155. https: //doi.org/10.24963/ijcai.2018/297Google Scholar
- Heiko Paulheim. 2017. Knowledge graph refinement: A survey of approaches and evaluation methods. Semantic Web 8, 3 (2017), 489--508. https://doi.org/10. 3233/SW-160218Google ScholarDigital Library
- Baoxu Shi and Tim Weninger. 2018. Open-World Knowledge Graph Completion. In AAAI. 1957--1964. https://www.aaai.org/ocs/index.php/AAAI/AAAI18/paper/ view/16055Google Scholar
- Richard Socher, Danqi Chen, Christopher D Manning, and Andrew Ng. 2013. Reasoning with neural tensor networks for knowledge base completion. In NIPS. 926-- 934. https://papers.nips.cc/paper/5028-reasoning-with-neural-tensor-networksfor- knowledge-base-completionGoogle Scholar
- Zhen Wang, Jianwen Zhang, Jianlin Feng, and Zheng Chen. 2014. Knowledge Graph Embedding by Translating on Hyperplanes. In AAAI, Vol. 14. AAAI Press, 1112--1119. https://www.aaai.org/ocs/index.php/AAAI/AAAI14/paper/view/ 8531Google ScholarDigital Library
- Zhuoyu Wei, Jun Zhao, Kang Liu, Zhenyu Qi, Zhengya Sun, and Guanhua Tian. 2015. Large-scale Knowledge Base Completion: Inferring via Grounding Network Sampling over Selected Instances. In CIKM. 1331--1340. https://doi.org/10.1145/ 2806416.2806513Google Scholar
- Ziqi Zhang. 2017. Effective and efficient Semantic Table Interpretation using TableMiner+. Semantic Web 8, 6 (2017), 921--957. https://doi.org/10.3233/SW- 160242Google ScholarDigital Library
Index Terms
- Generating Rules to Filter Candidate Triples for their Correctness Checking by Knowledge Graph Completion Techniques
Recommendations
Active knowledge graph completion
AbstractEnterprise and public Knowledge Graphs (KGs) are known to be incomplete. Methods for automatic completion, sometimes by rule learning, scale well. While previous rule-based methods learn closed (non-existential) rules, we introduce ...
Learning and Deduction of Rules for Knowledge Graph Completion
ICBDC '20: Proceedings of the 5th International Conference on Big Data and ComputingThe amount of training data or knowledge determines the precision of Knowledge Graph Completion (KGC), since traditional methods require as much training data as possible for model training or embedding to ensure the accurate expression of the knowledge ...
Knowledge Graph Augmentation with Entity Identification for Improving Knowledge Graph Completion Performance
PRICAI 2023: Trends in Artificial IntelligenceAbstractA knowledge graph often lacks some existent triples. Knowledge graph completion is a technique for complementing such triples and its performance can be improved by augmenting triples from other external databases. However, entity names often ...
Comments