A fast \(k\)-means clustering algorithm using cluster center displacement
From MaRDI portal
Publication:2270719
DOI10.1016/j.patcog.2009.02.014zbMath1175.68367OpenAlexW2057536593MaRDI QIDQ2270719
Tsung-Jen Huang, Jim Z. C. Lai, Yi-Ching Liaw
Publication date: 29 July 2009
Published in: Pattern Recognition (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.patcog.2009.02.014
Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10)
Related Items (4)
Emulation of high-performance correlation-based quantum clustering algorithm for two-dimensional data on FPGA ⋮ Cooperative clustering ⋮ Quantization-based clustering algorithm ⋮ A novel fast heuristic to handle large-scale shape clustering
Cites Work
This page was built for publication: A fast \(k\)-means clustering algorithm using cluster center displacement