python 密度聚类 使用_使用python+sklearn实现仿射传播聚类算法演示

注意：单击此处 https://urlify.cn/u2eaIn 下载完整的示例代码，或通过Binder在浏览器中运行此示例 参考文献：Brendan J. Frey and Delbert Dueck, “Clustering by Passing Messages Between Data Points”, Science Feb. 2007

sphx_glr_plot_affinity_propagation_001

输出：

Estimated number of clusters: 3Homogeneity: 0.872Completeness: 0.872V-measure: 0.872Adjusted Rand Index: 0.912Adjusted Mutual Information: 0.871Silhouette Coefficient: 0.753

print(__doc__)from sklearn.cluster import AffinityPropagationfrom sklearn import metricsfrom sklearn.datasets import make_blobs# ############################################################################## 生成样本数据centers = [[1, 1], [-1, -1], [1, -1]]X, labels_true = make_blobs(n_samples=300, centers=centers, cluster_std=0.5,                            random_state=0)# ############################################################################## 计算仿射传播af = AffinityPropagation(preference=-50).fit(X)cluster_centers_indices = af.cluster_centers_indices_labels = af.labels_n_clusters_ = len(cluster_centers_indices)print('Estimated number of clusters: %d' % n_clusters_)print("Homogeneity: %0.3f" % metrics.homogeneity_score(labels_true, labels))print("Completeness: %0.3f" % metrics.completeness_score(labels_true, labels))print("V-measure: %0.3f" % metrics.v_measure_score(labels_true, labels))print("Adjusted Rand Index: %0.3f"      % metrics.adjusted_rand_score(labels_true, labels))print("Adjusted Mutual Information: %0.3f"      % metrics.adjusted_mutual_info_score(labels_true, labels))print("Silhouette Coefficient: %0.3f"      % metrics.silhouette_score(X, labels, metric='sqeuclidean'))# ############################################################################## 绘制结果import matplotlib.pyplot as pltfrom itertools import cycleplt.close('all')plt.figure(1)plt.clf()colors = cycle('bgrcmykbgrcmykbgrcmykbgrcmyk')for k, col in zip(range(n_clusters_), colors):    class_members = labels == k    cluster_center = X[cluster_centers_indices[k]]    plt.plot(X[class_members, 0], X[class_members, 1], col + '.')    plt.plot(cluster_center[0], cluster_center[1], 'o', markerfacecolor=col,             markeredgecolor='k', markersize=14)    for x in X[class_members]:        plt.plot([cluster_center[0], x[0]], [cluster_center[1], x[1]], col)plt.title('Estimated number of clusters: %d' % n_clusters_)plt.show()

脚本的总运行时间：(0分钟0.665秒) 估计的内存使用量： 8 MB 下载Python源代码: plot_affinity_propagation.py 下载Jupyter notebook源代码: plot_affinity_propagation.ipynb 由Sphinx-Gallery生成的画廊 ©2007-2019，scikit-learn开发人员(BSD许可证)。 显示此页面源码

文壹由“伴编辑器”提供技术支持

☆☆☆为方便大家查阅，小编已将scikit-learn学习路线专栏 文章统一整理到公众号底部菜单栏，同步更新中，关注公众号，点击左下方“系列文章”，如图：

欢迎大家和我一起沿着scikit-learn文档这条路线，一起巩固机器学习算法基础。(添加微信：mthler，备注：sklearn学习，一起进【sklearn机器学习进步群】开启打怪升级的学习之旅。)