Fast global k-means clustering using cluster membership and inequality

DOI10.1016/J.PATCOG.2009.11.021zbMATH Open1185.68600OpenAlexW2068959699MaRDI QIDQ962787FDOQ962787

Authors: 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

Recommendations

• Fast modified global \(k\)-means algorithm for incremental cluster construction
• Fast global \(k\)-means clustering based on local geometrical information
• An improved global \(K\)-means clustering algorithm
• Global optimality in \(k\)-means clustering
• Algorithms and Computation
• An efficient clustering algorithm based on local optimality of \(K\)-means
• Fast kernel \(k\)-means clustering using incomplete Cholesky factorization
• Modified global \(k\)-means algorithm for minimum sum-of-squares clustering problems
• A fast approximation scheme for low-dimensional \(k\)-means

zbMATH Keywords

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

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10)

Cites Work

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

Cited In (6)

• Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems
• A heuristic algorithm for solving the minimum sum-of-squares clustering problems
• k-means-g*: accelerating \(k\)-means clustering algorithm utilizing primitive geometric concepts
• A fast \(k\)-means clustering algorithm using cluster center displacement
• Fast modified global \(k\)-means algorithm for incremental cluster construction
• Fast global \(k\)-means clustering based on local geometrical information

This page was built for publication: Fast global \(k\)-means clustering using cluster membership and inequality

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