Relational learning analyzes the probabilistic constraints between the attributes of entities and relationships. We extend the expressiveness of relational models by introducing for each entity (or object) an infinitedimensional latent variable as part of a Dirichlet process (DP) mixture model. We discuss inference in the model, which is based on a DP Gibbs sampler, i.e., the Chinese restaurant process. We extend the Chinese restaurant process to be applicable to relational modeling. We discuss how information is propagated in the network of latent variables, reducing the necessity for extensive structural learning. In the context of a recommendation engine our approach realizes a principled solution for recommendations based on features of items, features of users and relational information. Our approach is evaluated in three applications: a recommendation system based on the Movie-Lens data set, the prediction of gene function using relational information and a medical recommendation system.
10
Analysis of recommendation algorithms for e-commerce
Badrul Sarwar, George Karypis, Joseph A. Konstan et al. · 2000 · 1.8K citations
The author-topic model for authors and documents
Michal Rosen‐Zvi, Thomas Griffiths, Mark Steyvers et al. · Uncertainty in Artificial Intelligence · 2004 · 1.3K citations
Learning probabilistic models of link structure
Lisa Getoor, Nir Friedman, Daphne Koller et al. · 2003 · 239 citations