scholarly journals An Improved Collaborative Filtering Recommendation Algorithm Based on Retroactive Inhibition Theory

2021 ◽  
Vol 11 (2) ◽  
pp. 843
Author(s):  
Nihong Yang ◽  
Lei Chen ◽  
Yuyu Yuan

Collaborative filtering (CF) is the most classical and widely used recommendation algorithm, which is mainly used to predict user preferences by mining the user’s historical data. CF algorithms can be divided into two main categories: user-based CF and item-based CF, which recommend items based on rating information from similar user profiles (user-based) or recommend items based on the similarity between items (item-based). However, since user’s preferences are not static, it is vital to take into account the changing preferences of users when making recommendations to achieve more accurate recommendations. In recent years, there have been studies using memory as a factor to measure changes in preference and exploring the retention of preference based on the relationship between the forgetting mechanism and time. Nevertheless, according to the theory of memory inhibition, the main factors that cause forgetting are retroactive inhibition and proactive inhibition, not mere evolutions over time. Therefore, our work proposed a method that combines the theory of retroactive inhibition and the traditional item-based CF algorithm (namely, RICF) to accurately explore the evolution of user preferences. Meanwhile, embedding training is introduced to represent the features better and alleviate the problem of data sparsity, and then the item embeddings are clustered to represent the preference points to measure the preference inhibition between different items. Moreover, we conducted experiments on real-world datasets to demonstrate the practicability of the proposed RICF. The experiments show that the RICF algorithm performs better and is more interpretable than the traditional item-based collaborative filtering algorithm, as well as the state-of-art sequential models such as LSTM and GRU.

2013 ◽  
Vol 756-759 ◽  
pp. 3899-3903
Author(s):  
Ping Sun ◽  
Zheng Yu Li ◽  
Zi Yang Han ◽  
Feng Ying Wang

Recommendation algorithm is the most core and key point in recommender systems, and plays a decisive role in type and performance evaluation. At present collaborative filtering recommendation not only is the most widely useful and successful recommend technology, but also is a promotion for the study of the whole recommender systems. The research on the recommender systems is coming into a focus and critical problem at home and abroad. Firstly, the latest development and research in the collaborative filtering recommendation algorithm are introduced. Secondly, the primary idea and difficulties faced with the algorithm are explained in detail. Some classical solutions are used to deal with the problems such as data sparseness, cold start and augmentability. Thirdly, the particular evaluation method of the algorithm is put forward and the developments of collaborative filtering algorithm are prospected.


2021 ◽  
Vol 11 (20) ◽  
pp. 9554
Author(s):  
Jianjun Ni ◽  
Yu Cai ◽  
Guangyi Tang ◽  
Yingjuan Xie

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.


Author(s):  
Sharon Moses J. ◽  
Dhinesh Babu L.D.

Most recommender systems are based on the familiar collaborative filtering algorithm to suggest items. Quite often, collaborative filtering algorithm fails in generating recommendations due to the lack of adequate user information resulting in new user cold start problem. The cold start problem is one among the prevailing issue in recommendation system where the system fails to render recommendations. To overcome the new user cold start issue, demographical information of the user is utilised as the user information source. Among the demographical information, the impact of the user gender is less explored when compared with other information like age, profession, region, etc. In this work, a genetic algorithm-influenced gender-based top-n recommender algorithm is proposed to address the new user cold start problem. The algorithm utilises the evolution concepts of the genetic algorithm to render top-n recommendations to a new user. The evaluation of the proposed algorithm using real world datasets proved that the algorithm has a better efficiency than the state of art approaches.


2019 ◽  
Vol 6 (1) ◽  
pp. 147-156 ◽  
Author(s):  
Jianrui Chen ◽  
Chunxia Zhao ◽  
Uliji ◽  
Lifang Chen

Abstract In recent years, application of recommendation algorithm in real life such as Amazon, Taobao is getting universal, but it is not perfect yet. A few problems need to be solved such as sparse data and low recommended accuracy. Collaborative filtering is a mature algorithm in the recommended systems, but there are still some problems. In this paper, a novel collaborative filtering recommendation algorithm based on user correlation and evolutionary clustering is presented. Firstly, score matrix is pre-processed with normalization and dimension reduction, to obtain denser score data. Based on these processed data, clustering principle is generated and dynamic evolutionary clustering is implemented. Secondly, the search for the nearest neighbors with highest similar interest is considered. A measurement about the relationship between users is proposed, called user correlation, which applies the satisfaction of users and the potential information. In each user group, user correlation is applied to choose the nearest neighbors to predict ratings. The proposed method is evaluated using the Movielens dataset. Diversity experimental results demonstrate that the proposed method has outstanding performance in predicted accuracy and recommended precision.


