scholarly journals Application of Collaborative Filtering Personalized Recommendation Algorithms to Website Navigation

2021 ◽  
Vol 1813 (1) ◽  
pp. 012048
Author(s):  
Hao Wu
Keyword(s):  
Collaborative Filtering ◽  
Personalized Recommendation ◽  
Recommendation Algorithms

scholarly journals A Triangular Personalized Recommendation Algorithm for Improving Diversity

2018 ◽  
Vol 2018 ◽  
pp. 1-11 ◽  
Author(s):  
Biao Cai ◽  
Xiaowang Yang ◽  
Yusheng Huang ◽  
Hongjun Li ◽  
Qiang Sang
Keyword(s):  
Collaborative Filtering ◽  
Information Overload ◽  
Personalized Recommendation ◽  
Recommendation Algorithm ◽  
Filtering Method ◽  
Online Databases ◽  
Recommendation Algorithms ◽  
Recommendation Accuracy ◽  
Third Dimension ◽  
Triangular Area

Recommendation systems are used when searching online databases. As such they are very important tools because they provide users with predictions of the outcomes of different potential choices and help users to avoid information overload. They can be used on e-commerce websites and have attracted considerable attention in the scientific community. To date, many personalized recommendation algorithms have aimed to improve recommendation accuracy from the perspective of vertex similarities, such as collaborative filtering and mass diffusion. However, diversity is also an important evaluation index in the recommendation algorithm. In order to study both the accuracy and diversity of a recommendation algorithm at the same time, this study introduced a “third dimension” to the commonly used user/product two-dimensional recommendation, and a recommendation algorithm is proposed that is based on a triangular area (TR algorithm). The proposed algorithm combines the Markov chain and collaborative filtering method to make recommendations for users by building a triangle model, making use of the triangulated area. Additionally, recommendation algorithms based on a triangulated area are parameter-free and are more suitable for applications in real environments. Furthermore, the experimental results showed that the TR algorithm had better performance on diversity and novelty for real datasets of MovieLens-100K and MovieLens-1M than did the other benchmark methods.

CAN DISSIMILAR USERS CONTRIBUTE TO ACCURACY AND DIVERSITY OF PERSONALIZED RECOMMENDATION?

2010 ◽  
Vol 21 (10) ◽  
pp. 1217-1227 ◽  
Author(s):  
WEI ZENG ◽  
MING-SHENG SHANG ◽  
QIAN-MING ZHANG ◽  
LINYUAN LÜ ◽  
TAO ZHOU
Keyword(s):  
Collaborative Filtering ◽  
Recommender System ◽  
High Accuracy ◽  
Personalized Recommendation ◽  
Recommendation Algorithm ◽  
Filtering Algorithm ◽  
Recommendation Algorithms ◽  
Collaborative Filtering Algorithm ◽  
High Diversity ◽  
Better Than

Recommender systems are becoming a popular and important set of personalization techniques that assist individual users with navigating through the rapidly growing amount of information. A good recommender system should be able to not only find out the objects preferred by users, but also help users in discovering their personalized tastes. The former corresponds to high accuracy of the recommendation, while the latter to high diversity. A big challenge is to design an algorithm that provides both highly accurate and diverse recommendation. Traditional recommendation algorithms only take into account the contributions of similar users, thus, they tend to recommend popular items for users ignoring the diversity of recommendations. In this paper, we propose a recommendation algorithm by considering both the effects of similar and dissimilar users under the framework of collaborative filtering. Extensive analyses on three datasets, namely MovieLens, Netflix and Amazon, show that our method performs much better than the standard collaborative filtering algorithm for both accuracy and diversity.

scholarly journals Research on E-Commerce Platform-Based Personalized Recommendation Algorithm

2016 ◽  
Vol 2016 ◽  
pp. 1-7 ◽  
Author(s):  
Zhijun Zhang ◽  
Gongwen Xu ◽  
Pengfei Zhang
Keyword(s):  
Collaborative Filtering ◽  
Recommendation System ◽  
Personalized Recommendation ◽  
Prediction Formula ◽  
Recommendation Algorithm ◽  
Real Dataset ◽  
Recommendation Algorithms ◽  
Filling Method ◽  
System Time ◽  
Different Levels

Aiming at data sparsity and timeliness in traditional E-commerce collaborative filtering recommendation algorithms, when constructing user-item rating matrix, this paper utilizes the feature that commodities in E-commerce system belong to different levels to fill in nonrated items by calculating RF/IRF of the commodity’s corresponding level. In the recommendation prediction stage, considering timeliness of the recommendation system, time weighted based recommendation prediction formula is adopted to design a personalized recommendation model by integrating level filling method and rating time. The experimental results on real dataset verify the feasibility and validity of the algorithm and it owns higher predicting accuracy compared with present recommendation algorithms.

