arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1609.05342cs.CVcs.LGstat.ML
收藏

对称非负矩阵分解的快速有效算法

Fast and Effective Algorithms for Symmetric Nonnegative Matrix Factorization

Reza Borhani, Jeremy Watt, Aggelos Katsaggelos

摘要:

对称非负矩阵分解(SNMF)模型作为许多标准聚类算法(包括流行的谱聚类方法)的简单重构而自然出现。最近的工作表明,SNMF的一个基本实例提供了优越的聚类质量相比,许多经典的聚类算法在各种合成和真实世界的数据集。在这项工作中,我们提出了新的重新制定的这种情况下的SNMF变量分裂的概念的基础上,并产生两个快速有效的算法,其优化使用i)可证明收敛的加速邻近梯度(APG)的过程和ii)的启发式版本的交替方向乘法(ADMM)框架。我们的两个算法之间的计算速度和数学收敛保证提出了一个有趣的权衡:虽然前者的方法是可证明收敛的,它是相当慢,比后者的方法,我们也提供了显着的,但不太严格的数学证明其收敛性。通过大量的实验,我们不仅表明,这些方法的功效是等于最先进的SNMF算法的状态,而且,后者的算法是非常快的一个到两个数量级的总计算时间比最先进的方法,甚至优于谱聚类在大数据集的计算时间。

英文摘要:

Symmetric Nonnegative Matrix Factorization (SNMF) models arise naturally as simple reformulations of many standard clustering algorithms including the popular spectral clustering method. Recent work has demonstrated that an elementary instance of SNMF provides superior clustering quality compared to many classic clustering algorithms on a variety of synthetic and real world data sets. In this work, we present novel reformulations of this instance of SNMF based on the notion of variable splitting and produce two fast and effective algorithms for its optimization using i) the provably convergent Accelerated Proximal Gradient (APG) procedure and ii) a heuristic version of the Alternating Direction Method of Multipliers (ADMM) framework. Our two algorithms present an interesting tradeoff between computational speed and mathematical convergence guarantee: while the former method is provably convergent it is considerably slower than the latter approach, for which we also provide significant but less stringent mathematical proof regarding its convergence. Through extensive experiments we show not only that the efficacy of these approaches is equal to that of the state of the art SNMF algorithm, but also that the latter of our algorithms is extremely fast being one to two orders of magnitude faster in terms of total computation time than the state of the art approach, outperforming even spectral clustering in terms of computation time on large data sets.

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

↑