图 书 馆
基于线性优化的鲁棒近可分非负矩阵分解Robust Near-Separable Nonnegative Matrix Factorization Using Linear Optimization |
|
| 课程网址: | http://videolectures.net/roks2013_gillis_optimization/ |
| 主讲教师: | Nicolas Gillis |
| 开课单位: | 卢万天主教大学 |
| 开课时间: | 2013-08-26 |
| 课程语种: | 英语 |
| 中文简介: |  |
| 课程简介: | Nonnegative matrix factorization (NMF) has been shown recently to be tractable under the separability assumption, which amounts for the columns of the input data matrix to belong to the convex cone generated by a small number of columns. Bittorf, Recht, R´e and Tropp (‘Factoring nonnegative matrices with linear programs’, NIPS 2012) proposed a linear programming (LP) model, referred to as HottTopixx, which is robust under any small perturbation of the input matrix. However, HottTopixx has two important drawbacks: (i) the input matrix has to be normalized, and (ii) the factorization rank has to be known in advance. In this talk, we generalize HottTopixx in order to resolve these two drawbacks, that is, we propose a new LP model which does not require normalization and detects the factorization rank automatically. Moreover, the new LP model is more flexible, significantly more tolerant to noise, and can easily be adapted to handle outliers and other noise models. We show on several synthetic datasets that it outperforms HottTopixx while competing favorably with two state-of-the-art methods. |
| 关 键 词: | 线性优化; 矩阵分解; 因子分解 |
| 课程来源: | 视频讲座网 |
| 数据采集: | 2023-07-20：chenxin01 |
| 最后编审: | 2023-07-20：chenxin01 |
| 阅读次数: | 32 |