One of the most important machine learning techniques include clustering of data into different clusters or categories. There are several decent algorithms and techniques that exist to perform clustering on small to medium scale data. In the era of Big Data and with applications being large-scale and data-intensive in nature, there is a significant increment in volume, variety and velocity of data in the form of log events produced by such applications. This makes the task of clustering of huge amounts of data more challenging and limited. In this paper, we present our approach of a parallel K-Medoids clustering algorithm based on MapReduce paradigm to be able to perform clustering on large-scale of data. We have kept our solution simple and feasible to be used to handle huge volume, variety and velocity of data. Another key uniqueness in our proposed algorithm is that it can achieve parallelism independent of the number of k clusters to be formed, unlike other related approaches. We have tested our algorithm on large amounts of data and on a real-life case-study.

Additional Metadata
Keywords Big Data, Clustering, K-Medoids, MapReduce
Persistent URL dx.doi.org/10.1109/ICMLA.2016.0089
Conference 15th IEEE International Conference on Machine Learning and Applications, ICMLA 2016
Citation
Shafiq, M. O, & Torunski, E. (Eric). (2017). A parallel K-Medoids algorithm for clustering based on MapReduce. In Proceedings - 2016 15th IEEE International Conference on Machine Learning and Applications, ICMLA 2016 (pp. 502–507). doi:10.1109/ICMLA.2016.0089