Structural Identifiability in Low-Rank Matrix Factorization

DOI10.1007/978-3-540-69733-6_15zbMath1148.68417OpenAlexW1498991996MaRDI QIDQ3511322

Epameinondas Fritzilas, Sven Rahmann, Yasmin 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)

Related Items (2)

On the complexity of the identifiable subgraph problem, revisited ⋮ Structural identifiability in low-rank matrix factorization

Cites Work

• Unnamed Item
• Unnamed Item
• Matching theory
• Document clustering using nonnegative matrix factorization
• Learning the parts of objects by non-negative matrix factorization
• Projected Gradient Methods for Nonnegative Matrix Factorization
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• Matrices and matroids for systems analysis

This page was built for publication: Structural Identifiability in Low-Rank Matrix Factorization