P2PCF: A collaborative filtering based recommender system for peer to peer social networks

2021 ◽  
pp. 1-19
Author(s):  
Lyes Badis ◽  
Mourad Amad ◽  
Djamil Aïssani ◽  
Sofiane Abbar

The recent privacy incidents reported in major media about global social networks raised real public concerns about centralized architectures. P2P social networks constitute an interesting paradigm to give back users control over their data and relations. While basic social network functionalities such as commenting, following, sharing, and publishing content are widely available, more advanced features related to information retrieval and recommendation are still challenging. This is due to the absence of a central server that has a complete view of the network. In this paper, we propose a new recommender system called P2PCF. We use collaborative filtering approach to recommend content in P2P social networks. P2PCF enables privacy preserving and tackles the cold start problem for both users and content. Our proposed approach assumes that the rating matrix is distributed within peers, in such a way that each peer only sees interactions made by her friends on her timeline. Recommendations are then computed locally within each peer before they are sent back to the requester. Our evaluations prove the effectiveness of our proposal compared to a centralized scheme in terms of recall and coverage.

2018 ◽  
Vol 44 (6) ◽  
pp. 802-817 ◽  
Author(s):  
Carlos Rios ◽  
Silvia Schiaffino ◽  
Daniela Godoy

Location-based recommender systems (LBRSs) are gaining importance with the proliferation of location-based services provided by mobile devices as well as user-generated content in social networks. Collaborative approaches for recommendation rely on the opinions of like-minded people, so-called neighbours, for prediction. Thus, an adequate selection of such neighbours becomes essential for achieving good prediction results. The aim of this work is to explore different strategies to select neighbours in the context of a collaborative filtering–based recommender system for POI (places of interest) recommendations. Whereas standard methods are based on user similarity to delimit a neighbourhood, in this work several strategies are proposed based on direct social relationships and geographical information extracted from location-based social networks (LBSNs). The impact of the different strategies proposed has been evaluated and compared against the traditional collaborative filtering approach using a dataset from a popular network as Foursquare. In general terms, the proposed strategies for selecting neighbours based on the different elements available in a LBSN achieve better results than the traditional collaborative filtering approach. Our findings can be helpful both to researchers in the recommender systems area and to recommender system developers in the context of LBSNs, since they can take into account our results to design and provide more effective services considering the huge amount of knowledge produced in LBSNs.


2012 ◽  
Vol 26 ◽  
pp. 225-238 ◽  
Author(s):  
Jesús Bobadilla ◽  
Fernando Ortega ◽  
Antonio Hernando ◽  
Jesús Bernal

2020 ◽  
Vol 149 ◽  
pp. 113248 ◽  
Author(s):  
Senthilselvan Natarajan ◽  
Subramaniyaswamy Vairavasundaram ◽  
Sivaramakrishnan Natarajan ◽  
Amir H. Gandomi

2019 ◽  
Vol 9 (9) ◽  
pp. 1894 ◽  
Author(s):  
Zhi-Peng Zhang ◽  
Yasuo Kudo ◽  
Tetsuya Murai ◽  
Yong-Gong Ren

Recommender system (RS) can be used to provide personalized recommendations based on the different tastes of users. Item-based collaborative filtering (IBCF) has been successfully applied to modern RSs because of its excellent performance, but it is susceptible to the new item cold-start problem, especially when a new item has no rating records (complete new item cold-start). Motivated by this, we propose a niche approach which applies interrelationship mining into IBCF in this paper. The proposed approach utilizes interrelationship mining to extract new binary relations between each pair of item attributes, and constructs interrelated attributes to rich the available information on a new item. Further, similarity, computed using interrelated attributes, can reflect characteristics between new items and others more accurately. Some significant properties, as well as the usage of interrelated attributes, are provided in detail. Experimental results obtained suggest that the proposed approach can effectively solve the complete new item cold-start problem of IBCF and can be used to provide new item recommendations with satisfactory accuracy and diversity in modern RSs.


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.


Author(s):  
Archana Kalidindi ◽  
◽  
Prasanthi Yavanamandha ◽  
Anusha Kunuku ◽  
◽  
...  

Sign in / Sign up

Export Citation Format

Share Document