Collaborative filtering based on nonnegative/binary matrix factorization
arXiv:2410.10381 · doi:10.3389/fdata.2025.1599704
Abstract
Collaborative filtering generates recommendations by exploiting user-item similarities based on rating data, which often contains numerous unrated items. To predict scores for unrated items, matrix factorization techniques such as nonnegative matrix factorization (NMF) are often employed. Nonnegative/binary matrix factorization (NBMF), which is an extension of NMF, approximates a nonnegative matrix as the product of nonnegative and binary matrices. While previous studies have applied NBMF primarily to dense data such as images, this paper proposes a modified NBMF algorithm tailored for collaborative filtering with sparse data. In the modified method, unrated entries in the rating matrix are masked, enhancing prediction accuracy. Furthermore, utilizing a low-latency Ising machine in NBMF is advantageous in terms of the computation time, making the proposed method beneficial.
12 pages, 8 figures
References in corpus (9)
- Physics-Inspired Optimization for Quadratic Unconstrained Problems Using a Digital Annealer
- Large-scale photonic Ising machine by spatial light modulation
- Expanding the horizon of automated metamaterials discovery via quantum annealing
- Support vector machines on the D-Wave quantum annealer
- Nonnegative/binary matrix factorization with a D-Wave quantum annealer
- Reverse Annealing for Nonnegative/Binary Matrix Factorization
- Correlation-diversified portfolio construction by finding maximum independent set in large-scale market graph
- Nonnegative/Binary Matrix Factorization for Image Classification using Quantum Annealing
- Image Analysis Based on Nonnegative/Binary Matrix Factorization