paper-with-me

홈 › Papers

Nested Nonnegative Cone Analysis

2013-08-20 · Lingsong Zhang, J. S. Marron, Shu Lu

Motivated by the analysis of nonnegative data objects, a novel Nested Nonnegative Cone Analysis (NNCA) approach is proposed to overcome some drawbacks of existing methods. The application of traditional PCA/SVD method to nonnegative data often cause the approximation matrix leave the nonnegative cone, which leads to non-interpretable and sometimes nonsensical results. The nonnegative matrix factorization (NMF) approach overcomes this issue, however the NMF approximation matrices suffer several drawbacks: 1) the factorization may not be unique, 2) the resulting approximation matrix at a specific rank may not be unique, and 3) the subspaces spanned by the approximation matrices at different ranks may not be nested. These drawbacks will cause troubles in determining the number of components and in multi-scale (in ranks) interpretability. The NNCA approach proposed in this paper naturally generates a nested structure, and is shown to be unique at each rank. Simulations are used in this paper to illustrate the drawbacks of the traditional methods, and the usefulness of the NNCA method.

📄 PDF Abstract BibTeX arXiv:1308.4206

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Nonnegative Matrix Factorization through Cone Collapse

2025-11-27 · Manh Nguyen, Daniel Pimentel-Alarcón arxiv

Nonnegative matrix factorization (NMF) is a widely used tool for learning parts-based, low-dimensional representations of nonnegative data, with applications in vision, text, and bioinformatics. In clustering application…

Multiplicative updates for symmetric-cone factorizations

2021-08-02 · Yong Sheng Soh, Antonios Varvitsiotis

Given a matrix $X\in \mathbb{R}^{m\times n}_+$ with non-negative entries, the cone factorization problem over a cone $\mathcal{K}\subseteq \mathbb{R}^k$ concerns computing $\{ a_1,\ldots, a_{m} \} \subseteq \mathcal{K}$ …

Robustness Analysis of Hottopixx, a Linear Programming Model for Factoring Nonnegative Matrices

2012-11-28 · Nicolas Gillis

Although nonnegative matrix factorization (NMF) is NP-hard in general, it has been shown very recently that it is tractable under the assumption that the input nonnegative data matrix is close to being separable (separab…

Optimistic Online Learning in Symmetric Cone Games

2025-04-04 · Anas Barakat, Wayne Lin, John Lazarsfeld, Antonios Varvitsiotis

Optimistic online learning algorithms have led to significant advances in equilibrium computation, particularly for two-player zero-sum games, achieving an iteration complexity of $\mathcal{O}(1/\epsilon)$ to reach an $\…

Metric Learning

Fast and Robust Recursive Algorithms for Separable Nonnegative Matrix Factorization

2012-08-06 · Nicolas Gillis, Stephen A. Vavasis

In this paper, we study the nonnegative matrix factorization problem under the separability assumption (that is, there exists a cone spanned by a small subset of the columns of the input nonnegative data matrix containin…

Hyperspectral Unmixing