Structural identifiability in low-rank matrix factorization

DOI10.1007/S00453-009-9331-2MaRDI QIDQ848955zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Epameinondas Fritzilas, Martin Milanič, Sven Rahmann, Y. A. Rios-Solis

Publication date 23 February 2010

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-009-9331-2

zbMATH Keywords

computational complexityapproximation algorithminteger programmingbipartite matchinglow-rank matrix factorizationstructural rank

Mathematics Subject Classification ID

Approximation algorithms (68W25)

Recommendations

• Structural Identifiability in Low-Rank Matrix Factorization
• Factorization approach to structured low-rank approximation with applications
• Approximate low-rank factorization with structured factors
• Structured low rank approximation of non-negative matrices
• Rank-Sparsity Incoherence for Matrix Decomposition

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1559563 (Why is no real title available?)
• scientific article; zbMATH DE number 2203240 (Why is no real title available?)
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• An analysis of the greedy algorithm for the submodular set covering problem
• Combinatorial Optimization. Polyhedra and efficiency. CD-ROM
• Document clustering using nonnegative matrix factorization
• Learning the parts of objects by non-negative matrix factorization
• Matching theory
• Matrices and matroids for systems analysis
• Projected Gradient Methods for Nonnegative Matrix Factorization
• Quantum mechanical algorithms for the nonabelian hidden subgroup problem
• Structural Identifiability in Low-Rank Matrix Factorization
• Submodular functions and electrical networks
• Submodular functions and optimization.
• TWO THEOREMS IN GRAPH THEORY
• The measure of the critical values of differentiable maps

Cited in

(5)

• A note on the identification of restricted factor loading matrices
• Structural Identifiability in Low-Rank Matrix Factorization
• On the complexity of the identifiable subgraph problem, revisited
• On the complexity of the identifiable subgraph problem
• Identification of large space structures - A factorization approach

This page was built for publication: Structural identifiability in low-rank matrix factorization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q848955)