30 search results - page 1 / 6 » Density-Connected Subspace Clustering for High-Dimensional D... |
SDM
2004
SIAM
13 years 6 months ago
2004
SIAM
Several application domains such as molecular biology and geography produce a tremendous amount of data which can no longer be managed without the help of efficient and effective ...
ICDM
2003
IEEE
13 years 10 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
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 ...
SDM
2009
SIAM
14 years 1 months ago
2009
SIAM
Identifying information-rich subsets in high-dimensional spaces and representing them as order revealing patterns (or trends) is an important and challenging research problem in m...
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...