A Review of Relational Machine Learning for Knowledge Graphs

Обзор реляционного машинного обучения для графов знаний
Volker Tresp C, Kevin P. Murphy, Maximilian Nickel, Evgeniy Gabrilovich
2015-12-17

knowledge graph constructionknowledge graphsrelational machine learningstatistical relational modelstensor factorization
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.
1
Combining latent feature models with observable pattern-based models improves modeling power while reducing computational cost.
2
Google’s Knowledge Vault is discussed as an example of combining graph modeling with Web-scale information extraction.
3
Graph-based statistical models can be integrated with text-based information extraction to automatically construct knowledge graphs from Web content.
4
Relational machine learning models can be trained on large knowledge graphs to predict missing facts, equivalent to predicting new graph edges.
5
Scalable statistical relational models fall into two major categories: latent feature approaches, including tensor factorization and multiway neural networks, and observable graph-pattern mining.

Large knowledge graphs (graph-structured relational data)

statistical relational modeling for predicting new facts (edges), including latent-feature and observable-pattern models and their combination

Publication Details
Publication Date
2015-12-17
Journal
Publisher
ISSN
Cited by
1790
Access Type
Author Information
Authors
Volker Tresp C
Kevin P. Murphy
Maximilian Nickel
Evgeniy Gabrilovich
Explore further
Open the scid.ai AI chat with a ready-made request: it will find papers on a similar topic and help build a literature review.
Find similar papers in the chat →
Make a presentation
100%