How the K-mean Cluster work Step 1. Begin with a decision the value of k = number of clusters Step 2. Put any initial partition that classifies the data into k clusters. You may assign the training samples randomly, or systematically as the f

一本将基于近邻传播算法的半监督聚类的算方法书.对于聚类研究的很有帮助-Abstract: A semi-supervised clustering method based on affinity propagation (AP) algorithm is proposed in this paper. AP takes as input measures of similarity between pairs of data points. AP is an efficient a

利用mapreduce编程思想，个人编写的网页排名算法，绝对可用。若果想要在集群上运行，可能需要对于数据集格式做调整。-Mapreduce programming ideas, personal written page rank algorithm is absolutely available. If you want to run on a cluster, you may need to adjust the format of the data sets.