Sciweavers

31 search results - page 2 / 7
» Low-rank matrix factorization with attributes
Sort
View
ICML
2010
IEEE
13 years 6 months ago
A Fast Augmented Lagrangian Algorithm for Learning Low-Rank Matrices
We propose a general and efficient algorithm for learning low-rank matrices. The proposed algorithm converges super-linearly and can keep the matrix to be learned in a compact fac...
Ryota Tomioka, Taiji Suzuki, Masashi Sugiyama, His...
KDD
2012
ACM
201views Data Mining» more  KDD 2012»
11 years 7 months ago
Low rank modeling of signed networks
Trust networks, where people leave trust and distrust feedback, are becoming increasingly common. These networks may be regarded as signed graphs, where a positive edge weight cap...
Cho-Jui Hsieh, Kai-Yang Chiang, Inderjit S. Dhillo...
CVPR
2008
IEEE
14 years 7 months ago
Spectrally optimal factorization of incomplete matrices
From the recovery of structure from motion to the separation of style and content, many problems in computer vision have been successfully approached by using bilinear models. The...
Pedro M. Q. Aguiar, João M. F. Xavier, Mark...
IPM
2006
151views more  IPM 2006»
13 years 5 months ago
Document clustering using nonnegative matrix factorization
A methodology for automatically identifying and clustering semantic features or topics in a heterogeneous text collection is presented. Textual data is encoded using a low rank no...
Farial Shahnaz, Michael W. Berry, V. Paul Pauca, R...
CVPR
2009
IEEE
13 years 9 months ago
Nonnegative Matrix Factorization with Earth Mover's Distance metric
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 ...
Roman Sandler, Michael Lindenbaum