Four algorithms to solve symmetric multi-type non-negative matrix tri-factorization problem
From MaRDI portal
Publication:2114581
Abstract: 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 (). However, if the computation time is limited, FPM gives the best because it shows the fastest convergence at the beginning. All data-sets and codes are publicly available on our GitLab profile.
Recommendations
- Adaptive computation of the symmetric nonnegative matrix factorization (SymNMF)
- Multiplicative algorithms for symmetric nonnegative tensor factorizations and its applications
- Numerical methods for \(Q\)-weighted nonnegative matrix tri-factorization
- A block inertial Bregman proximal algorithm for nonsmooth nonconvex problems with application to symmetric nonnegative matrix tri-factorization
- Algorithms for nonnegative matrix and tensor factorizations: a unified view based on block coordinate descent framework
Cites work
- scientific article; zbMATH DE number 6276119 (Why is no real title available?)
- A Nonconvex Splitting Method for Symmetric Nonnegative Matrix Factorization: Convergence Analysis and Optimality
- A boundary point method to solve semidefinite programs
- A convergent algorithm for orthogonal nonnegative matrix factorization
- A robust real-coded evolutionary algorithm with toroidal search space conversion
- Convergence of a block coordinate descent method for nondifferentiable minimization
- Coordinate descent algorithms
- Learning representations by back-propagating errors
- Non-Negative Matrix Factorization Revisited: Uniqueness and Algorithm for Symmetric Decomposition
- Nonnegative Matrix Factorization Based on Alternating Nonnegativity Constrained Least Squares and Active Set Method
- On the complexity of nonnegative matrix factorization
- On the computational complexity of membership problems for the completely positive cone and its dual
- Projected Gradient Methods for Nonnegative Matrix Factorization
- QPLIB: a library of quadratic programming instances
- Regularization methods for semidefinite programming
- SVD based initialization: A head start for nonnegative matrix factorization
- Similarity-based pattern recognition. Second international workshop, SIMBAD 2013, York, UK, July 3--5, 2013. Proceedings
- Stochastic subgradient method converges on tame functions
Cited in
(5)
This page was built for publication: Four algorithms to solve symmetric multi-type non-negative matrix tri-factorization problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2114581)
