arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1608.04290stat.ML
收藏

基于鲁棒体积最小化的矩阵分解算法在遥感和文本聚类中的应用

Robust Volume Minimization-Based Matrix Factorization for Remote Sensing and Document Clustering

Xiao Fu, Kejun Huang, Bo Yang, Wing-Kin Ma, Nicholas D. Sidiropoulos

摘要:

本文考虑基于\emph{volume minimization}(VolMin)的结构矩阵分解(SMF)。VolMin是一种分解准则,通过找到包含数据矩阵所有列的最小体积单纯形,将给定的数据矩阵分解为基矩阵乘以结构化系数矩阵。最近的工作表明,VolMin保证在温和的条件下,在各种各样的应用中是现实的因素矩阵的可识别性。本文着重于VolMin的理论和实践方面。在理论方面,两个独立开发的VolMin可识别性的充分条件的确切等价性在这里被证明,从而提供了一个更全面的理解这方面的VolMin。在算法方面,计算复杂性和对离群值的敏感性是与VolMin的实际应用相关的两个关键挑战。这里通过一个新的VolMin算法来解决这些问题,该算法以计算简单的方式处理体积正则化,并同时自动检测和{迭代地降低权重}离群值。仿真和实际数据实验使用遥感高光谱图像和路透社的文档语料库,以展示所提出的算法的有效性。

英文摘要:

This paper considers \emph{volume minimization} (VolMin)-based structured matrix factorization (SMF). VolMin is a factorization criterion that decomposes a given data matrix into a basis matrix times a structured coefficient matrix via finding the minimum-volume simplex that encloses all the columns of the data matrix. Recent work showed that VolMin guarantees the identifiability of the factor matrices under mild conditions that are realistic in a wide variety of applications. This paper focuses on both theoretical and practical aspects of VolMin. On the theory side, exact equivalence of two independently developed sufficient conditions for VolMin identifiability is proven here, thereby providing a more comprehensive understanding of this aspect of VolMin. On the algorithm side, computational complexity and sensitivity to outliers are two key challenges associated with real-world applications of VolMin. These are addressed here via a new VolMin algorithm that handles volume regularization in a computationally simple way, and automatically detects and {iteratively downweights} outliers, simultaneously. Simulations and real-data experiments using a remotely sensed hyperspectral image and the Reuters document corpus are employed to showcase the effectiveness of the proposed algorithm.

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

↑