Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Stochastic K-means algorithm for vector quantization

From MaRDI portal
Publication:4795055
Jump to:navigation, search

DOI10.1016/S0167-8655(01)00021-6zbMATH Open1010.68906MaRDI QIDQ4795055FDOQ4795055


Authors: Balazs Kövesi, Jean Marc Boucher, Samir Saoudi Edit this on Wikidata


Publication date: 20 February 2003

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





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


zbMATH Keywords

vector quantizationstochastic methods\(K\)-means algorithm


Mathematics Subject Classification ID

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



Cited In (4)

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





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)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4795055&oldid=19094778"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 8 February 2024, at 00:30. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki