Sciweavers

34 search results - page 6 / 7
» Binomial Matrix Factorization for Discrete Collaborative Fil...
Sort
View
DEBU
2008
165views more  DEBU 2008»
13 years 5 months ago
A Survey of Attack-Resistant Collaborative Filtering Algorithms
With the increasing popularity of recommender systems in commercial services, the quality of recommendations has increasingly become an important to study, much like the quality o...
Bhaskar Mehta, Thomas Hofmann
SIAMMAX
2010
164views more  SIAMMAX 2010»
13 years 16 days ago
Uniqueness of Low-Rank Matrix Completion by Rigidity Theory
The problem of completing a low-rank matrix from a subset of its entries is often encountered in the analysis of incomplete data sets exhibiting an underlying factor model with app...
Amit Singer, Mihai Cucuringu
TIT
2010
130views Education» more  TIT 2010»
13 years 15 days ago
The power of convex relaxation: near-optimal matrix completion
This paper is concerned with the problem of recovering an unknown matrix from a small fraction of its entries. This is known as the matrix completion problem, and comes up in a gr...
Emmanuel J. Candès, Terence Tao
SIGKDD
2010
151views more  SIGKDD 2010»
13 years 16 days ago
Limitations of matrix completion via trace norm minimization
In recent years, compressive sensing attracts intensive attentions in the field of statistics, automatic control, data mining and machine learning. It assumes the sparsity of the ...
Xiaoxiao Shi, Philip S. Yu
RECSYS
2010
ACM
13 years 6 months ago
Recommending based on rating frequencies
Since the development of the comparably simple neighborhood-based methods in the 1990s, a plethora of techniques has been developed to improve various aspects of collaborative fil...
Fatih Gedikli, Dietmar Jannach