A simulated annealing‐based maximum‐margin clustering algorithm

Publisher:
Wiley
Publication Type:
Journal Article
Citation:
Computational Intelligence, 2019, 2018 pp. 1 - 19
Issue Date:
2019-01-01
Metrics:
Full metadata record
Files in This Item:
Filename Description Size
8534CBAD-E9A0-4259-A742-8557CD1FFBB0 AM.pdfAccepted Manuscript Version601.93 kB
Adobe PDF
Maximum‐margin clustering is an extension of the support vector machine (SVM) to clustering. It partitions a set of unlabeled data into multiple groups by finding hyperplanes with the largest margins. Although existing algorithms have shown promising results, there is no guarantee of convergence of these algorithms to global solutions due to the nonconvexity of the optimization problem. In this paper, we propose a simulated annealing‐based algorithm that is able to mitigate the issue of local minima in the maximum‐margin clustering problem. The novelty of our algorithm is twofold, ie, (i) it comprises a comprehensive cluster modification scheme based on simulated annealing, and (ii) it introduces a new approach based on the combination of k‐means++ and SVM at each step of the annealing process. More precisely, k‐means++ is initially applied to extract subsets of the data points. Then, an unsupervised SVM is applied to improve the clustering results. Experimental results on various benchmark data sets (of up to over a million points) give evidence that the proposed algorithm is more effective at solving the clustering problem than a number of popular clustering algorithms.
Please use this identifier to cite or link to this item: