Structural identifiability in low-rank matrix factorization
type: Item
instance of: scholarly article
title: Structural identifiability in low-rank matrix factorization
zbMATH Open document ID: 1187.68705
author: Epameinondas Fritzilas
author: Martin Milanič
author: Sven Rahmann
author: Y. A. Rios-Solis
published in: Algorithmica
publication date: 2010-02-23T00:00:00Z
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 5674328
zbMATH Keywords: low-rank matrix factorization
zbMATH Keywords: structural rank
zbMATH Keywords: bipartite matching
zbMATH Keywords: computational complexity
zbMATH Keywords: integer programming
zbMATH Keywords: approximation algorithm
MaRDI profile type: Publication
full work available at URL: s00453-009-9331-2
OpenAlex ID: W1963598624
Wikidata QID: Q61704601
cites work: TWO THEOREMS IN GRAPH THEORY
cites work: Q5315023
cites work: Structural Identifiability in Low-Rank Matrix Factorization
cites work: Submodular functions and optimization.
cites work: Q4198056
cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
cites work: Learning the parts of objects by non-negative matrix factorization
cites work: Projected Gradient Methods for Nonnegative Matrix Factorization
cites work: Matching theory
cites work: Matrices and matroids for systems analysis
cites work: Submodular functions and electrical networks
cites work: Q4527015
cites work: The measure of the critical values of differentiable maps
cites work: Combinatorial Optimization. Polyhedra and efficiency. CD-ROM
cites work: Document clustering using nonnegative matrix factorization
cites work: Quantum mechanical algorithms for the nonabelian hidden subgroup problem
cites work: An analysis of the greedy algorithm for the submodular set covering problem
DOI: 10.1007/S00453-009-9331-2
DBLP publication ID: journals/algorithmica/FritzilasMRR10
description: scientific article; zbMATH DE number 5674328