A clustering approach to constrained binary matrix factorization

DOI10.1007/978-3-642-40837-3_9MaRDI QIDQ4631260zbMATH OpenOpenAlexFDO

Authors

Publication date 24 April 2019

Published in Studies in Big Data (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-40837-3_9

zbMATH Keywords

approximation algorithmbinary matrix factorizationbinary quadratic programmingk-means clustering

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Approximation Schemes for Low-rank Binary Matrix Approximation Problems
• Low rank approximation of binary matrices: column subset selection and generalizations
• NMF with binary constraint and its application
• Parameterized low-rank binary matrix approximation
• From-below approximations in Boolean matrix factorization: geometry and new algorithm

Cites work

• From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
• scientific article; zbMATH DE number 6381735 (Why is no real title available?)
• scientific article; zbMATH DE number 3249560 (Why is no real title available?)
• scientific article; zbMATH DE number 3340881 (Why is no real title available?)
• Learning the parts of objects by non-negative matrix factorization
• Least squares quantization in PCM
• Nonorthogonal decomposition of binary matrices for bounded-error data compression and analysis
• The basic algorithm for pseudo-Boolean programming revisited
• Using underapproximations for sparse nonnegative matrix factorization

Cited in

(10)

• A divide-and-conquer algorithm for binary matrix completion
• Parameterized low-rank binary matrix approximation
• Pairwise constrained concept factorization for data representation
• A survey on deep matrix factorizations
• Nonorthogonal decomposition of binary matrices for bounded-error data compression and analysis
• NMF with binary constraint and its application
• Parameterized low-rank binary matrix approximation
• Low rank approximation of binary matrices: column subset selection and generalizations
• Low-Rank Binary Matrix Approximation in Column-Sum Norm.
• Binary matrix factorization and completion via integer programming

Describes a project that uses

Uses Software

• PROXIMUS
• UCI
• k-means++

This page was built for publication: A clustering approach to constrained binary matrix factorization

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