Clustering by Passing Messages Between Data Points
AP算法提出原文。Clustering data by identifying a subset of representative examples is important for processing sensory signals and detecting patterns in data. Such “exemplars” can be found by randomly choosing an initial subset of data points and then iteratively refining it, but this works well only if that initial choice is close to a good solution. We devised a method called “affinity propagation,” which takes as input measures of similarity between pairs of data points. Real-valued messages are exchanged between data points until a high-quality set of exemplars and corresponding clusters gradually emerges. We used affinity propagation to cluster images of faces, detect genes in microarray data, identify representative sentences in this manuscript, and identify cities that are efficiently accessed by airline travel. Affinity propagation found clusters with much lower error than other methods, and it did so in less than one-hundredth the amount of time.
[index_km, center_km] = kmeans(data, cluster_num);disp('最终聚类中心：');disp(center_km); X = center_km; % 将 kmeans 聚类得到的聚类中心作为 FCM 聚类的初始聚类中心 % K-Means聚类 k = 4; % 聚类数 [idx, C] = kmeans(X, k);
- 我的内容管理 收起
- 我的资源 快来上传第一个资源
- 我的收益 登录查看自己的收益
- 我的积分 登录查看自己的积分
- 我的C币 登录后查看C币余额