358 search results - page 23 / 72 » Rank Matrix Factorisation |
PSIVT
2009
Springer
15 years 5 months ago
2009
Springer
Abstract. A very compact algorithm is presented for fundamental matrix computation from point correspondences over two images. The computation is based on the strict maximum likeli...
CVPR
2009
IEEE
15 years 2 months 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 ...
SDM
2007
SIAM
15 years 5 days 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...
ICML
2003
IEEE
15 years 11 months ago
2003
IEEE
We study the common problem of approximating a target matrix with a matrix of lower rank. We provide a simple and efficient (EM) algorithm for solving weighted low-rank approximat...
103
click to vote
EMNLP
2004
15 years 4 days ago
2004
Multidocument extractive summarization relies on the concept of sentence centrality to identify the most important sentences in a document. Centrality is typically defined in term...