Sciweavers

358 search results - page 22 / 72
» Rank Matrix Factorisation
Sort
View
SIGKDD
2010
151views more  SIGKDD 2010»
14 years 5 months 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
ICPR
2008
IEEE
15 years 5 months ago
Incremental clustering via nonnegative matrix factorization
Nonnegative matrix factorization (NMF) has been shown to be an efficient clustering tool. However, NMF`s batch nature necessitates recomputation of whole basis set for new samples...
Serhat Selcuk Bucak, Bilge Günsel
ECCV
2002
Springer
16 years 18 days ago
Generalized Rank Conditions in Multiple View Geometry with Applications to Dynamical Scenes
In this paper, the geometry of a general class of projections from ??? to ?! is examined, as a generalization of classic multiple view geometry in computer vision. It is shown that...
Kun Huang, Robert M. Fossum, Yi Ma
WWW
2003
ACM
15 years 11 months ago
Extrapolation methods for accelerating PageRank computations
We present a novel algorithm for the fast computation of PageRank, a hyperlink-based estimate of the "importance" of Web pages. The original PageRank algorithm uses the ...
Sepandar D. Kamvar, Taher H. Haveliwala, Christoph...
JACM
2011
98views more  JACM 2011»
14 years 5 months ago
Randomized algorithms for estimating the trace of an implicit symmetric positive semi-definite matrix
We analyze the convergence of randomized trace estimators. Starting at 1989, several algorithms have been proposed for estimating the trace of a matrix by 1 M M i=1 zT i Azi, where...
Haim Avron, Sivan Toledo