On the lower bound of local optimums in k-means algorithms

Author

Zhenjie ZHANG
Bing Tian DAI, Singapore Management UniversityFollow
Anthony K.H. TUNG

Publication Type

Conference Proceeding Article

Version

submittedVersion

Publication Date

12-2006

Discipline

Databases and Information Systems

Publication

Proceedings of Sixth International Conference on Data Mining, Hong Kong, 2006, December 18-22

First Page

775

Last Page

786

Identifier

10.1109/ICDM.2006.118

Publisher

Los Alamitos

City or Country

IEEE Computer Society

Citation

ZHANG, Zhenjie; DAI, Bing Tian; and TUNG, Anthony K.H.. On the lower bound of local optimums in k-means algorithms. (2006). Proceedings of Sixth International Conference on Data Mining, Hong Kong, 2006, December 18-22. 775-786.
Available at: https://ink.library.smu.edu.sg/sis_research/3757

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial-No Derivative Works 4.0 International License.

Additional URL

https://doi.org/10.1109/ICDM.2006.118