Relational Learning as Collective Matrix Factorization

author: Ajit Singh, The Auton Lab, School of Computer Science, Carnegie Mellon University
published: Feb. 14, 2008,   recorded: February 2008,   views: 1155


Related content

Report a problem or upload files

If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Lecture popularity: You need to login to cast your vote.
  Delicious Bibliography


We present a unified view of matrix factorization models, including singular value decompositions, non-negative matrix factorization, probabilistic latent semantic indexing, and generalizations of these models to exponential families and non-regular Bregman divergences. One can model relational data as a set of matrices, where each matrix represents the value of a relation between two entity-types. Instead of a single matrix, relational data is represented as a set of matrices with shared dimensions and tied low-rank representation. Our example domain is augmented collaborative filtering, where both user ratings and side information about items are available. To predict the value of a relation, we extend Bregman matrix factorization to a set of related matrices. Using an alternating minimization scheme, we show the existence of a practical Newton step. The use of stochastic second-order methods for large matrices is also covered.

See Also:

Download slides icon Download slides: cmulls08_singh_rlm.pdf (572.7┬áKB)

Help icon Streaming Video Help

Link this page

Would you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !

Reviews and comments:

Comment1 Fawad, July 4, 2008 at 11:54 p.m.:

Unfortunately, the slides are poorly designed and the talk too fast. You should simplify the talk and try to spend some time and really explain each slide instead of running through them which makes it quite hard to follow.

I am a PhD student working on document clustering/ classification (also worked on PCA and SVD) and even I am finding it hard to follow the talk.

Very interesting topic that I always wanted to find a lecture.

Write your own review or comment:

make sure you have javascript enabled or clear this field: