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 datasets. 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.
%0 Generic
%1 nickel2015review
%A Nickel, Maximilian
%A Murphy, Kevin
%A Tresp, Volker
%A Gabrilovich, Evgeniy
%D 2015
%K fact-checking graph knowledge link prediction semantic
%R 10.1109/JPROC.2015.2483592
%T A Review of Relational Machine Learning for Knowledge Graphs
%U http://arxiv.org/abs/1503.00759
%X 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 datasets. 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.
@misc{nickel2015review,
abstract = {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 datasets. 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.},
added-at = {2018-06-04T22:59:10.000+0200},
author = {Nickel, Maximilian and Murphy, Kevin and Tresp, Volker and Gabrilovich, Evgeniy},
biburl = {https://www.bibsonomy.org/bibtex/2ff46c637d2bc4bca4c4ba37c12370be1/psavov},
description = {1503.00759.pdf},
doi = {10.1109/JPROC.2015.2483592},
interhash = {c7a89d5dbb5f3aa7cb73ada95e88e451},
intrahash = {ff46c637d2bc4bca4c4ba37c12370be1},
keywords = {fact-checking graph knowledge link prediction semantic},
note = {cite arxiv:1503.00759Comment: To appear in Proceedings of the IEEE},
timestamp = {2018-06-04T22:59:10.000+0200},
title = {A Review of Relational Machine Learning for Knowledge Graphs},
url = {http://arxiv.org/abs/1503.00759},
year = 2015
}