Collaborative filtering recommendation algorithm based on two stages of similarity learning and its optimization

2013 ◽  
Vol 46 (13) ◽  
pp. 335-340
Author(s):  
Jian Shen ◽  
Yan Wei ◽  
Yupu Yang
2011 ◽  
Vol 267 ◽  
pp. 789-793 ◽  
Author(s):  
Guang Hua Cheng

Electronic commerce recommender systems are becoming increasingly popular with the evolution of the Internet, and collaborative filtering is the most successful technology for building recommendation systems. Unfortunately, the efficiency of this method declines linearly with the number of users and items. So, as the magnitudes of users and items grow rapidly, the result in the difficulty of the speed bottleneck of collaborative filtering systems. In order to raise service efficiency of the personalized systems, a collaborative filtering recommendation method based on clustering of users is presented. Users are clustered based on users ratings on items, then the nearest neighbors of target user can be found in the user clusters most similar to the target user. Based on the algorithm, the collaborative filtering algorithm should be divided into two stages, and it separates the procedure of recommendation into offline and online phases. In the offline phase, the basic users are clustered into centers; while in the online phase, the nearest neighbors of an active user are found according to the basic users’ cluster centers, and the recommendation to the active user is produced.


2020 ◽  
Vol 14 ◽  
Author(s):  
Amreen Ahmad ◽  
Tanvir Ahmad ◽  
Ishita Tripathi

: The immense growth of information has led to the wide usage of recommender systems for retrieving relevant information. One of the widely used methods for recommendation is collaborative filtering. However, such methods suffer from two problems, scalability and sparsity. In the proposed research, the two issues of collaborative filtering are addressed and a cluster-based recommender system is proposed. For the identification of potential clusters from the underlying network, Shapley value concept is used, which divides users into different clusters. After that, the recommendation algorithm is performed in every respective cluster. The proposed system recommends an item to a specific user based on the ratings of the item’s different attributes. Thus, it reduces the running time of the overall algorithm, since it avoids the overhead of computation involved when the algorithm is executed over the entire dataset. Besides, the security of the recommender system is one of the major concerns nowadays. Attackers can come in the form of ordinary users and introduce bias in the system to force the system function that is advantageous for them. In this paper, we identify different attack models that could hamper the security of the proposed cluster-based recommender system. The efficiency of the proposed research is validated by conducting experiments on student dataset.


Sign in / Sign up

Export Citation Format

Share Document