143 search results - page 7 / 29 » Probabilistic matrix tri-factorization |
SIGIR
2005
ACM
14 years 1 months ago
2005
ACM
Non-negative Matrix Factorization (NMF, [5]) and Probabilistic Latent Semantic Analysis (PLSA, [4]) have been successfully applied to a number of text analysis tasks such as docum...
MP
2011
13 years 2 months ago
2011
Minimizing the rank of a matrix subject to constraints is a challenging problem that arises in many applications in machine learning, control theory, and discrete geometry. This c...
KDD
2009
ACM
14 years 2 months ago
2009
ACM
One-Class Collaborative Filtering (OCCF) is a task that naturally emerges in recommender system settings. Typical characteristics include: Only positive examples can be observed, ...
ICCV
2005
IEEE
14 years 1 months ago
2005
IEEE
We derive the clustering problem from first principles showing that the goal of achieving a probabilistic, or ”hard”, multi class clustering result is equivalent to the algeb...
SIGIR
2009
ACM
14 years 2 months ago
2009
ACM
With the sheer growth of online user data, it becomes challenging to develop preference learning algorithms that are sufficiently flexible in modeling but also affordable in com...