A Fast Matrix-Completion-Based Approach for Recommendation Systems
Matrix completion is widely used in machine learning, engineering control, image processing, and recommendation systems. Currently, a popular algorithm for matrix completion is Singular Value Threshold (SVT). In this algorithm, the singular value threshold should be set first. However, in a recommendation system, the dimension of the preference matrix keeps changing. Therefore, it is difficult to directly apply SVT. In addition, what the users of a recommendation system need is a sequence of personalized recommended results rather than the estimation of their scores. According to the above ideas, this paper proposes a novel approach named probability completion model~(PCM). By reducing the data dimension, the transitivity of the similar matrix, and singular value decomposition, this approach quickly obtains a completion matrix with the same probability distribution as the original matrix. The approach greatly reduces the computation time based on the accuracy of the sacrifice part, and can quickly obtain a low-rank similarity matrix with data trend approximation properties. The experimental results show that PCM can quickly generate a complementary matrix with similar data trends as the original matrix. The LCS score and efficiency of PCM are both higher than SVT.
Code (0)
등록된 구현이 없습니다.
Tasks
Matrix CompletionRecommendation SystemsSimilar Papers 제목 키워드 기반
Recommendation via matrix completion using Kolmogorov complexity
A usual way to model a recommendation system is as a matrix completion problem. There are several matrix completion methods, typically using optimization approaches or collaborative filtering. Most approaches assume that…
Collaborative FilteringMatrix CompletionRecommendation SystemsSimple, Fast, and Flexible Framework for Matrix Completion with Infinite Width Neural Networks
Matrix completion problems arise in many applications including recommendation systems, computer vision, and genomics. Increasingly larger neural networks have been successful in many of these applications, but at consid…
Image InpaintingMatrix CompletionRecommendation SystemsFast Dual-Regularized Autoencoder for Sparse Biological Data
Relationship inference from sparse data is an important task with applications ranging from product recommendation to drug discovery. A recently proposed linear model for sparse matrix completion has demonstrated surpris…
Drug DiscoveryMatrix CompletionProduct RecommendationRecommendation SystemsConvolutional Graph-Tensor Net for Graph Data Completion
Graph data completion is a fundamentally important issue as data generally has a graph structure, e.g., social networks, recommendation systems, and the Internet of Things. We consider a graph where each node has a data …
Recommendation SystemsSAR: Semantic Analysis for Recommendation
Recommendation system is a common demand in daily life and matrix completion is a widely adopted technique for this task. However, most matrix completion methods lack semantic interpretation and usually result in weak-se…
Matrix Completion