Sciweavers

1301 search results - page 2 / 261
» Default Clustering from Sparse Data Sets
Sort
View
ICASSP
2010
IEEE
13 years 5 months ago
Clustering disjoint subspaces via sparse representation
Given a set of data points drawn from multiple low-dimensional linear subspaces of a high-dimensional space, we consider the problem of clustering these points according to the su...
Ehsan Elhamifar, René Vidal
CORR
2007
Springer
198views Education» more  CORR 2007»
13 years 5 months ago
Clustering and Feature Selection using Sparse Principal Component Analysis
In this paper, we study the application of sparse principal component analysis (PCA) to clustering and feature selection problems. Sparse PCA seeks sparse factors, or linear combi...
Ronny Luss, Alexandre d'Aspremont
ICASSP
2011
IEEE
12 years 9 months ago
A clustering based framework for dictionary block structure identification
Sparse representations over redundant dictionaries offer an efficient paradigm for signal representation. Recently block-sparsity has been put forward as a prior condition for so...
Ender M. Eksioglu
DATAMINE
1999
140views more  DATAMINE 1999»
13 years 5 months ago
A Scalable Parallel Algorithm for Self-Organizing Maps with Applications to Sparse Data Mining Problems
Abstract. We describe a scalable parallel implementation of the self organizing map (SOM) suitable for datamining applications involving clustering or segmentation against large da...
Richard D. Lawrence, George S. Almasi, Holly E. Ru...
ICPR
2006
IEEE
14 years 6 months ago
Learning Wormholes for Sparsely Labelled Clustering
Distance functions are an important component in many learning applications. However, the correct function is context dependent, therefore it is advantageous to learn a distance f...
Eng-Jon Ong, Richard Bowden