Description: PAM (Partitioning Around Medoid Around the division of the center,) algorithm is a kind of partition algorithm is very important algorithm, and sometimes also called k-center algorithm, it is to point to in the center to represent a cluster. The earliest PAM algorithm by Kaufman and Rousseevw puts forward, Medoid mean is at the center of the location of the object. PAM algorithm for the purpose of n data object is given k division. PAM algorithm to the basic idea of the: PAM algorithm for the purpose of members set D is the N data object given k division, forming k cluster, each cluster in selected at random from a members set to center, then at each step, the focus of the input data is not a member of the center according to the center YiDu or phase with each distance is, look to whether can be centered. Use cluster in the center point to the center of the cluster of the sum of all the distance to measure the clustering effect, which is always assigned members from their recent cluste
To Search:
File list (Check if you may need any files):
说明.txt
Download