:: Volume 5, Issue 1 (5-2014) ::
IJOR 2014, 5(1): 1-14 Back to browse issues page
An Incremental DC Algorithm for the Minimum Sum-of-Squares Clustering
A.M. Bagirov
Abstract:   (9428 Views)
Here, an algorithm is presented for solving the minimum sum-of-squares clustering problems using their difference of convex representations. The proposed algorithm is based on an incremental approach and applies the well known DC algorithm at each iteration. The proposed algorithm is tested and compared with other clustering algorithms using large real world data sets.
Keywords: Clustering, Nonsmooth optimization, Nonconvex optimization, Incremental algorithms
Full-Text [PDF 1146 kb]   (6826 Downloads)    
Type of Study: Original |
Received: 2015/04/27 | Accepted: 2015/06/16 | Published: 2015/09/16


XML     Print



Volume 5, Issue 1 (5-2014) Back to browse issues page