python - 如何调整此 DBSCAN 算法 python

标签 python algorithm cluster-analysis data-mining dbscan

我正在使用这种聚类算法对纬度和经度点进行聚类。我正在使用 http://scikit-learn.org/stable/auto_examples/cluster/plot_dbscan.html 给出的预写代码.

代码如下,在我的文件中包含超过 4000 个纬度和经度点。但是,我想调整此代码,以便它仅将集群定义为彼此相距 0.000020 以内的点,因为我希望我的集群几乎处于街道级别。

目前我得到 11 个簇,而理论上我至少需要 100 个簇。我尝试调整和更改不同的数字但无济于事。

print(__doc__)

import numpy as np

from sklearn.cluster import DBSCAN
from sklearn import metrics
from sklearn.datasets.samples_generator import make_blobs
from sklearn.preprocessing import StandardScaler


##############################################################################
# Generate sample data
input = np.genfromtxt(open("dataset_import_noaddress.csv","rb"),delimiter=",", skip_header=1)
coordinates = np.delete(input, [0,1], 1)

X, labels_true = make_blobs(n_samples=4000, centers=coordinates, cluster_std=0.0000005,
                        random_state=0)

X = StandardScaler().fit_transform(X)

##############################################################################
# Compute DBSCAN
db = 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_] = True
labels = db.labels_

# Number of clusters in labels, ignoring noise if present.
n_clusters_ = len(set(labels)) - (1 if -1 in labels else 0)

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))

##############################################################################
# Plot result
import matplotlib.pyplot as plt

# Black removed and is used for noise instead.
unique_labels = set(labels)
colors = plt.cm.Spectral(np.linspace(0, 1, len(unique_labels)))
for k, col in zip(unique_labels, colors):
    if k == -1:
        # Black used for noise.
        col = 'k'

    class_member_mask = (labels == k)

    xy = X[class_member_mask & core_samples_mask]
    plt.plot(xy[:, 0], xy[:, 1], 'o', markerfacecolor=col,
         markeredgecolor='k', markersize=14)

    xy = X[class_member_mask & ~core_samples_mask]
    plt.plot(xy[:, 0], xy[:, 1], 'o', markerfacecolor=col,
         markeredgecolor='k', markersize=6)

plt.title('Estimated number of clusters: %d' % n_clusters_)
plt.show()

最佳答案

您似乎只是在更改数据生成:

X, labels_true = make_blobs(n_samples=4000, centers=coordinates, cluster_std=0.0000005,
                    random_state=0)

代替聚类算法:

db = DBSCAN(eps=0.3, min_samples=10).fit(X)
            ^^^^^^^ almost your complete data set?

对于地理数据,请确保使用半正弦距离而不是欧氏距离。地球更像是一个球体,而不是一个平坦的欧几里得世界。

关于python - 如何调整此 DBSCAN 算法 python,我们在Stack Overflow上找到一个类似的问题: https://stackoverflow.com/questions/35971441/

相关文章:

python - Python-如何规范视频文件中的音频?

python - 用Python在手机和服务器之间发送彩信的API?

python - plt.plot 使用元组参数绘制什么?

python - Pandas:如何从 CSV 读取字节和非字节列并解码字节列?

algorithm - 计算组合

c++ - 用于 GPS 系统的 Dijkstra 算法的更快替代方案

python - 将两个矩阵划分为8个小矩阵的更快方法

cluster-analysis - 混合数字和分类数据的无监督异常检测

Scikit-Learn:使用 DBSCAN 预测新点

Python KMeans 聚类单词