Bounded Simplex-Structured Matrix Factorization

09/26/2022
by   Olivier Vu Thanh, et al.
0

In this paper, we propose a new low-rank matrix factorization model dubbed bounded simplex-structured matrix factorization (BSSMF). Given an input matrix X and a factorization rank r, BSSMF looks for a matrix W with r columns and a matrix H with r rows such that X ≈ WH where the entries in each column of W are bounded, that is, they belong to given intervals, and the columns of H belong to the probability simplex, that is, H is column stochastic. BSSMF generalizes nonnegative matrix factorization (NMF), and simplex-structured matrix factorization (SSMF). BSSMF is particularly well suited when the entries of the input matrix X belong to a given interval; for example when the rows of X represent images, or X is a rating matrix such as in the Netflix and MovieLens data sets where the entries of X belong to the interval [1,5]. The simplex-structured matrix H not only leads to an easily understandable decomposition providing a soft clustering of the columns of X, but implies that the entries of each column of WH belong to the same intervals as the columns of W. In this paper, we first propose a fast algorithm for BSSMF, even in the presence of missing data in X. Then we provide identifiability conditions for BSSMF, that is, we provide conditions under which BSSMF admits a unique decomposition, up to trivial ambiguities. Finally, we illustrate the effectiveness of BSSMF on two applications: extraction of features in a set of images, and the matrix completion problem for recommender systems.

READ FULL TEXT
research
12/23/2011

High-Rank Matrix Completion and Subspace Clustering with Missing Data

This paper considers the problem of completing a matrix with many missin...
research
05/30/2019

Matrix Completion in the Unit Hypercube via Structured Matrix Factorization

Several complex tasks that arise in organizations can be simplified by m...
research
05/04/2017

Matrix Factorization with Side and Higher Order Information

The problem of predicting unobserved entries of a partially observed mat...
research
08/27/2018

Identifiability of Low-Rank Sparse Component Analysis

Sparse component analysis (SCA) is the following problem: Given an input...
research
11/19/2015

Neural Network Matrix Factorization

Data often comes in the form of an array or matrix. Matrix factorization...
research
11/11/2018

Fast Matrix Factorization with Non-Uniform Weights on Missing Data

Matrix factorization (MF) has been widely used to discover the low-rank ...
research
07/28/2022

Separable Quaternion Matrix Factorization for Polarization Images

Polarization is a unique characteristic of transverse wave and is repres...

Please sign up or login with your details

Forgot password? Click here to reset