Resolving data sparsity and cold start problem in collaborative filtering recommender system using Linked Open Data

2020 ◽  
Vol 149 ◽  
pp. 113248 ◽  
Author(s):  
Senthilselvan Natarajan ◽  
Subramaniyaswamy Vairavasundaram ◽  
Sivaramakrishnan Natarajan ◽  
Amir H. Gandomi
Keyword(s):  
Collaborative Filtering ◽  
Recommender System ◽  
Open Data ◽  
Cold Start ◽  
Linked Open Data ◽  
Data Sparsity ◽  
Cold Start Problem

scholarly journals Semantic Distance Spreading Across Entities in Linked Open Data

Information ◽  
2019 ◽  
Vol 10 (1) ◽  
pp. 15
Author(s):  
Sultan Alfarhood ◽  
Susan Gauch ◽  
Kevin Labille
Keyword(s):  
Recommender Systems ◽  
Linked Data ◽  
Open Data ◽  
Cold Start ◽  
Semantic Distance ◽  
Linked Open Data ◽  
Experimental Results ◽  
Distance Calculation ◽  
Cold Start Problem

Recommender systems can utilize Linked Open Data (LOD) to overcome some challenges, such as the item cold start problem, as well as the problem of explaining the recommendation. There are several techniques in exploiting LOD in recommender systems; one approach, called Linked Data Semantic Distance (LDSD), considers nearby resources to be recommended by calculating a semantic distance between resources. The LDSD approach, however, has some drawbacks such as its inability to measure the semantic distance resources that are not directly linked to each other. In this paper, we first propose another variation of the LDSD approach, called wtLDSD, by extending indirect distance calculations to include the effect of multiple links of differing properties within LOD, while prioritizing link properties. Next, we introduce an approach that broadens the coverage of LDSD-based approaches beyond resources that are more than two links apart. Our experimental results show that approaches we propose improve the accuracy of the LOD-based recommendations over our baselines. Furthermore, the results show that the propagation of semantic distance calculation to reflect resources further away in the LOD graph extends the coverage of LOD-based recommender systems.

scholarly journals HERS: Modeling Influential Contexts with Heterogeneous Relations for Sparse and Cold-Start Recommendation

2019 ◽  
Vol 33 ◽  
pp. 3830-3837 ◽  
Author(s):  
Liang Hu ◽  
Songlei Jian ◽  
Longbing Cao ◽  
Zhiping Gu ◽  
Qingkui Chen ◽  
...  
Keyword(s):  
Recommender Systems ◽  
Recommender System ◽  
Real World ◽  
Cold Start ◽  
Data Sparsity ◽  
Real World Datasets ◽  
Item Item ◽  
Cold Start Problem

Classic recommender systems face challenges in addressing the data sparsity and cold-start problems with only modeling the user-item relation. An essential direction is to incorporate and understand the additional heterogeneous relations, e.g., user-user and item-item relations, since each user-item interaction is often influenced by other users and items, which form the user’s/item’s influential contexts. This induces important yet challenging issues, including modeling heterogeneous relations, interactions, and the strength of the influence from users/items in the influential contexts. To this end, we design Influential-Context Aggregation Units (ICAU) to aggregate the user-user/item-item relations within a given context as the influential context embeddings. Accordingly, we propose a Heterogeneous relations-Embedded Recommender System (HERS) based on ICAUs to model and interpret the underlying motivation of user-item interactions by considering user-user and item-item influences. The experiments on two real-world datasets show the highly improved recommendation quality made by HERS and its superiority in handling the cold-start problem. In addition, we demonstrate the interpretability of modeling influential contexts in explaining the recommendation results.

scholarly journals Dealing with Pure New User Cold-Start Problem in Recommendation System Based on Linked Open Data and Social Network Features

2020 ◽  
Vol 2020 ◽  
pp. 1-20
Author(s):  
Usha Yadav ◽  
Neelam Duhan ◽  
Komal Kumar Bhatia
Keyword(s):  
Social Network ◽  
Recommendation System ◽  
Research Work ◽  
Recommendation Systems ◽  
Open Data ◽  
Computation Time ◽  
Cold Start ◽  
Linked Open Data ◽  
Hybrid Recommendation ◽  
Cold Start Problem

