A Collaborative Filtering Recommendation Algorithm Based on Cloud Model, Item Attribute and User Data

2014 ◽  
Vol 610 ◽  
pp. 747-751
Author(s):  
Jian Sun ◽  
Xiao Ying Chen
Keyword(s):  
Collaborative Filtering ◽  
Prediction Accuracy ◽  
Cloud Model ◽  
Prediction Algorithm ◽  
Recommendation Algorithm ◽  
Rating Data ◽  
User Data ◽  
Item Attribute ◽  
Rating Prediction ◽  
User Ratings

Aiming at the problems of extremely sparse of user-item rating data and poor recommendation quality, we put forward a collaborative filtering recommendation algorithm based on cloud model, item attribute and user data which combined with the existing literatures. A rating prediction algorithm based on cloud model and item attribute is proposed, based on idea that the similar users rating for the same item are similar and the same user ratings for the similar items are similar and stable. Through compare and analysis this paper’s and other studies experimental results, we get the conclusion that the rating prediction accuracy is improved.

scholarly journals Novel Multidimensional Collaborative Filtering Algorithm Based on Improved Item Rating Prediction

2021 ◽  
Vol 2021 ◽  
pp. 1-14
Author(s):  
Tongyan Li ◽  
Yingxiang Li ◽  
Chen Yi-Ping Phoebe
Keyword(s):  
Collaborative Filtering ◽  
Sparse Data ◽  
Current Data ◽  
Prediction Algorithm ◽  
Filtering Algorithm ◽  
Recommendation Algorithms ◽  
Collaborative Filtering Algorithm ◽  
Scoring Matrix ◽  
Rating Prediction ◽  
User Ratings

Current data has the characteristics of complexity and low information density, which can be called the information sparse data. However, a large amount of data makes it difficult to analyse sparse data with traditional collaborative filtering recommendation algorithms, which may lead to low accuracy. Meanwhile, the complexity of data means that the recommended environment is affected by multiple dimensional factors. In order to solve these problems efficiently, our paper proposes a multidimensional collaborative filtering algorithm based on improved item rating prediction. The algorithm considers a variety of factors that affect user ratings; then, it uses the penalty to account for users’ popularity to calculate the degree of similarity between users and cross-iterative bi-clustering for the user scoring matrix to take into account changes in user’s preferences and improves on the traditional item rating prediction algorithm, which considers user ratings according to multidimensional factors. In this algorithm, the introduction of systematic error factors based on statistical learning improves the accuracy of rating prediction, and the multidimensional method can solve data sparsity problems, enabling the strongest relevant dimension influencing factors with association rules to be found. The experiment results show that the proposed algorithm has the advantages of smaller recommendation error and higher recommendation accuracy.

Industrialization Research and Realization of Preprocessing in Rough Set Based on Similar Prediction

2012 ◽  
Vol 251 ◽  
pp. 185-190
Author(s):  
Dun Hong Yao ◽  
Xiao Ning Peng ◽  
Jia He
Keyword(s):  
Data Processing ◽  
Collaborative Filtering ◽  
Rough Set ◽  
Data Preprocessing ◽  
Sparse Data ◽  
Data Evaluation ◽  
Prediction Algorithm ◽  
Rating Prediction ◽  
Essential Problem ◽  
Data Processing Methods

In every field which needs data processing, the sparseness of data is an essential problem that should be resolved, especially in movies, shopping sites. The users with the same commodity preferences makes the data evaluation valuable. Otherwise, without any evaluation of information, it will result in sparse distribution of the entire data obtained. This article introduces a collaborative filtering technology used in sparse data processing methods - project-based rating prediction algorithm, and extends it to the areas of rough set, the sparse information table processing, rough set data preprocessing sparse issues.

scholarly journals Collaborative Filtering Recommendation Algorithm Based on TF-IDF and User Characteristics

2021 ◽  
Vol 11 (20) ◽  
pp. 9554
Author(s):  
Jianjun Ni ◽  
Yu Cai ◽  
Guangyi Tang ◽  
Yingjuan Xie
Keyword(s):  
Collaborative Filtering ◽  
User Characteristics ◽  
Recommendation Algorithm ◽  
Data Set ◽  
Rating Data ◽  
User Similarity ◽  
Public Data ◽  
Weighted Algorithm ◽  
Collaborative Filtering Algorithm ◽  
The Impact

The recommendation algorithm is a very important and challenging issue for a personal recommender system. The collaborative filtering recommendation algorithm is one of the most popular and effective recommendation algorithms. However, the traditional collaborative filtering recommendation algorithm does not fully consider the impact of popular items and user characteristics on the recommendation results. To solve these problems, an improved collaborative filtering algorithm is proposed, which is based on the Term Frequency-Inverse Document Frequency (TF-IDF) method and user characteristics. In the proposed algorithm, an improved TF-IDF method is used to calculate the user similarity on the basis of rating data first. Secondly, the multi-dimensional characteristics information of users is used to calculate the user similarity by a fuzzy membership method. Then, the above two user similarities are fused based on an adaptive weighted algorithm. Finally, some experiments are conducted on the movie public data set, and the experimental results show that the proposed method has better performance than that of the state of the art.

