Distributed K-Median Clustering with Application to Image Clustering
Aiyesha Ma, Ishwar K. Sethi · 2007
Developing algorithms suitable for distributed environments is important as data becomes more distributed. This paper proposes a distributed KMedian clustering algorithm for use in a distributed environment with centralized server, such as the Napster model in a peer-to-peer environment. Several approximate methods for computing the median in a distributed environment are proposed and analyzed in the context of the iterative KMedian algorithm. The proposed algorithm allows the clustering of multivariate data while ensuring that each cluster representative remains an item in the collection. This facilitates exploratory analysis where retaining a representative in the collection is important, such as imaging applications. Introduction and Background ● K-Means clustering is a well known and popular clustering technique. – Creates a new mean vector, which may not be meaningful in many applications ● Using the centroid of a cluster rather than the mean is one variation to the basic K-Means algorithm. – This is also known as the L1 Multivariate Median ● Dhillon and Modha first proposed a distributed KMeans clustering algorithm. – Computing the distributed median is more complicated At each Peer, P: For each image, x i , at P, Distributed K-Median Clustering Algorithm Select Initial Cluster Centers: Center(C G ) Calculate distance: from image, x i , to cluster center, Center(C G ) For each cluster, C Assign x i to cluster C, where Dist(x i ,Center(C G )) is minimized Select representatives to communicate, X P (C) Server communicates to peers For each cluster C: Calculate new center as an approximate Global Median: Median(C G ) = WMedian({X P (C)| P}) where X P (C) = {(x i ,w i )| x i is a representative image at peer P, w i is the number of items at P that x i represents}