.png){kind=icon}
.png){kind=icon}
Return
Knowledge Graph Completion With Pattern-Based Methods
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2025.3525586.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Knowledge graphs (KGs) are popularly used to develop several intelligent applications. Revealing valuable knowledge hidden in these graphs opened up a branch of research, known as KG reasoning, aiming at predicting the missing links. Some methods take advantage of external information such as entity description but at the cost of more computational complexity. Besides, most of the current techniques focus solely on local information in the KG. However, the learning process can utilise valuable global information in the entire graph. In this paper, we propose a Pattern-based Knowledge Graph Completion (PKGC) method that consists of three phases. The first phase utilizes multi-source information and expands the KG using entity description as external information with efficient Natural Language Processing (NLP) techniques. In the second phase, we mine frequent patterns from the expanded KG, extract connections between them and assign entities to the patterns that construct the abstraction layer. Based on the extracted patterns, connections, and entity assignments, a flow network is constructed on the abstraction layer in the third phase. We use global internal information, namely patterns, by adapting the minimum-cost circulation problem to the flow network. This way the links in a larger neighborhood are involved in the inference. We conducted experiments on the link prediction task and evaluated the training time on two benchmark datasets, WordNet and Freebase. Experiments have demonstrated that the proposed method is superior to the state-of-the-art methods and that pattern extraction is effective for knowledge graph completion tasks.
Keywords:
Cognition
Knowledge graphs
Vectors
Semantics
Tail
Translation
Natural language processing
Training
Tensors
Surveys
Frequent pattern mining
flow network
knowledge graph completion
minimum-cost circulation problem
Journal
IF:
3.6
Papers:
9.8W
Citations:
29.4W