2021 ◽  
Vol 105 ◽  
pp. 309-317
Author(s):  
Xue Han ◽  
Zhong Wang ◽  
Hui Jun Xu

The traditional collaborative filtering recommendation algorithm has the defects of sparse score matrix, weak scalability and user interest deviation, which lead to the low efficiency of algorithm and low accuracy of score prediction. Aiming at the above problems, this paper proposed a time-weighted collaborative filtering algorithm based on improved Mini Batch K-Means clustering. Firstly, the algorithm selected the Pearson correlation coefficient to improve the Mini Batch K-Means clustering, and used the improved Mini Batch K-Means algorithm to cluster the sparse scoring matrix, calculated the user interest score to complete the filling of the sparse matrix. Then, considering the influence of user interest drift with time, the algorithm introduced the Newton cooling time-weighted to improve user similarity. And then calculated user similarity based on the filled score matrix, which helped to get the last predicted score of unrated items The experimental results show that, compared with the traditional collaborative filtering algorithms, the mean absolute error of Proposed improved algorithm is d, and the Precision, Recall and F1 value of MBKT-CF also get a large improvement, which has a higher rating prediction accuracy.


Author(s):  
Chengfang Tan ◽  
Lin Cui ◽  
Xiaoyin Wu

With the rapid development of mobile terminal devices, mobile user activities can be carried out anytime and anywhere through various mobile terminals. The current research on mobile communication network is mainly focused on extracting useful and interesting information for mobile user from massive and disordered information. However, the sparsity of scoring data matrix results in low quality of recommendation algorithm. In order to overcome this drawback, the traditional collaborative filtering algorithm is improved. First, the user-interest matrix and item-feature matrix were obtained by analyzing mobile user behavior and item attributes. Fuzzy trust based model is utilized for collaborative filtering analysis for mobile user preferences. Then, the similarity between different mobile users was calculated by weighted calculation. With this method, mobile user preference can be predicted effectively, making it possible to recommend rational resource and waste less time in extracting resources out of the massive information. Experimental results show that the proposed algorithm reduces the mean absolute error (MAE) and the impact of sparse scoring matrix data compared with the traditional collaborative filtering algorithm, and improves the recommendation effect to a certain extent.


2013 ◽  
Vol 411-414 ◽  
pp. 2292-2296
Author(s):  
Jia Si Gu ◽  
Zheng Liu

The traditional collaborative filtering algorithm has a better recommendation quality and efficiency, it has been the most widely used in personalized recommendation system. Based on the traditional collaborative filtering algorithm,this paper considers the user interest diversity and combination of cloud model theory.it presents an improved cloud model based on collaborative filtering recommendation algorithm.The test results show that, the algorithm has better recommendation results than other kinds of traditional recommendation algorithm.


Sign in / Sign up

Export Citation Format

Share Document