Author(s):  
Gang Huang ◽  
Man Yuan ◽  
Chun-Sheng Li ◽  
Yong-he Wei

Firstly, this paper designs the process of personalized recommendation method based on knowledge graph, and constructs user interest model. Second, the traditional personalized recommendation algorithms are studied and their advantages and disadvantages are analyzed. Finally, this paper focuses on the combination of knowledge graph and collaborative filtering recommendation algorithm. They are effective to solve the problem where [Formula: see text] value is difficult to be determined in the clustering process of traditional collaborative filtering recommendation algorithm as well as data sparsity and cold start, utilizing the ample semantic relation in knowledge graph. If we use RDF data, which is distributed by the E and P (Exploration and Development) database based on the petroleum E and P, to verify the validity of the algorithm, the result shows that collaborative filtering algorithm based on knowledge graph can build the users’ potential intentions by knowledge graph. It is enlightening to query the information of users. In this way, it expands the mind of users to accomplish the goal of recommendation. In this paper, a collaborative filtering algorithm based on domain knowledge atlas is proposed. By using knowledge graph to effectively classify and describe domain knowledge, the problems are solved including clustering and the cold start in traditional collaborative filtering recommendation algorithm. The better recommendation effect has been achieved.


2018 ◽  
Vol 173 ◽  
pp. 03067
Author(s):  
Qing Yang ◽  
Peiling Yuan ◽  
Xi Zhu

This paper presents a personalized course recommended algorithm based on the hybrid recommendation. The recommendation algorithm uses the improved NewApriori algorithm to implements the association rule recommendation, and the user-based collaborative filtering algorithm is the main part of the algorithm. The hybrid algorithm adds the weight to the recommendation result of the user-based collaborative filtering and association rule recommendation, implementing a hybrid recommendation algorithm based on both of them. It has solved the problem of data sparsity and cold-start partially and provides a academic reference for the design of high performance elective system. The experiment uses the student scores data of a college as the test set and analyzes results and recommended quality of personalized elective course. According to the results of the experimental results, the quality of the improved hybrid recommendation algorithm is better.


2020 ◽  
Vol 31 (4) ◽  
pp. 24-45
Author(s):  
Mengmeng Shen ◽  
Jun Wang ◽  
Ou Liu ◽  
Haiying Wang

Tags generated in collaborative tagging systems (CTSs) may help users describe, categorize, search, discover, and navigate content, whereas the difficulty is how to go beyond the information explosion and obtain experts and the required information quickly and accurately. This paper proposes an expert detection and recommendation (EDAR) model based on semantics of tags; the framework consists of community detection and EDAR. Specifically, this paper firstly mines communities based on an improved agglomerative hierarchical clustering (I-AHC) to cluster tags and then presents a community expert detection (CED) algorithm for identifying community experts, and finally, an expert recommendation algorithm is proposed based the improved collaborative filtering (CF) algorithm to recommend relevant experts for the target user. Experiments are carried out on real world datasets, and the results from data experiments and user evaluations have shown that the proposed model can provide excellent performance compared to the benchmark method.


2013 ◽  
Vol 411-414 ◽  
pp. 2223-2228
Author(s):  
Dong Liang Su ◽  
Zhi Ming Cui ◽  
Jian Wu ◽  
Peng Peng Zhao

Nowadays personalized recommendation algorithm of e-commerce can hardly meet the needs of users as an ever-increasing number of users and items in personalized recommender system has brought about sparsity of user-item rating matrix and the emergence of more and more new users has threatened recommender system quality. This paper puts forward a pre-filled collaborative filtering recommendation algorithm based on matrix factorization, pre-filling user-item matrixes by matrix factorization and building nearest-neighbor models according to new user profile information, thus mitigating the influence of matrix sparsity and new users and improving the accuracy of recommender system. The experimental results suggest that this algorithm is more precise and effective than the traditional one under the condition of extremely sparse user-item rating matrix.


2012 ◽  
Vol 235 ◽  
pp. 399-402
Author(s):  
Zhang Bin ◽  
Wang Xiao Dong

As an open, free, flexible social platform, microblog develops rapidly recent years. State of art research on friends recommendation has attract both industrial and academical concerns. Compared with traditional social networks, microblog contains both strong social relations based on the real relationship, and weak social relations based on interests, locations and other incidental factors. How to utilize these relationships and characters in personalized friends recommendation is still under research. This paper presents a new hybrid recommendation model, considering both the relationship strength and interest similarity in microblog, using the social graph mining algorithm to find strong social relations and the item-based collaborative filtering algorithm to mine weak social relations. Experimental results show that the proposed hybrid algorithm outperforms the traditional algorithm.


Sign in / Sign up

Export Citation Format

Share Document