CPC G06N 3/045 (2023.01) | 20 Claims |
1. A computer-implemented method of completing an incomplete triplet in a knowledge graph comprising:
receiving, by a transformer, a source entity-relation pair input from the knowledge graph;
capturing, by the transformer, interaction information for the source entity-relation pair input;
outputting, by the transformer, link predictions based on the interaction information;
ranking the link predictions based on a plausibility score;
selecting the highest ranked link prediction to be a target node for the incomplete triplet; and
adding the target node to the incomplete triplet in the knowledge graph.
|