Graph Algorithms for Data Science

11 Knowledge graph completion

This chapter covers

• Introducing heterogeneous graphs
• Explaining knowledge graph embeddings
• Describing knowledge graph completion workflow
• Examining knowledge graph completion results

Chapter 10 was an introduction to link prediction and completion techniques. The difference between link prediction and completion is that the first is a workflow to predict future links, while the latter deals with predicting missing links. However, in practice, link prediction and completion workflows are very similar. What wasn’t explicitly mentioned is that the link prediction features used in chapter 10 do not differentiate between various node or relationship types. For example, the number of common neighbors does not differentiate ...