A Clustering Approach to Constrained Binary Matrix Factorization (Q4631260): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q2934696 / rank
 
Normal rank
Property / cites work
 
Property / cites work: From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images / rank
 
Normal rank
Property / cites work
 
Property / cites work: The basic algorithm for pseudo-Boolean programming revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using underapproximations for sparse nonnegative matrix factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5538300 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonorthogonal decomposition of binary matrices for bounded-error data compression and analysis / 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: Least squares quantization in PCM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5617409 / rank
 
Normal rank

Latest revision as of 00:55, 19 July 2024

scientific article; zbMATH DE number 7047344
Language Label Description Also known as
English
A Clustering Approach to Constrained Binary Matrix Factorization
scientific article; zbMATH DE number 7047344

    Statements

    A Clustering Approach to Constrained Binary Matrix Factorization (English)
    0 references
    24 April 2019
    0 references
    binary matrix factorization
    0 references
    binary quadratic programming
    0 references
    k-means clustering
    0 references
    approximation algorithm
    0 references
    0 references
    0 references
    0 references

    Identifiers