Structural Identifiability in Low-Rank Matrix Factorization

DOI10.1007/978-3-540-69733-6_15MaRDI QIDQ3511322zbMATH OpenOpenAlexFDO

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

Publication date 10 July 2008

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-69733-6_15

Mathematics Subject Classification ID

Factorization of matrices (15A23) Combinatorics in computer science (68R05)

Recommendations

• Structural identifiability in low-rank matrix factorization
• Sparse network identifiability via compressed sensing
• Rank-Sparsity Incoherence for Matrix Decomposition
• Factorization approach to structured low-rank approximation with applications
• Approximate low-rank factorization with structured factors

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1312984 (Why is no real title available?)
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• 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

Cited in

(3)

• Structural identifiability in low-rank matrix factorization
• On the complexity of the identifiable subgraph problem, revisited
• A note on the identification of restricted factor loading matrices

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 Q3511322)