A FAST IMPLEMENTATION OF THE ISODATA CLUSTERING ALGORITHM
From MaRDI portal
Recommendations
Cites work
- A central limit theorem for k-means clustering
- A local search approximation algorithm for \(k\)-means clustering
- A near-linear algorithm for the planar 2-center problem
- An Algorithm for Finding Best Matches in Logarithmic Expected Time
- An optimal algorithm for approximate nearest neighbor searching fixed dimensions
- Approximation algorithms for NP-hard problems.
- Clustering motion
- Clustering to minimize the maximum intercluster distance
- Finding Groups in Data
- How fast is the \(k\)-means method?
- scientific article; zbMATH DE number 41467 (Why is no real title available?)
- scientific article; zbMATH DE number 47593 (Why is no real title available?)
- scientific article; zbMATH DE number 3470045 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3249395 (Why is no real title available?)
- Least squares quantization in PCM
- Local Search Heuristics for k-Median and Facility Location Problems
- Multidimensional binary search trees used for associative searching
- On approximate geometric \(k\)-clustering
- The discrete 2-center problem
Cited in
(7)- Unsupervised learning by cluster quality optimization
- scientific article; zbMATH DE number 1692446 (Why is no real title available?)
- Fast k-means image quantization algorithm and its application to iris segmentation
- Grouping objects in multi-band images using an improved eigenvector-based algorithm
- Data retrieving from heterogeneous wireless sensor network nodes using uavs
- A multi-objective clustering approach based on different clustering measures combinations
- Quantization-based clustering algorithm
This page was built for publication: A FAST IMPLEMENTATION OF THE ISODATA CLUSTERING ALGORITHM
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3430335)