Scalable and Explainable 1-Bit Matrix Completion via Graph Signal Learning
Keywords:Learning Preferences or Rankings, Recommender Systems & Collaborative Filtering, Matrix & Tensor Methods
AbstractOne-bit matrix completion is an important class of positive-unlabeled (PU) learning problems where the observations consist of only positive examples, e.g., in top-N recommender systems. For the first time, we show that 1-bit matrix completion can be formulated as the problem of recovering clean graph signals from noise-corrupted signals in hypergraphs. This makes it possible to enjoy recent advances in graph signal learning. Then, we propose the spectral graph matrix completion (SGMC) method, which can recover the underlying matrix in distributed systems by filtering the noisy data in the graph frequency domain. Meanwhile, it can provide micro- and macro-level explanations by following vertex-frequency analysis. To tackle the computational and memory issue of performing graph signal operations on large graphs, we construct a scalable Nystrom algorithm which can efficiently compute orthonormal eigenvectors. Furthermore, we also develop polynomial and sparse frequency filters to remedy the accuracy loss caused by the approximations. We demonstrate the effectiveness of our algorithms on top-N recommendation tasks, and the results on three large-scale real-world datasets show that SGMC can outperform state-of-the-art top-N recommendation algorithms in accuracy while only requiring a small fraction of training time compared to the baselines.
How to Cite
Chen, C., Li, D., Yan, J., Huang, H., & Yang, X. (2021). Scalable and Explainable 1-Bit Matrix Completion via Graph Signal Learning. Proceedings of the AAAI Conference on Artificial Intelligence, 35(8), 7011-7019. https://doi.org/10.1609/aaai.v35i8.16863
AAAI Technical Track on Machine Learning I