Sciweavers

59 search results - page 6 / 12
» Efficient Nonnegative Matrix Factorization with Random Proje...
Sort
View
ECML
2005
Springer
13 years 9 months ago
Clustering and Metaclustering with Nonnegative Matrix Decompositions
Although very widely used in unsupervised data mining, most clustering methods are affected by the instability of the resulting clusters w.r.t. the initialization of the algorithm ...
Liviu Badea
ICCV
2005
IEEE
14 years 9 months ago
Learning Non-Negative Sparse Image Codes by Convex Programming
Example-based learning of codes that statistically encode general image classes is of vital importance for computational vision. Recently, non-negative matrix factorization (NMF) ...
Christoph Schnörr, Matthias Heiler
CVPR
2006
IEEE
14 years 9 months ago
Learning Semantic Patterns with Discriminant Localized Binary Projections
In this paper, we present a novel approach to learning semantic localized patterns with binary projections in a supervised manner. The pursuit of these binary projections is refor...
Shuicheng Yan, Tianqiang Yuan, Xiaoou Tang
CVPR
1999
IEEE
13 years 11 months ago
Efficient Iterative Solution to M-View Projective Reconstruction Problem
We propose an efficient solution to the general M-view projective reconstruction problem, using matrix factorization and iterative least squares. The method can accept input with ...
Qian Chen, Gérard G. Medioni
CORR
2010
Springer
92views Education» more  CORR 2010»
13 years 6 months ago
Random Projections for $k$-means Clustering
This paper discusses the topic of dimensionality reduction for k-means clustering. We prove that any set of n points in d dimensions (rows in a matrix A ∈ Rn×d ) can be project...
Christos Boutsidis, Anastasios Zouzias, Petros Dri...