An algorithm for multidimensional data clustering
- 1 June 1988
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Mathematical Software
- Vol. 14 (2) , 153-162
- https://doi.org/10.1145/45054.45056
Abstract
A new divisive algorithm for multidimensional data clustering is suggested. Based on the minimization of the sum-of-squared-errors, the proposed method produces much smaller quantization errors than the median-cut and mean-split algorithms. It is also observed that the solutions obtained from our algorithm are close to the local optimal ones derived by the k-means iterative procedure.Keywords
This publication has 6 references indexed in Scilit:
- K-Means-Type Algorithms: A Generalized Convergence Theorem and Characterization of Local OptimalityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1984
- Color image quantization for frame buffer displayACM SIGGRAPH Computer Graphics, 1982
- Multidimensional divide-and-conquerCommunications of the ACM, 1980
- Data Structures for Range SearchingACM Computing Surveys, 1979
- An Algorithm for Finding Best Matches in Logarithmic Expected TimeACM Transactions on Mathematical Software, 1977
- Constructing optimal binary decision trees is NP-completeInformation Processing Letters, 1976