Probabilistic clustering by random swap algorithm

Proceedings - International Conference on Pattern Recognition

Volumn , Issue , 2008, Pages

  Franti, Pasi ^a   Virmajoki, Olli ^a   Hautamaki, Ville ^a  

^a UNIVERSITY OF EASTERN FINLAND   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

PATTERN RECOGNITION;

CLUSTER CENTROIDS; LINEAR DEPENDENCY; NUMBER OF CLUSTERS; NUMBER OF DATUM; PROBABILISTIC CLUSTERING; PROBABILITY OF FAILURE; PROCESSING TIME;

CLUSTERING ALGORITHMS;

EID: 77957934034     PISSN: 10514651     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/icpr.2008.4761798     Document Type: Conference Paper

References (9)

1. A. Likas, N. Vlassis and J.J. Verbeek. The global k-means clustering algorithm. Pattern Recognition 36:451-461, 2003.
2. P. Fränti, J. Kivijärvi and O. Nevalainen. Tabu search algorithm for codebook generation in VQ. Pattern Recognition, 31(8):1139-1148, August 1998.
3. P. Fränti and J. Kivijärvi. Randomised local search algorithm for the clustering problem. Pattern Analysis and Applications, 3(4):358-369, 2000.
4. T. Kanungo, D.M. Mount, N. Netanyahu, C. Piatko, R. Silverman, and A.Y. Wu. A local search approximation algorithm for k-means clustering. Computational Geometry, 28(1):89-112, May 2004.
5. V. Pestov, "On the geometry of similarity search: dimensionality curse and concentration of measure", Information Processing Letters, vol. 73, p. 4751, 2000.
6. T. Kaukoranta, P. Fränti and O. Nevalainen. A fast exact GLA based on code vector activity detection. IEEE Trans. Image Proc, 9(8):1337-1342, 2000.
7. P. Fränti and O. Virmajoki. Iterative shrinking method for clustering problems. Pattern Recognition, 39(5):761-765, May 2006.
8. K.-L. Chung and J.-S. Lin. Faster and more robust point symmetry-based k-means algorithm. Pattern Recognition, 40(2):410-422, February 2007.
9. P. Fränti, T. Kaukoranta, D.-F. Shen and K.-S. Chang. Fast and memory efficient implementation of the exact PNN. IEEE Trans. Image Proc., 9(5):773-777, 2000.