Distributed and multi-core version of k-means algorithm. (15th May 2019)

• Record Type: Journal Article
• Authors: Savvas, Ilias K.; Tselios, Dimitrios; Garani, Georgia
• Is Part Of: International journal of grid and utility computing. Volume 10:Number 3(2019)
• Page Start: 283
• Page End: 291
• Publication Date: 2019-05-15
• Subjects: parallel algorithm -- clustering -- multi-core -- distributed -- k-means -- OpenMP -- MPI; Electronic data processing -- Distributed processing -- Periodicals; Electronic commerce -- Management -- Computer programs -- Periodicals; 004.605
• Languages: English
• ISSNs: 1741-847X

Abstract

Nowadays, huge quantities of data are generated by billions of machines and devices. Numerous methods have been employed, in order to make use of this valuable resource, some of them are altered versions of established known algorithms. One of the most seminal methods, in order to mine from data sources, is clustering, and k-means is a key algorithm which forms clusters of data according to a set of attributes. However, its main shortcoming is the high computational complexity which proves the k-means is very inefficient to perform on big data sets. Although k-means is a very well utilised algorithm, a functional distributed variant combining the multi-core power of contemporary machines has not been accepted yet by researchers. In this work, a three phase distributed/multi-core version of k-means and the analysis of its results are presented. The obtained experimental results are in line with the theoretical outcomes and prove the correctness, efficiency, and scalability of the proposed technique.