2014 · 23 citations · 7 references
ComputingComputer ScienceInformation TechnologyAlgorithmsData MiningParallel ComputingData ParallelismDistributed ComputingDistributed Data ProcessingNearest Neighbor SearchParallel SearchingScalable Data MiningClustering For Large-scale DataComplexityDistributed Data MiningMapreduceMapreduce AlgorithmsParallel ClusteringReduceRobustness
When there are noises and outliers in the data, the traditional k-medoids algorithm has good robustness, however, that algorithm is only suitable for medium and small data set for its complex calculation. MapReduce is a programming model for processing mass data and suitable for parallel computing of big data. Therefore, this paper proposed an improved algorithm based on MapReduce and optimal search of medoids to cluster big data. Firstly, according to the basic properties of triangular geometry, this paper reduced calculation of distances among data elements to help search medoids quickly and reduce the calculation complexity of k-medoids. Secondly, according to the working principle of MapReduce, Map function is responsible for calculating the distances between each data element and medoids, and assigns data elements to their clusters; Reduce function will check for the results from Map function, search new medoids by the optimal search strategy of medoids again, and return new results to Map function in the next MapReduce process. The experiment results showed that our algorithm in this paper has high efficiency and good effectiveness.
7
A simple and fast algorithm for K-medoids clustering
Hae-Sang Park, Chi‐Hyuck Jun · Expert Systems with Applications · 2008 · 2.1K citations
Comparing clusterings—an information based distance
Marina Meilă · Journal of Multivariate Analysis · 2006 · 1.6K citations
Clustering by means of medoids
L. Kaufman, Peter J. Rousseeuw · Lirias (KU Leuven) · 1987 · 1.2K citations
Fast clustering using MapReduce
Alina Ene, Sungjin Im, Benjamin Moseley · 2011 · 215 citations