21 search results - page 1 / 5 » Analyzing High-Dimensional Data by Subspace Validity |
ICDM
2003
IEEE
13 years 10 months ago
2003
IEEE
We are proposing a novel method that makes it possible to analyze high dimensional data with arbitrary shaped projected clusters and high noise levels. At the core of our method l...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
: Problem statement: Clustering has a number of techniques that have been developed in statistics, pattern recognition, data mining, and other fields. Subspace clustering enumerate...
DAWAK
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. In this paper, we present a new approach to indexing multidimensional data that is particularly suitable for the efficient incremental processing of nearest neighbor quer...
HAIS
2009
Springer
13 years 9 months ago
2009
Springer
Developing models and methods to manage data vagueness is a current effervescent research field. Some work has been done with supervised problems but unsupervised problems and unce...
CVPR
2005
IEEE
14 years 7 months ago
2005
IEEE
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...