arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2302.11296cs.LGcs.AIcs.IRcs.NE
收藏

改进$k$ -最近邻图的高效谱聚类算法

Refining a $k$-nearest neighbor graph for a computationally efficient spectral clustering

The University of Sydney(悉尼大学)

Mashaan Alshammari, John Stavrakakis, Masahiro Takatsuka

摘要:

谱聚类由于能够发现不同形状的簇而成为数据聚类的热门选择。然而,由于其计算需求,它并不总是优于其他聚类方法。绕过这些计算需求的有效方法之一是对点的子集(数据代表)执行谱聚类,然后概括聚类结果,这被称为近似谱聚类(ASC)。ASC使用抽样或量化来选择数据代表。这使得它容易受到1)性能不一致(因为这些方法在初始化或训练中具有随机步骤),2)局部统计丢失(因为成对相似性是从数据代表而不是数据点中提取的)。我们提出了一个改进版本的$k$ -最近邻图,在其中我们保持数据点,并积极减少计算效率的边缘数量。利用局部统计来保留不违反簇内距离的边,并使$k$ -最近邻图中的所有其他边无效。我们还引入了一个可选的步骤来自动选择集群的数量$C$。所提出的方法进行了测试合成和真实数据集。与ASC方法相比,所提出的方法提供了一致的性能,尽管显着减少的边缘。

英文摘要:

Spectral clustering became a popular choice for data clustering for its ability of uncovering clusters of different shapes. However, it is not always preferable over other clustering methods due to its computational demands. One of the effective ways to bypass these computational demands is to perform spectral clustering on a subset of points (data representatives) then generalize the clustering outcome, this is known as approximate spectral clustering (ASC). ASC uses sampling or quantization to select data representatives. This makes it vulnerable to 1) performance inconsistency (since these methods have a random step either in initialization or training), 2) local statistics loss (because the pairwise similarities are extracted from data representatives instead of data points). We proposed a refined version of $k$-nearest neighbor graph, in which we keep data points and aggressively reduce number of edges for computational efficiency. Local statistics were exploited to keep the edges that do not violate the intra-cluster distances and nullify all other edges in the $k$-nearest neighbor graph. We also introduced an optional step to automatically select the number of clusters $C$. The proposed method was tested on synthetic and real datasets. Compared to ASC methods, the proposed method delivered a consistent performance despite significant reduction of edges.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