Acceleration of the K-means algorithm by removing stable items Online publication date: Thu, 28-Sep-2017
by Adriana Mexicano; Ricardo Rodriguez Jorge; Pascual Montes; Joaquín Pérez
International Journal of Space-Based and Situated Computing (IJSSC), Vol. 7, No. 2, 2017
Abstract: This work presents an approach for enhancing the K-means algorithm in the classification phase. The approach consists in a heuristic, which at each time that an object remains in the same group, between the current and the previous iteration, it is identified as stable and it is removed from computations in the classification phase in the current and subsequent iterations. This approach helps to reduce the execution time of the standard version. It can be useful in big data applications. For evaluating computational results, both the standard and the proposal were implemented and executed using three synthetic and seven well-known real instances. After testing both versions, it was possible to validate that the proposed approach spends less time than the standard one. The best result was obtained for the transactions instance when it was grouped into 200 clusters, achieving a time reduction of 90.1% with a reduction in quality of 3.97%.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Space-Based and Situated Computing (IJSSC):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook