A FAST IMPLEMENTATION OF THE ISODATA CLUSTERING ALGORITHM

DOI10.1142/S0218195907002252zbMath1118.65015OpenAlexW2137446479MaRDI QIDQ3430335

Nargess Memarsadeghi, David M. Mount, Jacqueline le Moigne, Nathan S. Netanyahu

Publication date: 21 March 2007

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218195907002252

zbMATH Keywords

numerical examplesimage processingfiltering\(k\)-meansremote sensing\(kd\)-trees

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Geostatistics (86A32)

Related Items

Data retrieving from heterogeneous wireless sensor network nodes using uavs, Unsupervised learning by cluster quality optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A local search approximation algorithm for \(k\)-means clustering
• Clustering to minimize the maximum intercluster distance
• A central limit theorem for k-means clustering
• The discrete 2-center problem
• A near-linear algorithm for the planar 2-center problem
• On approximate geometric \(k\)-clustering
• How fast is the \(k\)-means method?
• Clustering motion
• An optimal algorithm for approximate nearest neighbor searching fixed dimensions
• Finding Groups in Data
• Multidimensional binary search trees used for associative searching
• An Algorithm for Finding Best Matches in Logarithmic Expected Time
• Local Search Heuristics for k-Median and Facility Location Problems
• Least squares quantization in PCM