arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1002.2313stat.MLmath.STstat.TH
收藏

水平集上谱聚类的算子范数收敛性

Operator norm convergence of spectral clustering on level sets

Bruno Pelletier, Pierre Pudlo

摘要:

遵循Hartigan,集群被定义为底层密度的t水平集的连通分量,即,密度大于t的点的集合。提出了一种结合密度估计和谱聚类技术的聚类算法。我们的算法由两个步骤组成。首先,使用非参数密度估计来提取估计密度取大于t的值的数据点。接着,基于图拉普拉斯矩阵的特征向量对提取的点进行聚类。在较弱的假设下,证明了与算法相关的经验图Laplacian算子在算子范数下几乎处处收敛。此外,我们给出了数据集到特征空间的表示的典型行为,这建立了我们所提出的算法的强一致性。

英文摘要:

Following Hartigan, a cluster is defined as a connected component of the t-level set of the underlying density, i.e., the set of points for which the density is greater than t. A clustering algorithm which combines a density estimate with spectral clustering techniques is proposed. Our algorithm is composed of two steps. First, a nonparametric density estimate is used to extract the data points for which the estimated density takes a value greater than t. Next, the extracted points are clustered based on the eigenvectors of a graph Laplacian matrix. Under mild assumptions, we prove the almost sure convergence in operator norm of the empirical graph Laplacian operator associated with the algorithm. Furthermore, we give the typical behavior of the representation of the dataset into the feature space, which establishes the strong consistency of our proposed algorithm.

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

↑