Faster and more robust point symmetry-based K-means algorithm

DOI10.1016/j.patcog.2005.09.015zbMath1118.68136OpenAlexW1974919496MaRDI QIDQ854200

N. E. Zubov

Publication date: 7 December 2006

Published in: Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.patcog.2005.09.015

zbMATH Keywords

robustnessclusteringpoint symmetryK-means algorithmspeedupinter-clusterintra-cluster

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10)

Related Items (2)

Quantization-based clustering algorithm ⋮ Enhancing point symmetry-based distance for data clustering

Cites Work

• Efficient algorithms for agglomerative hierarchical clustering methods
• Multidimensional binary search trees used for associative searching
• Stochastic K-means algorithm for vector quantization
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Faster and more robust point symmetry-based K-means algorithm