arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1509.08863cs.SIcs.NAmath.NA
收藏

利用随机信号的图滤波加速谱聚类

Accelerated Spectral Clustering Using Graph Filtering Of Random Signals

INRIA Rennes - Bretagne Atlantique(法国国家信息与自动化研究所雷恩-布列塔尼大西洋分所);Physics Laboratory, ENS Lyon, CNRS, University of Lyon(里昂高等师范学校物理实验室);Institute of Electrical Engineering, EPFL(洛桑联邦理工学院电气工程学院)

Nicolas Tremblay, Gilles Puy, Pierre Borgnat, Remi Gribonval, Pierre Vandergheynst

AI总结:

本文提出一种加速谱聚类算法,通过图滤波随机信号估计谱聚类距离矩阵,无需计算特征向量,从而在大规模数据集上实现更快的聚类性能。

摘要:

我们基于最近的图信号处理进展,提出了一种更快的谱聚类算法。确实,经典的谱聚类基于计算相似矩阵拉普拉斯矩阵的前k个特征向量,即使对于稀疏矩阵,其计算成本在大规模数据集上也变得不可接受。我们展示可以通过图滤波随机信号来估计谱聚类距离矩阵,而无需计算这些特征向量。此外,我们利用这些随机向量的随机性来估计聚类数k。我们在合成数据上将我们的方法与经典谱聚类进行比较,证明其在大规模数据集上能以至少两倍的速度达到相同性能。

英文摘要:

We build upon recent advances in graph signal processing to propose a faster spectral clustering algorithm. Indeed, classical spectral clustering is based on the computation of the first k eigenvectors of the similarity matrix' Laplacian, whose computation cost, even for sparse matrices, becomes prohibitive for large datasets. We show that we can estimate the spectral clustering distance matrix without computing these eigenvectors: by graph filtering random signals. Also, we take advantage of the stochasticity of these random vectors to estimate the number of clusters k. We compare our method to classical spectral clustering on synthetic data, and show that it reaches equal performance while being faster by a factor at least two for large datasets.

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

↑