Learning and Deduction of Rules for Knowledge Graph Completion
Authors: 
Yan Fang, Zhiwei Qi, Kun YueAuthors Info & Claims
Pages 102 - 107
Abstract
The 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 contained in KG. It is necessary to extend the rules into KGC to improve the precision of KGC with respect to the small amount of training data. In this paper, we propose a framework RuleB for KGC including rule learning and rule deduction. First, we adopt six types of basic rules in the framework for searching the triples in KG. Then, we propose an optimization algorithm RWK based on the random walk strategy and K-sized traverse to reduce the execution time of triple search. Second, we give the corresponding deduction strategy for the different basic rules to obtain the new rule knowledge (NRK). Further, we give the corresponding strategy for combining the NRK and KG to obtain new entity knowledge (NEK), as well as that for NEK-based KGC, where NEK contains new triples that have not been presented in the KG previously. Experimental results of rule learning show the efficiency and accuracy of our methods.
References
[1]
K. Bollacker, C. Evans, P. Paritosh, T. Sturge, and J. Taylor, "Freebase: a collaboratively created graph database for structuring human knowledge," in Proceedings of the 2008 ACM SIGMOD international conference on Management of data, 2008, pp. 1247--1250.
[2]
F. M. Suchanek, G. Kasneci, and G. Weikum, "YAGO: a core of semantic knowledge," in International Conference on World Wide Web, 2007.
[3]
W. Cui, Y. Xiao, H. Wang, Y. Song, S. Hwang, and W. Wang, "KBQA: learning question answering over QA corpora and knowledge bases," Proceedings of the VLDB Endowment, vol. 10, no. 5, pp. 565--576, 2017.
[4]
G. Wang et al., "Label-free distant supervision for relation extraction via knowledge graph embedding," in Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing, 2018, pp. 2246--2255.
[5]
F. Zhang, N. J. Yuan, D. Lian, X. Xie, and W.-Y. Ma, "Collaborative knowledge base embedding for recommender systems," in Proceedings of the 22nd ACM SIGKDD international conference on knowledge discovery and data mining, 2016, pp. 353--362.
[6]
Baoxu Shi and Tim Weninger, "Open-World Knowledge Graph Completion," arXiv:1711.03438 [cs], Nov. 2017.
[7]
L. A. Galárraga, C. Teflioudi, K. Hose, and F. Suchanek, "AMIE: Association rule mining under incomplete evidence in ontological knowledge bases," in Proceedings of the 22nd international conference on World Wide Web, 2013.
[8]
A. Bordes, N. Usunier, A. Garcia-Duran, J. Weston, and O. Yakhnenko, "Translating embeddings for modeling multi-relational data," in Advances in Neural Information Processing Systems, 2013, pp. 2787--2795.
[9]
Z. Wang, J. Zhang, J. Feng, and Z. Chen, "Knowledge graph embedding by translating on hyperplanes," in Twenty-Eighth AAAI conference on artificial intelligence, 2014.
[10]
Y. Lin, Z. Liu, M. Sun, Y. Liu, and X. Zhu, "Learning entity and relation embeddings for knowledge graph completion," in Twenty-ninth AAAI Conference on Artificial Intelligence, 2015.
[11]
B. Shi and T. Weninger, "ProjE: Embedding projection for knowledge graph completion," in Thirty-First AAAI Conference on Artificial Intelligence, 2017.
[12]
M. Nickel, L. Rosasco, and T. Poggio, "Holographic embeddings of knowledge graphs," in Thirtieth AAAI Conference on Artificial Intelligence, 2016.
[13]
L. Galárraga, C. Teflioudi, K. Hose, and F. M. Suchanek, "Fast rule mining in ontological knowledge bases with AMIE+," The VLDB Journal---The International Journal on Very Large Data Bases, vol. 24, no. 6, pp. 707--730, 2015.
[14]
V. T. Ho, D. Stepanova, M. H. Gad-Elrab, E. Kharlamov, and G. Weikum, "Rule learning from knowledge graphs guided by embedding models," in International Semantic Web Conference, 2018, pp. 72--90.
[15]
D. Dou, H. Qin, and H. Liu, "Semantic translation for rule-based knowledge in data mining," in International Conference on Database and Expert Systems Applications, 2011, pp. 74--89.
[16]
S. Jiang, D. Lowd, and D. Dou, "A probabilistic approach to knowledge translation," in Thirtieth AAAI Conference on Artificial Intelligence, 2016.
[17]
F. Yang, Z. Yang, and W. W. Cohen, "Differentiable learning of logical rules for knowledge base reasoning," in Advances in Neural Information Processing Systems, 2017, pp. 2319--2328.
[18]
W. Xiong, T. Hoang, and W. Y. Wang, "Deeppath: A reinforcement learning method for knowledge graph reasoning," arXiv preprint arXiv:1707.06690, 2017.
[19]
P. G. Omran, K. Wang, and Z. Wang, "Scalable Rule Learning via Learning Representation," in International Joint Conference on Artificial Intelligence, 2018, pp. 2149--2155.
Index Terms
- Learning and Deduction of Rules for Knowledge Graph Completion
Recommendations
Iteratively Learning Embeddings and Rules for Knowledge Graph Reasoning
WWW '19: The World Wide Web ConferenceReasoning is essential for the development of large knowledge graphs, especially for completion, which aims to infer new triples based on existing ones. Both rules and embeddings can be used for knowledge graph reasoning and they have their own ...
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 ...
Bi-directional Learning of Logical Rules with Type Constraints for Knowledge Graph Completion
CIKM '24: Proceedings of the 33rd ACM International Conference on Information and Knowledge ManagementKnowledge graph completion (KGC) aims to infer missing facts from existing facts. Learning logical rules plays a pivotal role in KGC, as logical rules excel in explaining why a missing fact is inferred. Most existing rule learning methods focus merely on ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
May 2020
133 pages
ISBN:9781450375474
DOI:10.1145/3404687
Copyright © 2020 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
In-Cooperation
- Shenzhen University: Shenzhen University
- Sun Yat-Sen University
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 30 July 2020
Check for updates
Author Tags
Qualifiers
- Research-article
- Research
- Refereed limited
Conference
ICBDC 2020
ICBDC 2020: 2020 5th International Conference on Big Data and Computing
May 28 - 30, 2020
Chengdu, China
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 67Total Downloads
- Downloads (Last 12 months)6
- Downloads (Last 6 weeks)0
Reflects downloads up to 22 Nov 2024
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in