任意距离矩阵的推广k-均值算法
Generalizing k-means for an arbitrary distance matrix
摘要:
原始的k-means聚类方法只有在表示数据点的确切向量已知时才有效。因此,计算距离质心需要向量运算,因为抽象数据点的平均值是未定义的。现有的算法可以扩展到那些情况下,当唯一的输入是距离矩阵,和确切的代表向量是未知的。这种扩展可以被命名为关系k-means后,一个类似的模糊聚类算法发明的符号。然后,提出了一种方法,用于推广k-均值的情况下,数据点绝对没有连接的欧氏空间。
英文摘要:
The original k-means clustering method works only if the exact vectors representing the data points are known. Therefore calculating the distances from the centroids needs vector operations, since the average of abstract data points is undefined. Existing algorithms can be extended for those cases when the sole input is the distance matrix, and the exact representing vectors are unknown. This extension may be named relational k-means after a notation for a similar algorithm invented for fuzzy clustering. A method is then proposed for generalizing k-means for scenarios when the data points have absolutely no connection with a Euclidean space.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。