Boolean Matrix Factorization with SAT and MaxSAT.
Florent AvellanedaRoger VillemairePublished in: CoRR (2021)
Keyphrases
- matrix factorization
- sat solvers
- sat problem
- boolean satisfiability
- boolean formula
- collaborative filtering
- maximum satisfiability
- satisfiability problem
- recommender systems
- orders of magnitude
- low rank
- propositional satisfiability
- sat instances
- constraint satisfaction
- missing data
- negative matrix factorization
- max sat
- search strategies
- conjunctive normal form
- nonnegative matrix factorization
- boolean functions
- branch and bound algorithm
- factorization methods
- stochastic gradient descent
- variational bayesian
- search space
- data matrix
- constraint satisfaction problems
- data sparsity
- np complete
- highly efficient
- upper bound
- probabilistic matrix factorization
- factor analysis
- tensor factorization
- least squares
- search algorithm
- latent factors
- factorization method
- implicit feedback
- lower bound
- probabilistic planning