Improved Local Search for Binary Matrix Factorization
نویسندگان
چکیده
Rank K Binary Matrix Factorization (BMF) approximates a binary matrix by the product of two binary matrices of lower rank, K, using either L1 or L2 norm. In this paper, we first show that the BMFwithL2 norm can be reformulated as an Unconstrained Binary Quadratic Programming (UBQP) problem. We then review several local search strategies that can be used to improve the BMF solutions obtained by previously proposed methods, before introducing a new local search dedicated to the BMF problem. We show in particular that the proposed solution is in general faster than the previously proposed ones. We then assess its behavior on several collections and methods and show that it significantly improves methods targeting the L2 norms on all the datasets considered; for the L1 norm, the improvement is also significant for real, structured datasets and for the BMF problem without the binary reconstruction constraint.
منابع مشابه
Riordan group approaches in matrix factorizations
In this paper, we consider an arbitrary binary polynomial sequence {A_n} and then give a lower triangular matrix representation of this sequence. As main result, we obtain a factorization of the innite generalized Pascal matrix in terms of this new matrix, using a Riordan group approach. Further some interesting results and applications are derived.
متن کاملDamped Newton based Iterative Non-negative Matrix Factorization for Intelligent Wood Defects Detection
The Non-negative matrix factorization (NMF) can be formulated as a minimization problem with bound constraints. NMF is capable to produce a regionor partbased representations of the wood images. We present an extension to the NMF and discuss the development as well as the use of damped Newton optimization approach for update matrices W and H called iterative DNNMF with good convergence property...
متن کاملIterative Weighted Non-smooth Non-negative Matrix Factorization for Face Recognition
Non-negative Matrix Factorization (NMF) is a part-based image representation method. It comes from the intuitive idea that entire face image can be constructed by combining several parts. In this paper, we propose a framework for face recognition by finding localized, part-based representations, denoted “Iterative weighted non-smooth non-negative matrix factorization” (IWNS-NMF). A new cost fun...
متن کاملSupervised Matrix Factorization for Cross-Modality Hashing
Matrix factorization has been recently utilized for the task of multi-modal hashing for cross-modality visual search, where basis functions are learned to map data from different modalities to the same Hamming embedding. In this paper, we propose a novel cross-modality hashing algorithm termed Supervised Matrix Factorization Hashing (SMFH) which tackles the multi-modal hashing problem with a co...
متن کاملAn improved non-negative matrix factorization algorithm based on genetic algorithm
The non-negative matrix factorization (NMF) algorithm is a classical matrix factorization and dimension reduction method in machine learning and data mining. However, in real problems, we always have to run the algorithm for several times and use the best matrix factorization result as the final output because of the random initialization of the matrix factorization. In this paper, we proposed ...
متن کامل