scholarly journals Preference-Adaptive Meta-Learning for Cold-Start Recommendation

Author(s):  
Li Wang ◽  
Binbin Jin ◽  
Zhenya Huang ◽  
Hongke Zhao ◽  
Defu Lian ◽  
...  

In recommender systems, the cold-start problem is a critical issue. To alleviate this problem, an emerging direction adopts meta-learning frameworks and achieves success. Most existing works aim to learn globally shared prior knowledge across all users so that it can be quickly adapted to a new user with sparse interactions. However, globally shared prior knowledge may be inadequate to discern users’ complicated behaviors and causes poor generalization. Therefore, we argue that prior knowledge should be locally shared by users with similar preferences who can be recognized by social relations. To this end, in this paper, we propose a Preference-Adaptive Meta-Learning approach (PAML) to improve existing meta-learning frameworks with better generalization capacity. Specifically, to address two challenges imposed by social relations, we first identify reliable implicit friends to strengthen a user’s social relations based on our defined palindrome paths. Then, a coarse-fine preference modeling method is proposed to leverage social relations and capture the preference. Afterwards, a novel preference-specific adapter is designed to adapt the globally shared prior knowledge to the preference-specific knowledge so that users who have similar tastes share similar knowledge. We conduct extensive experiments on two publicly available datasets. Experimental results validate the power of social relations and the effectiveness of PAML.

2014 ◽  
Vol 41 (4) ◽  
pp. 2065-2073 ◽  
Author(s):  
Blerina Lika ◽  
Kostas Kolomvatsos ◽  
Stathes Hadjiefthymiades

Information ◽  
2019 ◽  
Vol 10 (1) ◽  
pp. 15
Author(s):  
Sultan Alfarhood ◽  
Susan Gauch ◽  
Kevin Labille

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.


2020 ◽  
Vol 536 ◽  
pp. 156-170 ◽  
Author(s):  
J. Herce-Zelaya ◽  
C. Porcel ◽  
J. Bernabé-Moreno ◽  
A. Tejeda-Lorente ◽  
E. Herrera-Viedma

Sign in / Sign up

Export Citation Format

Share Document