dbscan算法_使用python+sklearn实现DBSCAN聚类算法演示

注意：单击此处https://urlify.cn/U3yuIz下载完整的示例代码，或通过Binder在浏览器中运行此示例

寻找高密度的核心样本并从中扩展聚类。

sphx_glr_plot_dbscan_001

输出：

Estimated number of clusters: 3Estimated number of noise points: 18Homogeneity: 0.953Completeness: 0.883V-measure: 0.917Adjusted Rand Index: 0.952Adjusted Mutual Information: 0.916Silhouette Coefficient: 0.626

print(__doc__)import numpy as npfrom sklearn.cluster import DBSCANfrom sklearn import metricsfrom sklearn.datasets import make_blobsfrom sklearn.preprocessing import StandardScaler# ############################################################################## 生成样本数据centers = [[1, 1], [-1, -1], [1, -1]]X, labels_true = make_blobs(n_samples=750, centers=centers, cluster_std=0.4, random_state=0)X = StandardScaler().fit_transform(X)# ############################################################################## 计算DBSCANdb = DBSCAN(eps=0.3, min_samples=10).fit(X)core_samples_mask = np.zeros_like(db.labels_, dtype=bool)core_samples_mask[db.core_sample_indices_] = Truelabels = db.labels_# 标签中聚类的数量，忽略噪声(如果存在)。n_clusters_ = len(set(labels)) - (1 if -1 in labels else 0)n_noise_ = list(labels).count(-1)print('Estimated number of clusters: %d' % n_clusters_)print('Estimated number of noise points: %d' % n_noise_)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))# ############################################################################## 绘制结果import matplotlib.pyplot as plt# 去除黑色，并用于产生噪音。unique_labels = set(labels)colors = [plt.cm.Spectral(each) for each in np.linspace(0, 1, len(unique_labels))]for k, col in zip(unique_labels, colors): if k == -1: # 用于噪音的黑色。 col = [0, 0, 0, 1] class_member_mask = (labels == k) xy = X[class_member_mask & core_samples_mask] plt.plot(xy[:, 0], xy[:, 1], 'o', markerfacecolor=tuple(col), markeredgecolor='k', markersize=14) xy = X[class_member_mask & ~core_samples_mask] plt.plot(xy[:, 0], xy[:, 1], 'o', markerfacecolor=tuple(col), markeredgecolor='k', markersize=6)plt.title('Estimated number of clusters: %d' % n_clusters_)plt.show()

脚本的总运行时间：(0分钟0.431秒)

估计的内存使用量： 9 MB

下载Python源代码: plot_dbscan.py 下载Jupyter notebook源代码: plot_dbscan.ipynb 由Sphinx-Gallery生成的画廊 ©2007-2019，scikit-learn开发人员(BSD许可证)。 显示此页面源码

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

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

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