%A Kazemi,Seyed Mehran
%A Poole,David
%D 2018
%J Frontiers in Robotics and AI
%C
%F
%G English
%K Statistical relational artificial intelligence,relational learning,Weighted Rule Learning,Graph Random Walk,Relational Logistic Regression,Path Ranking Algorithm
%Q
%R 10.3389/frobt.2018.00008
%W
%L
%M
%P
%7
%8 2018-February-19
%9 Original Research
%+ Seyed Mehran Kazemi,Laboratory of Computational Intelligence, Computer Science Department, University of British Columbia,Canada,smkazemi@cs.ubc.ca
%#
%! Bridging Weighted Rules and Graph Random Walks for Statistical Relational Models
%*
%<
%T Bridging Weighted Rules and Graph Random Walks for Statistical Relational Models
%U https://www.frontiersin.org/article/10.3389/frobt.2018.00008
%V 5
%0 JOURNAL ARTICLE
%@ 2296-9144
%X The aim of statistical relational learning is to learn statistical models from relational or graph-structured data. Three main statistical relational learning paradigms include weighted rule learning, random walks on graphs, and tensor factorization. These paradigms have been mostly developed and studied in isolation for many years, with few works attempting at understanding the relationship among them or combining them. In this article, we study the relationship between the path ranking algorithm (PRA), one of the most well-known relational learning methods in the graph random walk paradigm, and relational logistic regression (RLR), one of the recent developments in weighted rule learning. We provide a simple way to normalize relations and prove that relational logistic regression using normalized relations generalizes the path ranking algorithm. This result provides a better understanding of relational learning, especially for the weighted rule learning and graph random walk paradigms. It opens up the possibility of using the more flexible RLR rules within PRA models and even generalizing both by including normalized and unnormalized relations in the same model.