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.

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.

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 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 A Personalized Recommendation Algorithm Based on the User’s Implicit Feedback in E-Commerce

2018 ◽  
Vol 10 (12) ◽  
pp. 117 ◽  
Author(s):  
Bo Wang ◽  
Feiyue Ye ◽  
Jialu Xu
Keyword(s):  
Collaborative Filtering ◽  
Recommendation System ◽  
Word Embedding ◽  
Purchase Behavior ◽  
Personalized Recommendation ◽  
Implicit Feedback ◽  
Recommendation Algorithm ◽  
Rating Data ◽  
Feedback Information ◽  
Recommendation Accuracy

A recommendation system can recommend items of interest to users. However, due to the scarcity of user rating data and the similarity of single ratings, the accuracy of traditional collaborative filtering algorithms (CF) is limited. Compared with user rating data, the user’s behavior log is easier to obtain and contains a large amount of implicit feedback information, such as the purchase behavior, comparison behavior, and sequences of items (item-sequences). In this paper, we proposed a personalized recommendation algorithm based on a user’s implicit feedback (BUIF). BUIF considers not only the user’s purchase behavior but also the user’s comparison behavior and item-sequences. We extracted the purchase behavior, comparison behavior, and item-sequences from the user’s behavior log; calculated the user’s similarity by purchase behavior and comparison behavior; and extended word-embedding to item-embedding to obtain the item’s similarity. Based on the above method, we built a secondary reordering model to generate the recommendation results for users. The results of the experiment on the JData dataset show that our algorithm shows better improvement in regard to recommendation accuracy over other CF algorithms.

scholarly journals A Novel Preferential Diffusion Recommendation Algorithm Based on User’s Nearest Neighbors

2017 ◽  
Vol 2017 ◽  
pp. 1-7
Author(s):  
Fuguo Zhang ◽  
Yehuan Liu ◽  
Qinqiao Xiong
Keyword(s):  
Information Overload ◽  
Nearest Neighbors ◽  
Data Sets ◽  
The Novel ◽  
Real World Data ◽  
Recommendation Algorithm ◽  
Preferential Diffusion ◽  
Recommendation Algorithms ◽  
Recommendation Accuracy ◽  
High Degree

Recommender system is a very efficient way to deal with the problem of information overload for online users. In recent years, network based recommendation algorithms have demonstrated much better performance than the standard collaborative filtering methods. However, most of network based algorithms do not give a high enough weight to the influence of the target user’s nearest neighbors in the resource diffusion process, while a user or an object with high degree will obtain larger influence in the standard mass diffusion algorithm. In this paper, we propose a novel preferential diffusion recommendation algorithm considering the significance of the target user’s nearest neighbors and evaluate it in the three real-world data sets: MovieLens 100k, MovieLens 1M, and Epinions. Experiments results demonstrate that the novel preferential diffusion recommendation algorithm based on user’s nearest neighbors can significantly improve the recommendation accuracy and diversity.

scholarly journals Fusion of Internal Similarity to Improve the Accuracy of Recommendation Algorithm

2022 ◽  
Vol 24 (1) ◽  
pp. 139-140
Author(s):  
Dr.S. Dhanabal ◽  
◽  
Dr.K. Baskar ◽  
R. Premkumar ◽  
◽  
...  
Keyword(s):  
Collaborative Filtering ◽  
Recommender Systems ◽  
Information Overload ◽  
Real Life ◽  
Similarity Matrix ◽  
Recommendation Algorithm ◽  
Simulation Experiments ◽  
Average Similarity ◽  
Recommendation Accuracy ◽  
Item Item

Collaborative filtering algorithms (CF) and mass diffusion (MD) algorithms have been successfully applied to recommender systems for years and can solve the problem of information overload. However, both algorithms suffer from data sparsity, and both tend to recommend popular products, which have poor diversity and are not suitable for real life. In this paper, we propose a user internal similarity-based recommendation algorithm (UISRC). UISRC first calculates the item-item similarity matrix and calculates the average similarity between items purchased by each user as the user’s internal similarity. The internal similarity of users is combined to modify the recommendation score to make score predictions and suggestions. Simulation experiments on RYM and Last.FM datasets, the results show that UISRC can obtain better recommendation accuracy and a variety of recommendations than traditional CF and MD algorithms.

Research on Location-Based Personalized Recommendation System

2014 ◽  
Vol 490-491 ◽  
pp. 1493-1496
Author(s):  
Huan Gao ◽  
Xi Tian ◽  
Xiang Ling Fu
Keyword(s):  
Collaborative Filtering ◽  
Real Time ◽  
Recommendation System ◽  
Information Overload ◽  
Information Filtering ◽  
Mobile Internet ◽  
Personalized Recommendation ◽  
Recommendation Algorithm ◽  
New System

