30 search results - page 4 / 6 » Density-Connected Subspace Clustering for High-Dimensional D... |
ICDE
2003
IEEE
14 years 7 months ago
2003
IEEE
The notorious "dimensionality curse" is a well-known phenomenon for any multi-dimensional indexes attempting to scale up to high dimensions. One well known approach to o...
ICDM
2009
IEEE
13 years 3 months ago
2009
IEEE
Text classification poses some specific challenges. One such challenge is its high dimensionality where each document (data point) contains only a small subset of them. In this pap...
SDM
2009
SIAM
14 years 3 months ago
2009
SIAM
In high dimensional data, the general performance of traditional clustering algorithms decreases. This is partly because the similarity criterion used by these algorithms becomes ...
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...
WIRN
2005
Springer
13 years 11 months ago
2005
Springer
We present an algorithmic scheme for unsupervised cluster ensembles, based on randomized projections between metric spaces, by which a substantial dimensionality reduction is obtai...