2021
DOI: 10.1109/tkde.2019.2941685
|View full text |Cite
|
Sign up to set email alerts
|

An Embedding-Based Approach to Rule Learning in Knowledge Graphs

Abstract: It is natural and effective to use rules for representing explicit knowledge in knowledge graphs. However, it is challenging to learn rules automatically from very large knowledge graphs such as Freebase and YAGO. This paper presents a new approach, RLvLR (Rule Learning via Learning Representations), to learning rules from large knowledge graphs by using the technique of embedding in representation learning together with a new sampling method. Based on RLvLR, a new method RLvLR-Stream is developed for learning… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
21
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
4
3
2

Relationship

0
9

Authors

Journals

citations
Cited by 37 publications
(21 citation statements)
references
References 21 publications
(32 reference statements)
0
21
0
Order By: Relevance
“…Logical rules can been extracted by rule mining tools like AMIE [77]. The recent RLvLR [78] proposes a scalable rule mining approach with efficient rule searching and pruning, and uses the extracted rules for link prediction.…”
Section: Rule-based Reasoningmentioning
confidence: 99%
See 1 more Smart Citation
“…Logical rules can been extracted by rule mining tools like AMIE [77]. The recent RLvLR [78] proposes a scalable rule mining approach with efficient rule searching and pruning, and uses the extracted rules for link prediction.…”
Section: Rule-based Reasoningmentioning
confidence: 99%
“…Chekol et al [145] explored Markov logic network and probabilistic soft logic for reasoning over uncertain temporal knowledge graphs. RLvLR-Stream [78] considers temporal close-path rules and learns the structure of rules from knowledge graph stream for reasoning.…”
Section: Temporal Logical Reasoningmentioning
confidence: 99%
“…AMIE [42] is a horn rule mining system which can work on large-scale KGs like YAGO2 [1]. Omran et al [43] proposed a system RLvLR for extracting closed-path rules, a special class of first-order rules, from RDF knowledge graphs. In contrast to traditional Inductive Logic Programming (ILP) learning approaches, PLvLR uses technology of embeddings to explore plausible paths instead of using a refinement operator to search the rule space.…”
Section: ) Real-world Kg Acquisitionmentioning
confidence: 99%
“…In recent years, the emergence of large-scale knowledge graphs has promoted the development of knowledge-aware representation [14]. The knowledge graph contains rich knowledge [15]. Knowledgeaware representation brings in rich semantic information from the knowledge graph, which significantly improves the effectiveness of the search algorithms [16] and provides new opportunities for better understanding queries and documents [17,18].…”
Section: Related Workmentioning
confidence: 99%