A recommender system based on collaborative filtering, graph theory using HMM based similarity measures

Author(s):  
Anshul Gupta ◽  
Pravin Srinath
2019 ◽  
Vol 3 (3) ◽  
pp. 39 ◽  
Author(s):  
Mahamudul Hasan ◽  
Falguni Roy

Item-based collaborative filtering is one of the most popular techniques in the recommender system to retrieve useful items for the users by finding the correlation among the items. Traditional item-based collaborative filtering works well when there exists sufficient rating data but cannot calculate similarity for new items, known as a cold-start problem. Usually, for the lack of rating data, the identification of the similarity among the cold-start items is difficult. As a result, existing techniques fail to predict accurate recommendations for cold-start items which also affects the recommender system’s performance. In this paper, two item-based similarity measures have been designed to overcome this problem by incorporating items’ genre data. An item might be uniform to other items as they might belong to more than one common genre. Thus, one of the similarity measures is defined by determining the degree of direct asymmetric correlation between items by considering their association of common genres. However, the similarity is determined between a couple of items where one of the items could be cold-start and another could be any highly rated item. Thus, the proposed similarity measure is accounted for as asymmetric by taking consideration of the item’s rating data. Another similarity measure is defined as the relative interconnection between items based on transitive inference. In addition, an enhanced prediction algorithm has been proposed so that it can calculate a better prediction for the recommendation. The proposed approach has experimented with two popular datasets that is Movielens and MovieTweets. In addition, it is found that the proposed technique performs better in comparison with the traditional techniques in a collaborative filtering recommender system. The proposed approach improved prediction accuracy for Movielens and MovieTweets approximately in terms of 3.42% & 8.58% mean absolute error, 7.25% & 3.29% precision, 7.20% & 7.55% recall, 8.76% & 5.15% f-measure and 49.3% and 16.49% mean reciprocal rank, respectively.


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