824 search results - page 9 / 165 » Weighted Low-Rank Approximations |
CORR
2006
Springer
13 years 8 months ago
2006
Springer
We develop a new collaborative filtering (CF) method that combines both previously known users' preferences, i.e. standard CF, as well as product/user attributes, i.e. classi...
ALGORITHMICA
2005
13 years 8 months ago
2005
A cycle cover of a graph is a spanning subgraph each node of which is part of exactly one simple cycle. A k-cycle cover is a cycle cover where each cycle has length at least k. Gi...
SDM
2007
SIAM
13 years 9 months ago
2007
SIAM
Given a large sparse graph, how can we find patterns and anomalies? Several important applications can be modeled as large sparse graphs, e.g., network traffic monitoring, resea...
SIAMSC
2008
13 years 8 months ago
2008
In this study, nonnegative matrix factorization is recast as the problem of approximating a polytope on the probability simplex by another polytope with fewer facets. Working on th...
CVPR
2009
IEEE
14 years 9 days ago
2009
IEEE
Nonnegative Matrix Factorization (NMF) approximates a given data matrix as a product of two low rank nonnegative matrices, usually by minimizing the L2 or the KL distance between ...