Sklearn Kmeans使用欧几里得距离。它没有度量参数。也就是说，如果你在聚类时间序列，你可以使用tslearn python包，当你可以指定一个度量(dtw, softdtw，欧几里得)。

The Affinity propagation algorithm from the sklearn library allows you to pass the similarity matrix instead of the samples. So, you can use your metric to compute the similarity matrix (not the dissimilarity matrix) and pass it to the function by setting the "affinity" term to "precomputed".https://scikit-learn.org/stable/modules/generated/sklearn.cluster.AffinityPropagation.html#sklearn.cluster.AffinityPropagation.fit In terms of the K-Mean, I think it is also possible but I have not tried it. However, as the other answers stated, finding the mean using a different metric will be the issue. Instead, you can use PAM (K-Medoids) algorthim as it calculates the change in Total Deviation (TD), thus it does not rely on the distance metric. https://python-kmedoids.readthedocs.io/en/latest/#fasterpam

Sklearn Kmeans使用欧几里得距离。它没有度量参数。也就是说，如果你在聚类时间序列，你可以使用tslearn python包，当你可以指定一个度量(dtw, softdtw，欧几里得)。

是的，你可以使用差分度量函数;然而，根据定义，k-means聚类算法依赖于每个聚类均值的欧几里得距离。

你可以使用不同的度量，所以即使你仍然在计算平均值你也可以使用像mahalnobis距离这样的东西。

不幸的是没有:scikit-learn目前实现的k-means只使用欧几里得距离。

将k-means扩展到其他距离并不是一件简单的事情，denis上面的回答并不是对其他度量实现k-means的正确方法。

def distance_metrics(dist_metrics):
    kmeans_instance = kmeans(trs_data, initial_centers, metric=dist_metrics)

    label = np.zeros(210, dtype=int)
    for i in range(0, len(clusters)):
        for index, j in enumerate(clusters[i]):
            label[j] = i