474 search results - page 45 / 95 » Approximation Algorithms for Tensor Clustering |
PAMI
2011
13 years 2 months ago
2011
Spectral clustering algorithms have been shown to be more effective in finding clusters than some traditional algorithms such as k-means. However, spectral clustering suffers fro...
KDD
2003
ACM
14 years 8 months ago
2003
ACM
The goal of clustering is to identify distinct groups in a dataset. The basic idea of model-based clustering is to approximate the data density by a mixture model, typically a mix...
SIGMOD
2001
ACM
14 years 8 months ago
2001
ACM
In this paper, we investigate how to scale hierarchical clustering methods (such as OPTICS) to extremely large databases by utilizing data compression methods (such as BIRCH or ra...
PAMI
2010
13 years 6 months ago
2010
— We propose a randomized data mining method that finds clusters of spatially overlapping images. The core of the method relies on the min-Hash algorithm for fast detection of p...
EDBT
2004
ACM
14 years 8 months ago
2004
ACM
We present a novel anytime version of partitional clustering algorithm, such as k-Means and EM, for time series. The algorithm works by leveraging off the multi-resolution property...