A Clustering Approach to Constrained Binary Matrix Factorization

DOI10.1007/978-3-642-40837-3_9zbMath1407.68398OpenAlexW60908300MaRDI QIDQ4631260

No author found.

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 quadratic programmingk-means clusteringbinary matrix factorization

Mathematics Subject Classification ID

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

Related Items

A divide-and-conquer algorithm for binary matrix completion, Unnamed Item, Parameterized low-rank binary matrix approximation, Parameterized Low-Rank Binary Matrix Approximation, Low-Rank Binary Matrix Approximation in Column-Sum Norm.

Uses Software

• UCI-ml
• PROXIMUS
• k-means++

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Using underapproximations for sparse nonnegative matrix factorization
• The basic algorithm for pseudo-Boolean programming revisited
• Nonorthogonal decomposition of binary matrices for bounded-error data compression and analysis
• From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
• Least squares quantization in PCM
• Learning the parts of objects by non-negative matrix factorization