Stochastic K-means algorithm for vector quantization

DOI10.1016/S0167-8655(01)00021-6MaRDI QIDQ4795055zbMATHFDO

Authors Balazs Kövesi, Jean Marc Boucher, Samir Saoudi

Publication date 20 February 2003

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

zbMATH Keywords

vector quantizationstochastic methods\(K\)-means algorithm

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Computing methodologies and applications (68U99)

Recommendations

• \(k\)-means algorithm
• A classification EM algorithm for clustering and two stochastic versions
• Vector quantization by deterministic annealing
• On two extensions of the vector quantization scheme
• scientific article; zbMATH DE number 1820165

Cited in

(4)

• GAPS: A clustering method using a new point symmetry-based distance measure
• Faster and more robust point symmetry-based K-means algorithm
• \(K\)-harmonic means data clustering with simulated annealing heuristic
• Classification of binary vectors by using ΔSC distance to minimize stochastic complexity

This page was built for publication: Stochastic K-means algorithm for vector quantization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4795055)