Active Learning and Search on Low-Rank Matrices - Robotics Institute Carnegie Mellon University

Active Learning and Search on Low-Rank Matrices

D. Sutherland, B. Poczos, and J. Schneider
Conference Paper, Proceedings of 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD '13), pp. 212 - 220, August, 2013

Abstract

Collaborative prediction is a powerful technique, useful in domains from recommender systems to guiding the scientific discovery process. Low-rank matrix factorization is one of the most powerful tools for collaborative prediction. This work presents a general approach for active collaborative prediction with the Probabilistic Matrix Factorization model. Using variational approximations or Markov chain Monte Carlo sampling to estimate the posterior distribution over models, we can choose query points to maximize our understanding of the model, to best predict unknown elements of the data matrix, or to find as many "positive" data points as possible. We evaluate our methods on simulated data, and also show their applicability to movie ratings prediction and the discovery of drug-target interactions.

BibTeX

@conference{Sutherland-2013-119790,
author = {D. Sutherland and B. Poczos and J. Schneider},
title = {Active Learning and Search on Low-Rank Matrices},
booktitle = {Proceedings of 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD '13)},
year = {2013},
month = {August},
pages = {212 - 220},
}