A novel near-parallel version of k-means algorithm for n-dimensional data objects using MPI Online publication date: Mon, 04-Jul-2016
by Ilias K. Savvas; Georgia N. Sofianidou
International Journal of Grid and Utility Computing (IJGUC), Vol. 7, No. 2, 2016
Abstract: Nowadays, the growth of data is exponential leading to colossal amounts of information. To explore this huge amount of data, new fast algorithms must be discovered or old ones may be redesigned. One of the most useful techniques in order to extract information from data pools is clustering, and k-means is one of them. Its main disadvantage is its computational complexity, which makes it difficult to apply on big data-sets. In this study, a fully parallel version of the k-means for one-dimensional objects is presented, and in addition, a near-parallel approach for n-dimensional objects is explored. The experimental results obtained for one-dimensional data are in-line with the theoretical outcome and prove both its correctness and effectiveness while for n-dimensional objects they are so close to the outcome of the original one that either could be accepted as they are, or could be used as the initial solution for it.
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 Grid and Utility Computing (IJGUC):
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