scholarly journals A Recommendation Approach for Rating Prediction Based on User Interest and Trust Value

2021 ◽  
Vol 2021 ◽  
pp. 1-9
Author(s):  
Hailong Chen ◽  
Haijiao Sun ◽  
Miao Cheng ◽  
Wuyue Yan
Keyword(s):  
Collaborative Filtering ◽  
Personalized Recommendation ◽  
User Interest ◽  
Recommendation Algorithm ◽  
Weighting Method ◽  
Trust Value ◽  
Recommendation Algorithms ◽  
Similarity Calculation ◽  
Collaborative Filtering Algorithm ◽  
Recommendation Accuracy

Collaborative filtering recommendation algorithm is one of the most researched and widely used recommendation algorithms in personalized recommendation systems. Aiming at the problem of data sparsity existing in the traditional collaborative filtering recommendation algorithm, which leads to inaccurate recommendation accuracy and low recommendation efficiency, an improved collaborative filtering algorithm is proposed in this paper. The algorithm is improved in the following three aspects: firstly, considering that the traditional scoring similarity calculation excessively relies on the common scoring items, the Bhattacharyya similarity calculation is introduced into the traditional calculation formula; secondly, the trust weight is added to accurately calculate the direct trust value and the trust transfer mechanism is introduced to calculate the indirect trust value between users; finally, the user similarity and user trust are integrated, and the prediction result is generated by the trust weighting method. Experiments show that the proposed algorithm can effectively improve the prediction accuracy of recommendations.

Optimized Collaborative Filtering Recommendation Based on User’s Social Relationships

2014 ◽  
Vol 1044-1045 ◽  
pp. 1484-1488
Author(s):  
Yue Kun Fan ◽  
Xin Ye Li ◽  
Meng Meng Cao
Keyword(s):  
Collaborative Filtering ◽  
Social Relationships ◽  
Digital Libraries ◽  
Social Relationship ◽  
Nearest Neighbor ◽  
Mean Absolute Error ◽  
Absolute Error ◽  
Personalized Recommendation ◽  
Recommendation Algorithm

Currently collaborative filtering is widely used in e-commerce, digital libraries and other areas of personalized recommendation service system. Nearest-neighbor algorithm is the earliest proposed and the main collaborative filtering recommendation algorithm, but the data sparsity and cold-start problems seriously affect the recommendation quality. To solve these problems, A collaborative filtering recommendation algorithm based on users' social relationships is proposed. 0n the basis of traditional filtering recommendation technology, it combines with the interested objects of user's social relationship and takes the advantage of the tags to projects marked by users and their interested objects to improve the methods of recommendation. The experimental results of MAE ((Mean Absolute Error)) verify that this method can get better quality of recommendation.

Goal-Based Framework for Multi-User Personalized Similarities in e-Learning Scenarios

2014 ◽  
Vol 4 (1) ◽  
pp. 1-14 ◽  
Author(s):  
M. Waseem Chughtai ◽  
Imran Ghani ◽  
Ali Selamat ◽  
Seung Ryul Jeong
Keyword(s):  
Collaborative Filtering ◽  
Cold Start ◽  
Traditional Education ◽  
Experimental Result ◽  
Personalized Recommendation ◽  
Web Based ◽  
Web Based Learning ◽  
E Learning ◽  
Learning Scenarios ◽  
Content Based Filtering

Web-based learning or e-Learning in contrast to traditional education systems offer a lot of benefits. This article presents the Goal-based Framework for providing personalized similarities between multi users profile preferences in formal e-Learning scenarios. It consists of two main approaches: content-based filtering and collaborative filtering. Because only traditional content-based filtering is not sufficient to generate the recommendations for new-users, therefore, the proposed work hybridized multi user's collaborative filtering functionalities with personalized content-based profile preferences filtering. The main purpose of this proposed work is to (a) overcome the user-based cold-start profile recommendations and (b) improve the recommendations accuracy for new-users in formal e-learning recommendation systems. The experimental has been done by using the famous ‘MovieLens' dataset with 15.86% density of the user-item matrix with respect to ratings, while the evaluation of experimental results have been performed with precision mean and recall mean to test the effectiveness of Goal-based personalized recommendation framework. The Experimental result Precision: 81.90% and Recall: 86.56% show that the proposed framework goals performed well for the improvement of user-based cold-start issue as well as for content-based profile recommendations, using multi users personalized collaborative similarities, in formal e-Learning scenarios effectively.

Sign in / Sign up

Export Citation Format

Share Document