With the mobile Internet developing in China, the problem of information overload has been brought to us. The traditional personalized recommendation cannot meet the needs of the mobile Internet. In this paper, the recommendation algorithm is mainly based on the collaborative filtering, but the new factors are introduced into the recommendation system. The new system takes the user's location and friends recommendation into the personalized recommendation system so that the recommendation system can meet the mobile Internet requirements. Besides, this paper also puts forward the concept of moving business circle for information filtering, which realizes the precise and real-time personalized recommendations. This paper also proves the recommendation effects through collecting and analyzing the data, which comes from the website of dianping.com.

scholarly journals Personalized News Recommendation and Simulation Based on Improved Collaborative Filtering Algorithm

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-12
Author(s):  
Kunni Han
Keyword(s):  
Collaborative Filtering ◽  
Nearest Neighbor ◽  
Data Preprocessing ◽  
Recall Rate ◽  
Personalized Recommendation ◽  
Recommendation Algorithm ◽  
Data Set ◽  
Filtering Algorithm ◽  
Collaborative Filtering Algorithm ◽  
Recommendation Accuracy

Faced with massive amounts of online news, it is often difficult for the public to quickly locate the news they are interested in. The personalized recommendation technology can dig out the user’s interest points according to the user’s behavior habits, thereby recommending the news that may be of interest to the user. In this paper, improvements are made to the data preprocessing stage and the nearest neighbor collection stage of the collaborative filtering algorithm. In the data preprocessing stage, the user-item rating matrix is filled to alleviate its sparsity. The label factor and time factor are introduced to make the constructed user preference model have a better expression effect. In the stage of finding the nearest neighbor set, the collaborative filtering algorithm is combined with the dichotomous K-means algorithm, the user cluster matching the target user is selected as the search range of the nearest neighbor set, and the similarity measurement formula is improved. In order to verify the effectiveness of the algorithm proposed in this paper, this paper selects a simulated data set to test the performance of the proposed algorithm in terms of the average absolute error of recommendation, recommendation accuracy, and recall rate and compares it with the user-based collaborative filtering recommendation algorithm. In the simulation data set, the algorithm in this paper is superior to the traditional algorithm in most users. The algorithm in this paper decomposes the sparse matrix to reduce the impact of data sparsity on the traditional recommendation algorithm, thereby improving the recommendation accuracy and recall rate of the recommendation algorithm and reducing the recommendation error.

A Novel Personalized Filtering Recommendation Algorithm Based on Collaborative Tagging

2011 ◽  
Vol 186 ◽  
pp. 621-625
Author(s):  
Ming Yang Sun ◽  
Wei Feng Sun ◽  
Xi Dong Liu ◽  
Lei Xue
Keyword(s):  
Computational Complexity ◽  
Collaborative Filtering ◽  
Collaborative Tagging ◽  
Recommendation Algorithm ◽  
Trade Off ◽  
Filtering Method ◽  
Recommendation Algorithms ◽  
Sparsity Level ◽  
Personal Interests

Recommendation algorithms suffer the quality from the huge and sparse dataset. Memory-based collaborative filtering method has addressed the problem of sparsity by predicting unrated values. However, this method increases the computational complexity, sparsity and expensive complexity of computation are trade-off. In this paper, we propose a novel personalized filtering (PF) recommendation algorithm based on collaborative tagging, which weights the feature of tags that show latent personal interests and constructs a top-N tags set to filter out the undersized and dense dataset. The PF recommendation algorithm can track the changes of personal interests, which is an untilled field for previous studies. The results of empirical experiments show that the sparsity level of PF recommendation algorithm is much lower, and it is more computationally economic than previous algorithms.

scholarly journals Research of the Context Recommendation Algorithm Based on the Tripartite Graph Model in Complex Systems

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-11
Author(s):  
Fei Long
Keyword(s):  
Complex Systems ◽  
Information Overload ◽  
Rapid Development ◽  
Three Dimensional ◽  
Graph Model ◽  
Personalized Recommendation ◽  
Three Dimensional Model ◽  
Recommendation Algorithm ◽  
Tripartite Graph ◽  
Recommendation Algorithms

With the rapid development of information technology, the information overload has become a very serious problem in web information environment. The personalized recommendation came into being. Current recommending algorithms, however, are facing a series of challenges. To solve the problem of the complex context, a new context recommendation algorithm based on the tripartite graph model is proposed for the three-dimensional model in complex systems. Improving the accuracy of the recommendation by the material diffusion, through the heat conduction to improve the diversity of the recommended objects, and balancing the accuracy and diversity through the integration of resources thus realize the personalized recommendation. The experimental results show that the proposed context recommendation algorithm based on the tripartite graph model is superior to other traditional recommendation algorithms in recommendation performance.

Sign in / Sign up

Export Citation Format

Share Document