Complex computer system architectures are described for analyzing data elements of a knowledge graph, and predicting new surprising or unforeseen facts from relational learning applied to the knowledge graph. This discovery process takes advantage of the knowledge graph structure to improve the computing capabilities of a device executing a discovery calculation by applying both training and inference analysis techniques on the knowledge graph within an embedding space, and generating a scoring strategy for predicting surprising facts that may be discoverable from the knowledge graph.
SYSTEM TO PREDICT SURPRISING LINKS IN KNOWLEDGE GRAPHS