A Review of Relational Machine Learning for Knowledge Graphs

Counts differ because each database indexes a different set of publications. We treat OpenAlex as the canonical count; Google Scholar is not shown (no API, and crawling it violates its ToS).

Relational machine learning studies methods for the statistical analysis of relational, or graph-structured, data. In this paper, we provide a review of how such statistical models can be “trained” on large knowledge graphs, and then used to predict new facts about the world (which is equivalent to predicting new edges in the graph). In particular, we discuss two fundamentally different kinds of statistical relational models, both of which can scale to massive data sets. The first is based on latent feature models such as tensor factorization and multiway neural networks. The second is based on mining observable patterns in the graph. We also show how to combine these latent and observable models to get improved modeling power at decreased computational cost. Finally, we discuss how such statistical models of graphs can be combined with text-based information extraction methods for automatically constructing knowledge graphs from the Web. To this end, we also discuss Google's knowledge vault project as an example of such combination.

Last synced 2026-08-22 14:19 UTC

• Generative Artificial Intelligence-Driven Enterprise Knowledge Base

  Journal of Organizational and End User Computing 2026 · 0 citations

• Design and Construction of a Multi-Relational Fitness Knowledge Graph for Semantic Exercise Representation

  Mathematics 2026 · 0 citations