Symmetric Nonnegative Matrix Trifactorization

TL;DR

This paper introduces Symmetric Nonnegative Matrix Trifactorization (SN-Trifactorization), defining the SNT-rank of nonnegative symmetric matrices and exploring its properties, including applications to matrix completion problems.

Contribution

It defines the SNT-rank for nonnegative symmetric matrices and investigates its properties, including its relation to matrix rank and applications to completion problems.

Findings

SNT-rank is introduced as a new matrix factorization measure.

Properties of SNT-rank are characterized for low rank matrices.

The paper explores the minimal SNT-rank among matrices with given diagonal blocks.

Abstract

The Symmetric Nonnegative Matrix Trifactorization (SN-Trifactorization) is a factorization of an $n \times n$ nonnegative symmetric matrix $A$ of the form $BCB^T$, where $C$ is a $k \times k$ symmetric matrix, and both $B$ and $C$ are required to be nonnegative. This work introduces the SNT-rank of $A$, as the minimal $k$, for which such factorization exists. After listing basic properties and exploring SNT-rank of low rank matrices, the class of nonnegative symmetric matrices with SNT-rank equal to rank is studied. The paper concludes with a completion problem, that asks for matrices with the smallest possible SNT-rank among all nonnegative symmetric matrices with given diagonal blocks.