Time-Weighted Collaborative Filtering Algorithm Based on Improved Mini Batch K-Means Clustering

2021 ◽  
Vol 105 ◽  
pp. 309-317
Author(s):  
Xue Han ◽  
Zhong Wang ◽  
Hui Jun Xu
Keyword(s):  
Collaborative Filtering ◽  
Sparse Matrix ◽  
Pearson Correlation ◽  
Absolute Error ◽  
User Interest ◽  
User Similarity ◽  
Filtering Algorithm ◽  
Collaborative Filtering Algorithm ◽  
Low Efficiency ◽  
Score Matrix

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.

scholarly journals Intelligent Recommendation Algorithm of Multimedia English Distance Education Resources Based on User Model

2022 ◽  
Vol 2022 ◽  
pp. 1-8
Author(s):  
Xiushan Zhang
Keyword(s):  
Collaborative Filtering ◽  
Nearest Neighbor ◽  
Absolute Error ◽  
User Model ◽  
User Interest ◽  
Recommendation Algorithm ◽  
Recommendation Algorithms ◽  
Similarity Calculation ◽  
Collaborative Filtering Algorithm ◽  
Recommendation Accuracy

Based on the understanding and comparison of various main recommendation algorithms, this paper focuses on the collaborative filtering algorithm and proposes a collaborative filtering recommendation algorithm with improved user model. Firstly, the algorithm considers the score difference caused by different user scoring habits when expressing preferences and adopts the decoupling normalization method to normalize the user scoring data; secondly, considering the forgetting shift of user interest with time, the forgetting function is used to simulate the forgetting law of score, and the weight of time forgetting is introduced into user score to improve the accuracy of recommendation; finally, the similarity calculation is improved when calculating the nearest neighbor set. Based on the Pearson similarity calculation, the effective weight factor is introduced to obtain a more accurate and reliable nearest neighbor set. The algorithm establishes an offline user model, which makes the algorithm have better recommendation efficiency. Two groups of experiments were designed based on the mean absolute error (MAE). One group of experiments tested the parameters in the algorithm, and the other group of experiments compared the proposed algorithm with other algorithms. The experimental results show that the proposed method has better performance in recommendation accuracy and recommendation efficiency.

scholarly journals Coating matching recommendation based on improved fuzzy comprehensive evaluation and collaborative filtering algorithm

2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Yuan Xin ◽  
Bu Henan ◽  
Niu Jianmin ◽  
Yu Wenjuan ◽  
Zhou Honggen ◽  
...  
Keyword(s):  
Collaborative Filtering ◽  
Comprehensive Evaluation ◽  
Fuzzy Comprehensive Evaluation ◽  
Absolute Error ◽  
Evaluation Index System ◽  
Scientific Management ◽  
Coating Process ◽  
Process Data ◽  
Filtering Algorithm ◽  
Collaborative Filtering Algorithm

AbstractCoating matching design is one of the important parts of ship coating process design. The selection of coating matching is influenced by various factors such as marine corrosive environment, anti-corrosion period and working conditions. There are also differences in the coating performance requirements for different ship types and different coating parts. At present, the design of coating matching in shipyards depends on the experience of technologist, which is not conducive to the scientific management of ship painting process and the macro control of ship construction cost. Therefore, this paper proposes a hybrid algorithm of fuzzy comprehensive evaluation and collaborative filtering based on user label improvement (IFCE-CF). Based on the analytic hierarchy process (AHP), the evaluation index system of coating matching is constructed, and the weight calculation process of fuzzy comprehensive evaluation is optimized by introducing the user label weight. The collaborative filtering algorithm based on matrix decomposition is used to realize the accurate recommendation of coating matching. Historical coating process data of a shipyard between 2010 and 2020 are selected to verify the recommendation ability of the method in the paper. The results show that using the coating matching intelligent recommendation algorithm proposed in this paper, the root mean square error is < 1.02 and the mean absolute error is < 0.75, the prediction accuracy is significantly better than other research methods, which proves the effectiveness of the method.

Fuzzy trust based collaborative filtering analysis for mobile user preferences

2021 ◽  
pp. 1-7
Author(s):  
Chengfang Tan ◽  
Lin Cui ◽  
Xiaoyin Wu
Keyword(s):  
Collaborative Filtering ◽  
Rapid Development ◽  
Mobile User ◽  
User Preferences ◽  
Data Matrix ◽  
User Interest ◽  
Filtering Algorithm ◽  
Collaborative Filtering Algorithm ◽  
The Impact ◽  
Fuzzy Trust

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.

scholarly journals IMPROVED COLLABORATIVE FILTERING ALGORITHM VIA INFORMATION TRANSFORMATION

2009 ◽  
Vol 20 (02) ◽  
pp. 285-293 ◽  
Author(s):  
JIAN-GUO LIU ◽  
BING-HONG WANG ◽  
QIANG GUO
Keyword(s):  
Computational Complexity ◽  
Collaborative Filtering ◽  
Free Parameter ◽  
Pearson Correlation ◽  
Spreading Activation ◽  
Spreading Process ◽  
Filtering Algorithm ◽  
Target User ◽  
Information Transformation ◽  
Collaborative Filtering Algorithm

In this paper, we propose a spreading activation approach for collaborative filtering (SA-CF). By using the opinion spreading process, the similarity between any users can be obtained. The algorithm has remarkably higher accuracy than the standard collaborative filtering using the Pearson correlation. Furthermore, we introduce a free parameter β to regulate the contributions of objects to user–user correlations. The numerical results indicate that decreasing the influence of popular objects can further improve the algorithmic accuracy and personality. We argue that a better algorithm should simultaneously require less computation and generate higher accuracy. Accordingly, we further propose an algorithm involving only the top-N similar neighbors for each target user, which has both less computational complexity and higher algorithmic accuracy.

Sign in / Sign up

Export Citation Format

Share Document