Sciweavers

502 search results - page 7 / 101
» Sparse Subspace Clustering
Sort
View
CVPR
2004
IEEE
16 years 1 months ago
A New GPCA Algorithm for Clustering Subspaces by Fitting, Differentiating and Dividing Polynomials
We consider the problem of clustering data lying on multiple subspaces of unknown and possibly different dimensions. We show that one can represent the subspaces with a set of pol...
Jacopo Piazzi, René Vidal, Yi Ma
CISS
2010
IEEE
14 years 3 months ago
Average case analysis of sparse recovery from combined fusion frame measurements
—Sparse representations have emerged as a powerful tool in signal and information processing, culminated by the success of new acquisition and processing techniques such as Compr...
Petros Boufounos, Gitta Kutyniok, Holger Rauhut
CORR
2010
Springer
219views Education» more  CORR 2010»
14 years 12 months ago
Clustering high dimensional data using subspace and projected clustering algorithms
: Problem statement: Clustering has a number of techniques that have been developed in statistics, pattern recognition, data mining, and other fields. Subspace clustering enumerate...
Rahmat Widia Sembiring, Jasni Mohamad Zain, Abdull...
CVPR
2005
IEEE
16 years 1 months ago
Subspace Analysis Using Random Mixture Models
In [1], three popular subspace face recognition methods, PCA, Bayes, and LDA were analyzed under the same framework and an unified subspace analysis was proposed. However, since t...
Xiaogang Wang, Xiaoou Tang
EDM
2010
174views Data Mining» more  EDM 2010»
15 years 1 months ago
Clustering Student Learning Activity Data
We show a variety of ways to cluster student activity datasets using different clustering and subspace clustering algorithms. Our results suggest that each algorithm has its own st...
Haiyun Bian