184 search results - page 19 / 37 » Random Projection for High Dimensional Data Clustering: A Cl... |
APVIS
2010
13 years 3 months ago
2010
In this paper, we present a novel three-stage process to visualize the structure of point clouds in arbitrary dimensions. To get insight into the structure and complexity of a dat...
SSDBM
2007
IEEE
14 years 2 months ago
2007
IEEE
In high dimensional data, clusters often only exist in arbitrarily oriented subspaces of the feature space. In addition, these so-called correlation clusters may have complex rela...
SIGMOD
2001
ACM
14 years 8 months ago
2001
ACM
In this paper, we investigate how to scale hierarchical clustering methods (such as OPTICS) to extremely large databases by utilizing data compression methods (such as BIRCH or ra...
ICDM
2007
IEEE
14 years 15 days ago
2007
IEEE
Recently the problem of dimensionality reduction (or, subspace learning) has received a lot of interests in many fields of information processing, including data mining, informati...
KDD
2003
ACM
14 years 9 months ago
2003
ACM
High dimensional directional data is becoming increasingly important in contemporary applications such as analysis of text and gene-expression data. A natural model for multivaria...