arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2203.00004cs.LGcs.DCcs.DM
收藏

一种面向图的去中心化谱聚类的动态模态分解方法

A Dynamic Mode Decomposition Approach for Decentralized Spectral Clustering of Graphs

Raytheon Technologies Research Center(雷神技术研究中心);University of Surrey(萨里大学)

Hongyu Zhu, Stefan Klus, Tuhin Sahai

AI总结:

本研究提出一种基于Koopman算子框架与局部DMD计算的去中心化图聚类算法,等效于谱聚类,相比现有FFT方法鲁棒性更强,步数仅需1/20且相对误差降低数个数量级。

摘要:

我们提出了一种新颖的鲁棒性去中心化图聚类算法,该算法经证明与流行的谱聚类方法等效。我们提出的方法采用了现有的基于在图中传播波的波动方程聚类算法。不过,我们的方法并未在每个节点上执行快速傅里叶变换(FFT)计算,而是利用了Koopman算子框架。具体而言,我们证明,在图中传播波之后,在每个节点上进行局部动态模态分解(DMD)计算,能够获取图拉普拉斯矩阵的特征值和局部特征向量分量,从而为所有节点提供局部聚类分配。我们证明,DMD计算比现有的基于FFT的方法更具鲁棒性,仅需波动方程步数的1/20即可准确恢复聚类信息,且相对误差降低了数个数量级。我们在一系列图聚类问题上验证了这种去中心化方法的效果。

英文摘要:

We propose a novel robust decentralized graph clustering algorithm that is provably equivalent to the popular spectral clustering approach. Our proposed method uses the existing wave equation clustering algorithm that is based on propagating waves through the graph. However, instead of using a fast Fourier transform (FFT) computation at every node, our proposed approach exploits the Koopman operator framework. Specifically, we show that propagating waves in the graph followed by a local dynamic mode decomposition (DMD) computation at every node is capable of retrieving the eigenvalues and the local eigenvector components of the graph Laplacian, thereby providing local cluster assignments for all nodes. We demonstrate that the DMD computation is more robust than the existing FFT based approach and requires 20 times fewer steps of the wave equation to accurately recover the clustering information and reduces the relative error by orders of magnitude. We demonstrate the decentralized approach on a range of graph clustering problems.

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

↑