165 search results - page 8 / 33 » Adaptive dimension reduction for clustering high dimensional... |
77
Voted
PR
2007
14 years 11 months ago
2007
Classical clustering algorithms are based on the concept that a cluster center is a single point. Clusters which are not compact around a single point are not candidates for class...
ICML
2004
IEEE
16 years 15 days ago
2004
IEEE
Many clustering algorithms fail when dealing with high dimensional data. Principal component analysis (PCA) is a popular dimensionality reduction algorithm. However, it assumes a ...
114
click to vote
EDBT
2000
ACM
15 years 4 months ago
2000
ACM
In high-dimensional query processing, the optimization of the logical page-size of index structures is an important research issue. Even very simple query processing techniques suc...
IDEAL
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. Normal mixture models are often used to cluster continuous data. However, conventional approaches for fitting these models will have problems in producing nonsingular es...
150
click to vote
SIGMOD
2002
ACM
15 years 12 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...