A convergent algorithm for bi-orthogonal nonnegative matrix tri-factorization

DOI10.1007/s11634-021-00447-6OpenAlexW3205813530WikidataQ114222064 ScholiaQ114222064MaRDI QIDQ2673354

Andri Mirzal

Publication date: 9 June 2022

Published in: Advances in Data Analysis and Classification. ADAC (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1710.11478

zbMATH Keywords

convergent algorithmnonnegative matrix factorizationclustering methodsorthogonality constraint

Mathematics Subject Classification ID

Cites Work

• On the convergence of the partial least squares path modeling algorithm
• Algorithms and applications for approximate nonnegative matrix factorization
• On the convergence of the block nonlinear Gauss-Seidel method under convex constraints
• Orthogonal nonnegative matrix tri-factorization based on Tweedie distributions
• Nonnegative matrix factorization for spectral data analysis
• A convergent algorithm for orthogonal nonnegative matrix factorization
• Nonnegative Matrix Factorization Based on Alternating Nonnegativity Constrained Least Squares and Active Set Method
• A Unified Convergence Analysis of the Multiplicative Update Algorithm for Regularized Nonnegative Matrix Factorization
• Fast Projection‐Based Methods for the Least Squares Nonnegative Matrix Approximation Problem
• Learning the parts of objects by non-negative matrix factorization

This page was built for publication: A convergent algorithm for bi-orthogonal nonnegative matrix tri-factorization