Four algorithms to solve symmetric multi-type non-negative matrix tri-factorization problem

12/10/2020
by   Rok Hribar, et al.
0

In this paper, we consider the symmetric multi-type non-negative matrix tri-factorization problem (SNMTF), which attempts to factorize several symmetric non-negative matrices simultaneously. This can be considered as a generalization of the classical non-negative matrix tri-factorization problem and includes a non-convex objective function which is a multivariate sixth degree polynomial and a has convex feasibility set. It has a special importance in data science, since it serves as a mathematical model for the fusion of different data sources in data clustering. We develop four methods to solve the SNMTF. They are based on four theoretical approaches known from the literature: the fixed point method (FPM), the block-coordinate descent with projected gradient (BCD), the gradient method with exact line search (GM-ELS) and the adaptive moment estimation method (ADAM). For each of these methods we offer a software implementation: for the former two methods we use Matlab and for the latter Python with the TensorFlow library. We test these methods on three data-sets: the synthetic data-set we generated, while the others represent real-life similarities between different objects. Extensive numerical results show that with sufficient computing time all four methods perform satisfactorily and ADAM most often yields the best mean square error (MSE). However, if the computation time is limited, FPM gives the best MSE because it shows the fastest convergence at the beginning. All data-sets and codes are publicly available on our GitLab profile.

READ FULL TEXT
research
03/23/2020

A Block Coordinate Descent-based Projected Gradient Algorithm for Orthogonal Non-negative Matrix Factorization

This article utilizes the projected gradient method (PG) for a non-negat...
research
03/28/2022

Convex Non-negative Matrix Factorization Through Quantum Annealing

In this paper we provide the quantum version of the Convex Non-negative ...
research
08/09/2023

Multi-modal Multi-view Clustering based on Non-negative Matrix Factorization

By combining related objects, unsupervised machine learning techniques a...
research
06/14/2021

Global Controllability for Quasilinear Non-negative Definite System of ODEs and SDEs

We consider exact and averaged control problem for a system of quasi-lin...
research
05/18/2017

A Non-monotone Alternating Updating Method for A Class of Matrix Factorization Problems

In this paper we consider a general matrix factorization model which cov...
research
06/24/2014

Automatic Dimension Selection for a Non-negative Factorization Approach to Clustering Multiple Random Graphs

We consider a problem of grouping multiple graphs into several clusters ...
research
08/19/2020

Structure-preserving function approximation via convex optimization

Approximations of functions with finite data often do not respect certai...

Please sign up or login with your details

Forgot password? Click here to reset