436 search results - page 4 / 88 » Automatic Subspace Clustering of High Dimensional Data for D... |
SIGMOD
2002
ACM
14 years 5 months ago
2002
ACM
With the increased abilities for automated data collection made possible by modern technology, the typical sizes of data collections have continued to grow in recent years. In suc...
PAKDD
2009
ACM
14 years 7 days ago
2009
ACM
Abstract. Clustering high dimensional data with sparse features is challenging because pairwise distances between data items are not informative in high dimensional space. To addre...
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...
KDD
2001
ACM
14 years 5 months ago
2001
ACM
In this paper we present a method for clustering SAGE (Serial Analysis of Gene Expression) data to detect similarities and dissimilarities between different types of cancer on the...
SIGMOD
2000
ACM
13 years 9 months ago
2000
ACM
High dimensional data has always been a challenge for clustering algorithms because of the inherent sparsity of the points. Recent research results indicate that in high dimension...