Parallel exploration of partial solutions in Boolean matrix factorization
Parallel exploration of partial solutions in Boolean matrix factorization is a scholarly work, published in 2019 in ''Journal of Parallel and Distributed Computing''. The main subjects of the publication include distributed constrained optimisation problem, heuristic, Graph matching, computer science, matrix, factorization, greedy algorithm, heuristic, algorithm, parallel computing, theoretical computer science, computation, tensor decomposition, matrix decomposition, scheme, and preprocessor. The authors propose a general parallelization scheme for BMF in which several locally optimal partial matrix decompositions are constructed simultaneously in parallel, instead of just one in a sequential algorithm.