Non-negative Matrix Factorization for Binary Space Learning

Non-Negative matrix factorization (NMF) is a popular research problem in data dimensional reduction. Conventional NMF approaches cannot achieve a subspace made up of binary codes from the high-dimensional data space. To address the above-mentioned problem, we propose a method based on nonnegative matrix factorization to generate a low-dimensional subspace made up of binary codes from the high-dimensional data. The problem can be mathematically expressed as a 0-1 integer mixed optimization problem. For this purpose, We put forward a method based on discrete cyclic coordination descent to obtain a local optimal solution. Experiments show that our means can obtain the better clustering ability than conventional non-negative matrix factorization and its variant approaches.