A novel similarity calculation for collaborative filtering

2013 ◽  
Author(s):  
Hua Li ◽  
Genlong Wang ◽  
Min Gao
Keyword(s):  
Collaborative Filtering ◽  
Similarity Calculation

scholarly journals A New Similarity Measure for User-based Collaborative Filtering in Recommender Systems

2015 ◽  
Vol 14 (9) ◽  
pp. 6118-6128 ◽  
Author(s):  
T. Srikanth ◽  
M. Shashi
Keyword(s):  
Collaborative Filtering ◽  
Recommender Systems ◽  
Similarity Measure ◽  
Recommender System ◽  
Distance Measure ◽  
Current User ◽  
Challenging Problem ◽  
Popular Approach ◽  
Similarity Calculation

Collaborative filtering is a popular approach in recommender Systems that helps users in identifying the items they may like in a wagon of items. Finding similarity among users with the available item ratings so as to predict rating(s) for unseen item(s) based on the preferences of likeminded users for the current user is a challenging problem. Traditional measures like Cosine similarity and Pearson correlation’s correlation exhibit some drawbacks in similarity calculation. This paper presents a new similarity measure which improves the performance of Recommender System. Experimental results on MovieLens dataset show that our proposed distance measure improves the quality of prediction. We present clustering results as an extension to validate the effectiveness of our proposed method.

An IPTV Recommendation Method Based on Latent Context

2014 ◽  
Vol 668-669 ◽  
pp. 1237-1242
Author(s):  
Wen Ming Guo ◽  
Liang Sun
Keyword(s):  
Collaborative Filtering ◽  
Improved Method ◽  
Network Television ◽  
Recommendation Algorithm ◽  
Time Model ◽  
Data Scarcity ◽  
Algorithm Construct ◽  
Similarity Calculation ◽  
Similar Item ◽  
The Impact

In the light of the data differences between network television and the Internet, this paper solve the problem of grading IPTV by the introduction of time context information and computing the latent scores based on the traditional and item-based collaborative filtering recommendation algorithm. Construct the user - item, the item - time model and optimize item similarity calculation so as to ease the difficulty of searching the similar item due to the data scarcity. The experimental results show that the improved method can obviously increase the recommendation precision and has a certain effect on reducing the impact of data scarcity compared with the traditional item-based collaborative filtering.

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 Various Implementation of Collaborative Filtering-Based Approach on Recommendation Systems using Similarity

2020 ◽  
pp. 179-186
Author(s):  
Zainur Romadhon ◽  
Eko Sediyono ◽  
Catur Edi Widodo
Keyword(s):  
Collaborative Filtering ◽  
Fast Food ◽  
Recommendation System ◽  
Black Pepper ◽  
The Internet ◽  
Daily Lives ◽  
A Value ◽  
Similarity Calculation ◽  
Item Data ◽  
Filtering Approach

The Recommendation System plays an increasingly important role in our daily lives. With the increasing amount of information on the internet, the recommendation system can also solve problems caused by increasing information quickly. Collaborative filtering is one method in the recommendation system that makes recommendations by analyzing correlations between users. Collaborative filtering accumulates customer item ratings, identifies customers with common ratings, and offers recommendations based on inter-customer comparisons. This study aims to build a system that can provide recommendations to users who want to order or choose fast food menus. This recommendation system provides recommendations based on item data calculations with customer review data using a collaborative filtering approach. The results of applying cosine similarity calculation to determine fast food menu recommendations obtained for the item-based recommendation is Pizza Frankfurter BBQ Large with a value of 1.0, item-based with genre recommendation is Calblend Float with value 1.0 and user-based recommendation is Pizza Black Pepper Beef / Chicken Large with mean score 2.5.

scholarly journals A Collaborative Filtering Recommendation Algorithm Based on User Confidence and Time Context

2019 ◽  
Vol 2019 ◽  
pp. 1-12 ◽  
Author(s):  
Guangxia Xu ◽  
Zhijing Tang ◽  
Chuang Ma ◽  
Yanbing Liu ◽  
Mahmoud Daneshmand
Keyword(s):  
Collaborative Filtering ◽  
Traditional Method ◽  
Recommendation System ◽  
Rapid Development ◽  
Poor Performance ◽  
Mobile Internet ◽  
Personalized Recommendation ◽  
Recommendation Algorithm ◽  
Rating Data ◽  
Similarity Calculation

Complex and diverse information is flooding entire networks because of the rapid development of mobile Internet and information technology. Under this condition, it is difficult for a person to locate and access useful information for making decisions. Therefore, the personalized recommendation system which utilizes the user’s behaviour information to recommend interesting items emerged. Currently, collaborative filtering has been successfully utilized in personalized recommendation systems. However, under the condition of extremely sparse rating data, the traditional method of similarity between users is relatively simple. Moreover, it does not consider that the user’s interest will change over time, which results in poor performance. In this paper, a new similarity measure method which considers user confidence and time context is proposed to preferably improve the similarity calculation between users. Finally, the experimental results demonstrate that the proposed algorithm is suitable for the sparse data and effectively improves the prediction accuracy and enhances the recommendation quality at the same time.

Sign in / Sign up

Export Citation Format

Share Document