paper-with-me

홈 › Papers

Nonnegative matrix factorizations and related compositional models: Equivalence, identifiability, and an application on the grain-size analysis of sediments

2025-12-25 · Qianqian Qi, Peter G. M. van der Heijden arxiv

Across fields such as machine learning, social science, and geology, considerable attention has been given to models that factorize a nonnegative matrix into the product of two or three matrices, subject to nonnegative or row-sum-to-1 constraints. Although these models are to a large extent similar or even equivalent, they are presented under different names, and their similarity is not well known. This paper highlights similarities among five models, latent budget analysis (LBA) and latent class analysis (LCA) from social science, end-member analysis (EMA) from geology, probabilistic latent semantic analysis (PLSA) and nonnegative matrix factorization (NMF) from machine learning. We focus on the identifiability of these models. We prove that the solution of LBA, EMA, LCA, PLSA is unique if and only if the solution of NMF is unique. Consequently, existing uniqueness theorems for NMF directly apply to LBA, EMA, LCA, PLSA, and vice versa. We also provide a brief review of algorithms for the estimation of these models. We illustrate NMF on a sedimentary grain-size distribution dataset from sedimentary geology, and end the paper with a discussion of closely related model: archetypal analysis.

📄 PDF Abstract BibTeX arXiv:2512.22282

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Algorithms for Approximate Subtropical Matrix Factorization

2017-07-19 · Sanjar Karaev, Pauli Miettinen

Matrix factorization methods are important tools in data mining and analysis. They can be used for many tasks, ranging from dimensionality reduction to visualization. In this paper we concentrate on the use of matrix fac…

Dimensionality Reduction

Co-Separable Nonnegative Matrix Factorization

2021-09-02 · Junjun Pan, Michael K. Ng

Nonnegative matrix factorization (NMF) is a popular model in the field of pattern recognition. It aims to find a low rank approximation for nonnegative data M by a product of two nonnegative matrices W and H. In general,…

A Non-commutative Extension of Lee-Seung's Algorithm for Positive Semidefinite Factorizations

2021-06-01 · NeurIPS 2021 12 · Yong Sheng Soh, Antonios Varvitsiotis

Given a matrix $X\in \mathbb{R}_+^{m\times n}$ with nonnegative entries, a Positive Semidefinite (PSD) factorization of $X$ is a collection of $r \times r$-dimensional PSD matrices $\{A_i\}$ and $\{B_j\}$ satisfying $X_{…

Heuristics for Exact Nonnegative Matrix Factorization

2014-11-26 · Arnaud Vandaele, Nicolas Gillis, François Glineur, Daniel Tuyttens

The exact nonnegative matrix factorization (exact NMF) problem is the following: given an $m$-by-$n$ nonnegative matrix $X$ and a factorization rank $r$, find, if possible, an $m$-by-$r$ nonnegative matrix $W$ and an $r$…

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}$ …