1971 search results - page 161 / 395 » A clustering method that uses lossy aggregation of data |
CVPR
2011
IEEE
13 years 4 months ago
2011
IEEE
We consider the problem of fitting one or more subspaces to a collection of data points drawn from the subspaces and corrupted by noise/outliers. We pose this problem as a rank m...
APVIS
2008
13 years 10 months ago
2008
Effectively visualizing complex node-link graphs which depict relationships among data nodes is a challenging task due to the clutter and occlusion resulting from an excessive amo...
ICDM
2003
IEEE
2003
IEEE
Clustering of Time Series Subsequences is Meaningless: Implications for Previous and Future Research
14 years 2 months ago
Given the recent explosion of interest in streaming data and online algorithms, clustering of time series subsequences, extracted via a sliding window, has received much attention...
ICPR
2008
IEEE
14 years 3 months ago
2008
IEEE
Nonnegative matrix factorization (NMF) has been shown to be an efficient clustering tool. However, NMF`s batch nature necessitates recomputation of whole basis set for new samples...
CVPR
2009
IEEE
15 years 4 months ago
2009
IEEE
We propose a method based on sparse representation
(SR) to cluster data drawn from multiple low-dimensional
linear or affine subspaces embedded in a high-dimensional
space. Our ...