436 search results - page 2 / 88 » Automatic Subspace Clustering of High Dimensional Data for D... |
DAGSTUHL
2007
13 years 6 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...
SDM
2009
SIAM
14 years 1 months ago
2009
SIAM
Subspace clustering and frequent itemset mining via “stepby-step” algorithms that search the subspace/pattern lattice in a top-down or bottom-up fashion do not scale to large ...
ICDM
2003
IEEE
13 years 9 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...
SDM
2012
SIAM
11 years 7 months ago
2012
SIAM
Clustering of high dimensional data streams is an important problem in many application domains, a prominent example being network monitoring. Several approaches have been lately ...
SDM
2004
SIAM
13 years 5 months ago
2004
SIAM
Clustering suffers from the curse of dimensionality, and similarity functions that use all input features with equal relevance may not be effective. We introduce an algorithm that...