Preferring accuracy over computation time or vice versa is very challenging in the context of recommendation systems, which encourages many researchers to opt for hybrid recommendation systems. Currently, researchers are trying hard to produce correct and accurate recommendations by suggesting the use of ontology, but the lack of techniques renders to take its full advantage. One of the major issues in recommender systems bothering many researchers is pure new user cold-start problem which arises due to the absence of information in the system about the new user. Linked Open Data (LOD) initiative sets standards for interoperability among cross domains and has gathered enormous amount of data over the past years, which provides various ways by which recommender system’s performance can be improved by enriching user’s profile with relevant features. This research work focuses on solving pure new user cold-start problem by building user’s profile based on LOD, collaborative features, and social network-based features. Here, a new approach is devised to compute item similarity based on ontology, thus predicting the rating of nonrated item. A modified method to calculate user’s similarity based on collaborative features to deal with other issues such as accuracy and computation time is also proposed. The empirical results and comparative analysis of the proposed hybrid recommendation system dictate its better performance specifically for providing solution to pure new user cold-start problem.

scholarly journals Addressing Complete New Item Cold-Start Recommendation: A Niche Item-Based Collaborative Filtering via Interrelationship Mining

2019 ◽  
Vol 9 (9) ◽  
pp. 1894 ◽  
Author(s):  
Zhi-Peng Zhang ◽  
Yasuo Kudo ◽  
Tetsuya Murai ◽  
Yong-Gong Ren
Keyword(s):  
Collaborative Filtering ◽  
Recommender System ◽  
Cold Start ◽  
Binary Relations ◽  
Excellent Performance ◽  
Satisfactory Accuracy ◽  
Available Information ◽  
Item Attributes ◽  
New Item ◽  
Cold Start Problem

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.

scholarly journals An Item–Item Collaborative Filtering Recommender System Using Trust and Genre to Address the Cold-Start Problem

2019 ◽  
Vol 3 (3) ◽  
pp. 39 ◽  
Author(s):  
Mahamudul Hasan ◽  
Falguni Roy
Keyword(s):  
Collaborative Filtering ◽  
Similarity Measure ◽  
Recommender System ◽  
Similarity Measures ◽  
Cold Start ◽  
Absolute Error ◽  
Prediction Algorithm ◽  
Rating Data ◽  
Asymmetric Correlation ◽  
Cold Start Problem

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.

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
Keyword(s):  
Social Networks ◽  
Information Retrieval ◽  
Social Network ◽  
Collaborative Filtering ◽  
Recommender System ◽  
Cold Start ◽  
Peer To Peer ◽  
Public Concerns ◽  
Cold Start Problem ◽  
Filtering Approach

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.

Modelling trust networks using resistive circuits for trust-aware recommender systems

2016 ◽  
Vol 43 (1) ◽  
pp. 135-144 ◽  
Author(s):  
Mehdi Hosseinzadeh Aghdam ◽  
Morteza Analoui ◽  
Peyman Kabiri
Keyword(s):  
Collaborative Filtering ◽  
Recommender Systems ◽  
Recommender System ◽  
Cold Start ◽  
User Preferences ◽  
Item Selection ◽  
Trust Networks ◽  
Trust Inference ◽  
Trust Information

Recommender systems have been widely used for predicting unknown ratings. Collaborative filtering as a recommendation technique uses known ratings for predicting user preferences in the item selection. However, current collaborative filtering methods cannot distinguish malicious users from unknown users. Also, they have serious drawbacks in generating ratings for cold-start users. Trust networks among recommender systems have been proved beneficial to improve the quality and number of predictions. This paper proposes an improved trust-aware recommender system that uses resistive circuits for trust inference. This method uses trust information to produce personalized recommendations. The result of evaluating the proposed method on Epinions dataset shows that this method can significantly improve the accuracy of recommender systems while not reducing the coverage of recommender systems.

Sign in / Sign up

Export Citation Format

Share Document