In this paper, we investigate the robust optimization for the minimum sum-of squares clustering (MSSC) problem. Each data point is assumed to belong to a box-type uncertainty set. Following the robust optimization paradigm, we obtain a robust formulation that can be interpreted as a combination of MSSC and k-median clustering criteria. A DCA-based algorithm is developed to solve the resulting robust problem. Preliminary numerical results on real datasets show that the proposed robust optimization approach is superior thanMSSC and k-median clustering approaches.
CITATION STYLE
Vo, X. T., Thi, H. A. L., & Dinh, T. P. (2016). Robust optimization for clustering. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9622, pp. 671–680). Springer Verlag. https://doi.org/10.1007/978-3-662-49390-8_65
Mendeley helps you to discover research relevant for your work.