Structural identifiability in low-rank matrix factorization (Q848955): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q61704601, #quickstatements; #temporary_batch_1712286835472
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: TWO THEOREMS IN GRAPH THEORY / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5315023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural Identifiability in Low-Rank Matrix Factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodular functions and optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning the parts of objects by non-negative matrix factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Projected Gradient Methods for Nonnegative Matrix Factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrices and matroids for systems analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodular functions and electrical networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4527015 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The measure of the critical values of differentiable maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Optimization. Polyhedra and efficiency. CD-ROM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Document clustering using nonnegative matrix factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum mechanical algorithms for the nonabelian hidden subgroup problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analysis of the greedy algorithm for the submodular set covering problem / rank
 
Normal rank

Latest revision as of 12:16, 2 July 2024

scientific article
Language Label Description Also known as
English
Structural identifiability in low-rank matrix factorization
scientific article

    Statements

    Structural identifiability in low-rank matrix factorization (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    23 February 2010
    0 references
    0 references
    low-rank matrix factorization
    0 references
    structural rank
    0 references
    bipartite matching
    0 references
    computational complexity
    0 references
    integer programming
    0 references
    approximation algorithm
    0 references
    0 references
    0 references