A Link Prediction Method Based on Knowledge Graph Embedding

A technology of knowledge graph and prediction method, which is applied in the direction of multi-channel program device, program control design, instrument, etc., can solve the problems of large differences in data distribution, lack of knowledge graph link prediction application, performance degradation of embedded models, etc., to achieve Improve GPU utilization, shorten training time, and speed up the effect of link prediction

Active Publication Date: 2022-04-12
NAT UNIV OF DEFENSE TECH
View PDF5 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0012] However, the PBG knowledge graph embedding framework has the following problems: 1. During partition training, the server first uses the CPU for data exchange and preprocessing, and then loads the embedding and triples to the GPU for calculation. These two processes are serial , so the CPU and GPU need to wait for each other to increase the entire training time; 2. Because of the partition, the data distribution of the partitioned triple block and the data distribution of the entire knowledge graph triple are very different, so the final embedding The performance of the model will decrease. The experimental results show that when performing link prediction, MRR (Mean ReciprocalRank) decreases as the number of partitions increases; 3. Only embedding training and testing of knowledge graphs are provided, lacking knowledge Link Prediction Applications with Graph Embedded in Distributed Clusters

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • A Link Prediction Method Based on Knowledge Graph Embedding
  • A Link Prediction Method Based on Knowledge Graph Embedding
  • A Link Prediction Method Based on Knowledge Graph Embedding

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0114] Such as figure 1 Shown, the present invention comprises the following steps:

[0115] The first step: partition the knowledge map; determine the number of partitions P and the number of sub-partitions PP of each partition according to the needs, and divide all entities into subP non-overlapping sub-partitions, subP=P×PP, sub-partitions are entities The non-overlapping subsets of the set E are partitioned into the union of PP sub-partitions; all triples are divided into different sub-triple blocks according to the sub-partitions where the head entity and tail entity are located; the method is:

[0116] 1.1 Input the knowledge map data, get the entity set E, the relationship set R, the triple set T, the number of entities num_entities, E contains num_entities entities, num_entities is a positive integer, T contains num_triples triples, num_triples is a positive integer . For example: input 8 entities, 2 relational knowledge graphs, then E={e 0 ,e 1 ,e 2 ,e 3 ,e 4 ,e...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention discloses a link prediction method based on knowledge graph embedding, aiming to realize fast link prediction of large-scale knowledge graph. The technical solution is to first partition the knowledge graph; then build an embedded model and a knowledge graph link prediction system composed of N servers and a shared file system. During training, the server serves as the master node and training node, and the server serves as the query node and prediction node during training. The master node is installed with a lock server process, and the training node is installed with a data loading process and a GPU training process; then multiple machines are parallelized and the CPU and GPU parallelize the embedded model for distributed training; finally N servers load the trained embedded model, and the knowledge Graph links are used for parallel prediction; the invention not only speeds up the training and connection prediction of knowledge graph embedding, but also solves the problem of embedding performance degradation caused by partitioning, and can quickly obtain high-quality knowledge graph embedding.

Description

technical field [0001] The invention relates to the field of knowledge map link prediction, in particular to a method for link prediction based on knowledge map embedding. Background technique [0002] A knowledge graph (Knowledge Graph, KG) is a structured representation of real-world information, usually representing a multi-relational graph, that is, a graph containing multiple types of nodes and relationships. KG consists of three parts. The entity set E is a collection of things in the real world, such as people, place names, concepts, drugs, companies, etc., for example, "Beijing" is an entity; the relationship set R is a certain relationship between entities. Connections, such as the "capital" relationship means that one entity is the capital of another entity; the triple set T represents the fact that there is a certain relationship between entities, such as the triple (Beijing, capital, China), which means "Beijing is the China's capital" fact. [0003] Although k...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
Patent Type & Authority Patents(China)
IPC IPC(8): G06F9/50G06F40/295
CPCG06F9/5027G06F40/295
Inventor 黄震孙鼎李东升王艺霖乔林波汪昌健徐皮克陈易欣
Owner NAT UNIV OF DEFENSE TECH
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products