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

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-642-40837-3_9
+Normal rank
@@ Property / OpenAlex ID @@
+W60908300
@@ Property / OpenAlex ID: W60908300 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2934696
@@ Property / cites work: Q2934696 / rank @@
+Normal rank
@@ Property / cites work @@
+From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
+Normal rank
@@ Property / cites work @@
+The basic algorithm for pseudo-Boolean programming revisited
+Normal rank
@@ Property / cites work @@
+Using underapproximations for sparse nonnegative matrix factorization
+Normal rank
@@ Property / cites work @@
+Q5538300
@@ Property / cites work: Q5538300 / rank @@
+Normal rank
@@ Property / cites work @@
+Nonorthogonal decomposition of binary matrices for bounded-error data compression and analysis
+Normal rank
@@ Property / cites work @@
+Learning the parts of objects by non-negative matrix factorization
+Normal rank
@@ Property / cites work @@
+Least squares quantization in PCM
@@ Property / cites work: Least squares quantization in PCM / rank @@
+Normal rank
@@ Property / cites work @@
+Q5617409
@@ Property / cites work: Q5617409 / rank @@
+Normal rank