Non‐alternating stochastic K ‐means based on probabilistic representation of solution space
Author:
Open Access
- 1 May 2019
- journal article
- research article
- Published by Institution of Engineering and Technology (IET) in Electronics Letters
- Vol. 55 (10) , 605-607
Abstract
A non‐alternating (NA) form of K ‐means is proposed to improve the performance for the most fundamental, yet highly non‐convex clustering problem. The motivation of this Letter is that the non‐convex nature of K ‐means can be better handled by stochastic optimisation. However, the alternating update of the Lloyd's algorithm prohibits an effective stochastic optimisation. In order to fully realise the idea, a probabilistic representation is provided for the solution space of K ‐means, which leads to a simple yet efficient NA update. Experiments show that the proposed method outperforms the existing variants, especially for large numbers of clusters, with reasonable time complexity.Keywords
Funding Information
- Ministry of Science ICT and Future Planning (No. GK17P0300)
- Hanyang University (HY‐2015‐N)
This publication has 5 references indexed in Scilit:
- Sparse Subspace Clustering: Algorithm, Theory, and ApplicationsIEEE Transactions on Pattern Analysis and Machine Intelligence, 2013
- Multi-PIE2008
- Normalized cuts and image segmentationIEEE Transactions on Pattern Analysis and Machine Intelligence, 2000
- Least squares quantization in PCMIEEE Transactions on Information Theory, 1982
- The Hungarian method for the assignment problemNaval Research Logistics Quarterly, 1955