Fast global \(k\)-means clustering using cluster membership and inequality

DOI10.1016/j.patcog.2009.11.021zbMath1185.68600OpenAlexW2068959699MaRDI QIDQ962787

Jim Z. C. Lai, Tsung-Jen Huang

Publication date: 7 April 2010

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

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

zbMATH Keywords

knowledge discoverynearest-neighbor searchglobal \(k\)-means clustering

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10)

Related Items

Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems, Fast global \(k\)-means clustering based on local geometrical information, A heuristic algorithm for solving the minimum sum-of-squares clustering problems

Cites Work

• Unnamed Item
• Fast \(k\)-nearest-neighbor search based on projection and triangular inequality
• Modified global \(k\)-means algorithm for minimum sum-of-squares clustering problems
• Improvement of the \(k\)-means clustering filtering algorithm
• Artifact reduction of JPEG coded images using mean-removed classified vector quantization
• A fast VQ codebook generation algorithm using codeword displacement
• Optimality of KLT for High-Rate Transform Coding of Gaussian Vector-Scale Mixtures: Application to Reconstruction, Estimation, and Classification
• Image restoration of compressed image using classified vector quantization