arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2103.01398cs.DS
收藏

正交非负矩阵分解的近似算法

Approximation Algorithms for Orthogonal Non-negative Matrix Factorization

Moses Charikar, Lunjia Hu

摘要:

在非负矩阵分解(NMF)问题中,输入是具有非负条目的$m\times n$矩阵$M$,目标是将其分解为$M\approx AW$。$m\times k$矩阵$A$和$k\times n$矩阵$W$都被约束为具有非负条目。这与奇异值分解相反,在奇异值分解中,矩阵$A$和$W$可以具有负项,但必须满足正交约束:$A$的列是正交的,并且$W$的行也是正交的。正交非负矩阵分解(ONMF)问题同时施加了非负性和正交性约束,以前的工作表明,它导致更好的性能比NMF在许多聚类任务。当$A$和$W$中的一个或两个受正交约束时,我们给出了ONMF的第一个常数因子近似算法.我们还展示了一个有趣的连接到二分图的相关聚类问题。我们对合成数据和真实数据的实验表明,我们的算法实现了类似或更小的错误相比,以前的ONMF算法,同时确保完美的正交性(许多以前的算法不满足硬正交约束)。

英文摘要:

In the non-negative matrix factorization (NMF) problem, the input is an $m\times n$ matrix $M$ with non-negative entries and the goal is to factorize it as $M\approx AW$. The $m\times k$ matrix $A$ and the $k\times n$ matrix $W$ are both constrained to have non-negative entries. This is in contrast to singular value decomposition, where the matrices $A$ and $W$ can have negative entries but must satisfy the orthogonality constraint: the columns of $A$ are orthogonal and the rows of $W$ are also orthogonal. The orthogonal non-negative matrix factorization (ONMF) problem imposes both the non-negativity and the orthogonality constraints, and previous work showed that it leads to better performances than NMF on many clustering tasks. We give the first constant-factor approximation algorithm for ONMF when one or both of $A$ and $W$ are subject to the orthogonality constraint. We also show an interesting connection to the correlation clustering problem on bipartite graphs. Our experiments on synthetic and real-world data show that our algorithm achieves similar or smaller errors compared to previous ONMF algorithms while ensuring perfect orthogonality (many previous algorithms do not satisfy the hard orthogonality constraint).

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

↑