298 search results - page 8 / 60 » Subspace Clustering of High Dimensional Data |
93
Voted
KDD
2001
ACM
16 years 23 days 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...
COLT
2010
Springer
14 years 10 months ago
2010
Springer
We consider the dimensionality-reduction problem (finding a subspace approximation of observed data) for contaminated data in the high dimensional regime, where the number of obse...
168
click to vote
VLDB
1999
ACM
1999
ACM
Optimal Grid-Clustering: Towards Breaking the Curse of Dimensionality in High-Dimensional Clustering
15 years 4 months ago
Many applications require the clustering of large amounts of high-dimensional data. Most clustering algorithms, however, do not work e ectively and e ciently in highdimensional sp...
110
click to vote
ACMSE
2010
ACM
14 years 10 months ago
2010
ACM
This paper defines and discusses a new problem in the area of subspace clustering. It defines the problem of mining closed subspace clusters. This new concept allows for the culli...
120
Voted
DAGSTUHL
2007
15 years 1 months ago
2007
Abstract. Increasingly large multimedia databases in life sciences, ecommerce, or monitoring applications cannot be browsed manually, but require automatic knowledge discovery in d...