Adaptive implicit friends identification over heterogeneous network for social recommendation
Proceedings of the 27th ACM international conference on information and …, 2018•dl.acm.org
The explicitly observed social relations from online social platforms have been widely
incorporated into recommender systems to mitigate the data sparsity issue. However, the
direct usage of explicit social relations may lead to an inferior performance due to the
unreliability (eg, noises) of observed links. To this end, the discovery of reliable relations
among users plays a central role in advancing social recommendation. In this paper, we
propose a novel approach to adaptively identify implicit friends toward discovering more …
incorporated into recommender systems to mitigate the data sparsity issue. However, the
direct usage of explicit social relations may lead to an inferior performance due to the
unreliability (eg, noises) of observed links. To this end, the discovery of reliable relations
among users plays a central role in advancing social recommendation. In this paper, we
propose a novel approach to adaptively identify implicit friends toward discovering more …
The explicitly observed social relations from online social platforms have been widely incorporated into recommender systems to mitigate the data sparsity issue. However, the direct usage of explicit social relations may lead to an inferior performance due to the unreliability (e.g., noises) of observed links. To this end, the discovery of reliable relations among users plays a central role in advancing social recommendation. In this paper, we propose a novel approach to adaptively identify implicit friends toward discovering more credible user relations. Particularly, implicit friends are those who share similar tastes but could be distant from each other on the network topology of social relations. Methodologically, to find the implicit friends for each user, we first model the whole system as a heterogeneous information network, and then capture the similarity of users through the meta-path based embedding representation learning. Finally, based on the intuition that social relations have varying degrees of impact on different users, our approach adaptively incorporates different numbers of similar users as implicit friends for each user to alleviate the adverse impact of unreliable social relations for a more effective recommendation. Experimental analysis on three real-world datasets demonstrates the superiority of our method and explain why implicit friends are helpful in improving social recommendation.

Showing the best result for this search. See all results