0


用线性程序分解非负矩阵

Factoring nonnegative matrices with linear programs
课程网址: http://videolectures.net/machine_bittorf_nonnegative_matrices/  
主讲教师: Victor Bittorf
开课单位: 威斯康星大学
开课时间: 2013-01-14
课程语种: 英语
中文简介:
本文描述了一种利用线性规划计算非负矩阵因子分解(NMF)的新方法。关键思想是分解的数据驱动模型,其中数据中最显着的特征用于表示剩余的特征。更确切地说,给定数据矩阵X,该算法识别满足X = CX和一些线性约束的矩阵C.矩阵C选择特征,然后用于计算X的低秩NMF。理论分析表明该方法与Arora等人的近期NMF算法(2012)具有相同类型的保证。与此前的工作相比,所提出的方法具有(1)更好的噪声容限,(2)扩展到更一般的噪声模型,以及(3)导致高效,可扩展的算法。使用合成和真实数据集的实验提供了证据,证明新方法在实践中也是优越的。新算法的优化C ++实现可以在几分钟内考虑多千兆字节矩阵。
课程简介: This paper describes a new approach for computing nonnegative matrix factorizations (NMFs) with linear programming. The key idea is a data-driven model for the factorization, in which the most salient features in the data are used to express the remaining features. More precisely, given a data matrix X, the algorithm identifies a matrix C that satisfies X = CX and some linear constraints. The matrix C selects features, which are then used to compute a low-rank NMF of X. A theoretical analysis demonstrates that this approach has the same type of guarantees as the recent NMF algorithm of Arora et al.~(2012). In contrast with this earlier work, the proposed method has (1) better noise tolerance, (2) extends to more general noise models, and (3) leads to efficient, scalable algorithms. Experiments with synthetic and real datasets provide evidence that the new approach is also superior in practice. An optimized C++ implementation of the new algorithm can factor a multi-Gigabyte matrix in a matter of minutes.
关 键 词: 线性规划; 非负矩阵因子分解; 数据驱动模型
课程来源: 视频讲座网
最后编审: 2020-07-14:yumf
阅读次数: 46