scholarly journals User Embedding for Rating Prediction in SVD++-Based Collaborative Filtering

Symmetry ◽  
2020 ◽  
Vol 12 (1) ◽  
pp. 121 ◽  
Author(s):  
Wenchuan Shi ◽  
Liejun Wang ◽  
Jiwei Qin
Keyword(s):  
Collaborative Filtering ◽  
Absolute Error ◽  
Rating Data ◽  
Latent Features ◽  
Collaborative Filtering Algorithm ◽  
Rating Prediction ◽  
Value Decomposition ◽  
Linear Interactions ◽  
Information Values ◽  
Explicit Feedback

The collaborative filtering algorithm based on the singular value decomposition plus plus (SVD++) model employs the linear interactions between the latent features of users and items to predict the rating in the recommendation systems. Aiming to further enrich the user model with explicit feedback, this paper proposes a user embedding model for rating prediction in SVD++-based collaborative filtering, named UE-SVD++. We exploit the user potential explicit feedback from the rating data and construct the user embedding matrix by the proposed user-wise mutual information values. In addition, the user embedding matrix is added to the existing user bias and implicit parameters in the SVD++ to increase the accuracy of the user modeling. Through extensive studies on four different datasets, we found that the rating prediction performance of the UE-SVD++ model is improved compared with other models, and the proposed model’s evaluation indicators root-mean-square error (RMSE) and mean absolute error (MAE) are decreased by 1.002–2.110% and 1.182–1.742%, respectively.

Robust Analysis on a Privacy Preserving Recommendation Algorithm under the KNN Attack

2014 ◽  
Vol 610 ◽  
pp. 717-721 ◽  
Author(s):  
Yan Gao ◽  
Jing Bo Xia ◽  
Jing Jing Ji ◽  
Ling Ma
Keyword(s):  
Collaborative Filtering ◽  
Recommendation System ◽  
Privacy Preserving ◽  
Perturbation Techniques ◽  
Recommendation Algorithm ◽  
Rating Data ◽  
Robust Analysis ◽  
History Of

— Among algorithms in recommendation system, Collaborative Filtering (CF) is a popular one. However, the CF methods can’t guarantee the safety of the user rating data which cause private preserving issue. In general, there are four kinds of methods to solve private preserving: Perturbation, randomization, swapping and encryption. In this paper, we mimic algorithms which attack the privacy-preserving methods with randomized perturbation techniques. After leaking part of rating history of a customer, we can infer this customer’s other rating history. At the end, we propose an algorithm to enhance the system so as to avoid being attacked.

scholarly journals An Adaptive Social Network-Aware Collaborative Filtering Algorithm for Improved Rating Prediction Accuracy

IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 68301-68310 ◽  
Author(s):  
Dionisis Margaris ◽  
Anna Kobusinska ◽  
Dimitris Spiliotopoulos ◽  
Costas Vassilakis
Keyword(s):  
Social Network ◽  
Collaborative Filtering ◽  
Prediction Accuracy ◽  
Filtering Algorithm ◽  
Collaborative Filtering Algorithm ◽  
Rating Prediction

A Novel Collaborative Filtering Recommendation Approach Based on Field Authorities

2013 ◽  
Vol 765-767 ◽  
pp. 989-993
Author(s):  
Zhi Xue ◽  
Yao Xue Zhang ◽  
Yue Zhi Zhou ◽  
Wei Hu
Keyword(s):  
Collaborative Filtering ◽  
Prediction Accuracy ◽  
Word Of Mouth ◽  
Real Life ◽  
Recommendation Algorithm ◽  
Computational Overhead ◽  
External Data ◽  
Data Limitations ◽  
Accuracy Level ◽  
Filtering Approach

This paper presents a novel collaborative filtering recommendation algorithm based on field authorities which simulates the real life word of mouth recommendation mode. It uses the specialistic knowledge from field authorities of different genres, and successfully addresses data sparsity and noise problems existing in traditional collaborative filtering. Meanwhile it also improves prediction accuracy and saves computational overhead effectively. Experiments on MovieLens datasets show that the accuracy of our algorithm is significantly higher than collaborative filtering approach based on experts, and has larger scope because of no external data limitations. Meanwhile, compared to traditional k-NN collaborative filtering, our algorithm has a better performance both in MAE and precision experiments, and the computational overhead has a decrease of 19.2% while they provide the same accuracy level.

Sign in / Sign up

Export Citation Format

Share Document