Improving top-K recommendation with truster and trustee relationship in user trust network
Introduction
Due to the ever increasing amount of information available to users on the Web, recommender systems have recently gained their popularity in industrial companies such as Amazon1, Netflix2, Facebook3, to name a few. Indeed, it has been reported that Amazon are generating about 35% of their revenue through personalized recommendations provided by their own recommendation algorithms [21]. Moreover, recommender systems are widely used to help academic researchers in their decision making process when searching for relevant scientific articles [37], [38], [41]. Hence, improving the quality of recommender systems has been an attractive research problem for academic researchers.
In the beginning, a significant amount of research was devoted to accurately predicting the overall ratings to reduce the rating prediction error, e.g., RMSE, MAE [2], [13]. Given a user-item rating matrix, their main goal was to provide the correct rating that a user will give to an item. However, rather than better predicted ratings, users are more interested in seeing a list of top-k items that aligns with their preferences. Moreover, it is well known that minimizing the rating prediction error does not always result in better top-k list of items [6], [46]. Consequently, the Learning-To-Rank (LTR) [16] method, a supervised machine learning method that directly builds a ranking list from training data without an intermediate step of the rating prediction, has gained popularity to provide accurate results at top-k.
Despite the success of recommendation approaches, recommender systems suffer from an inherent limitation called the data sparsity problem, that is, the recommendation is hardly accurate due to lack of observations (i.e., ratings) because users typically rate a small number of items. To tackle the data sparsity problem, researchers have tried to incorporate auxiliary information such as social network relationship among users [7], [8], [9], [17], [19], text reviews on items [15], [23], [41], time related information [1], [14], [43] and items’ quality information [28], [37], [38]. Specifically, this paper focuses on incorporating the social network information of users in the top-k recommendation.
Recently, two top-k recommendation methods have been developed to incorporate the social network information based on the LTR approach. Specifically, Yao et al. [48] linearly combine a user's taste and her direct friends' tastes in optimizing the top-k recommendation. However, they do not utilize other important information hidden in the social network such as the structural information or truster-trustee relationship [45]. Zhao et al. [49] optimize the top-k recommendation from relative ordering that can be extracted from purchase history or browsing history, but they cannot handle numerical ratings directly. Note that numerical ratings usually contain much richer information on users preference than relative ordering.
This paper proposes a novel LTR-based top-k recommendation method, TRecSo, which leverages the social network information to optimize top-k recommendation. TRecSo is distinguished from previous methods in that it models two different roles of users as trusters and trustees while considering the structural information of the network. Precisely, we map users into two types of low dimensional spaces according to their roles, that is, truster space and trustee space under the following assumptions:
- •
When “user A” is given several choices of items, he turns to people he trusts to ask them their opinions about the items.
- •
Consequently, the behavior of “user A” will influence the people that trust “user A”.
We summarize our contributions as follows:
- •
We develop a novel Learning-To-Rank (LTR) based top-k recommendation method that takes into account the social network information among users to alleviate the data sparsity problem.
- •
We map users into two types of low dimensional spaces according to their roles while considering the structural information of the trust network.
- •
Our experimental results on three real-world datasets indicate that our method considerably outperforms previous methods in top-k recommendation.
The remainder of this paper is organized as follows. Section 2 describes the related work; The problem is formally discussed in Section 3; In Section 4, we describe our proposed method, TRecSo, and demonstrate the learning algorithm; In Section 5, we describe the complexity of our proposed method followed by experimental results in Section 6. Finally in Section 7, we conclude the paper.
Section snippets
Related work
Triggered by the Netflix prize [2] that ended in 2009, the field of recommender system has seen rapid progress since then. In this section, we review the existing methods including traditional collaborative filtering methods, social network based recommender systems, top-k ranking oriented recommender systems and top-k ranking oriented social recommender systems, the most related work to ours.
Problem description
We first introduce the notations that we use throughout the paper. Let be the set of users and be the set of items, where N and M are number of users and items, respectively. The ratings given by users in on items in are represented by a rating matrix where rij denotes the rating of ui on vj. Depending on applications, rij can be either a real number or a binary value. When users explicitly express their opinions on items, the rating value is a real
Method
In Section 4.1, we briefly explain the concept of Plackett-Luce model that is required for understanding our proposed model, TRecSo. Then, we explain how the rating and the trust relationship are modeled in Sections 4.2 and 4.3, respectively, and propose a unified model that combines the rating and the trust in Section 4.4, where we show how the unified model is learned.
Complexity analysis
The computational time of learning the proposed model TRecSo is dominated by the computation of the loss function in Eq. (10) and its gradients with respect to feature vectors given in Eqs. (11)–(19). Let and be the number of observed ratings and trust relations, respectively. Then, the complexity of evaluating is where K is the size of latent dimensionality, and . Note that a and b are the average ratings an item has received and the average
Experiments
In this section, we carry out experiments to compare the quality of the top-k recommendation of our method, TRecSo, with several state-of-the-art methods on three real-world datasets. Our experiments are designed to verify the following questions:
- 1.
How does TRecSo perform compared with other related competitors?
- 2.
Does considering the social network structure as in Eq. (8) enhance the performance of TRecSo?
- 3.
How does the trade-off parameters of TRecSo affect the quality of the top-k recommendation?
- 4.
Conclusion and future work
This paper proposes TRecSo, a novel LTR based recommendation method that optimizes the top-k ranking prediction accuracy by additionally considering the social network information. Specifically, TRecSo integrates the social network information into the Learning-To-Rank (LTR) based objective function for recommendation. Thanks to the flexibility (can be generalized to symmetric social relationship) and the low complexity (compared with pair-wise LTR approaches) of our model, our proposed method
Acknowledgment
This work was supported by the Industrial Core Technology Development Program (10049079 , Development of Mining core technology exploiting personal big data) funded by the Ministry of Trade, Industry and Energy (MOTIE, Korea), ICT R&D program of MSIP/IITP [14-824-09-014, Basic Software Research in Human-level Lifelong Machine Learning (Machine Learning Center)]
References (51)
- et al.
Dealing with incomplete information in a fuzzy linguistic recommender system to disseminate information in university digital libraries
Knowl. Based Syst.
(2010) - et al.
Integrating quality criteria in a fuzzy linguistic recommender system for digital libraries
Proc. Comput. Sci.
(2014) - et al.
A quality based recommender system to disseminate information in a university digital library
Inf. Sci.
(2014) - et al.
Context-aware recommender systems
Recommender Systems Handbook
(2011) - et al.
The netflix prize
Proceedings of KDD Cup and Workshop
(2007) - et al.
Empirical analysis of predictive algorithms for collaborative filtering
Proceedings of the Fourteenth Conference on Uncertainty in Artificial Intelligence
(1998) - et al.
Transfer learning for collective link prediction in multiple heterogenous domains
Proceedings of the 27th International Conference on Machine Learning (ICML-10)
(2010) - et al.
Learning to rank: from pairwise approach to listwise approach
Proceedings of the 24th International Conference on Machine Learning
(2007) - et al.
Performance of recommender algorithms on top-n recommendation tasks
Proceedings of the Fourth ACM Conference on Recommender Systems
(2010) - et al.
A novel bayesian similarity measure for recommender systems
IJCAI
(2013)
Etaf: an extended trust antecedents framework for trust prediction
ASONAM
Trustsvd: collaborative filtering with both the explicit and implicit influence of user trust and of item ratings.
AAAI
Latent semantic models for collaborative filtering
ACM Trans. Inf. Syst.
Trustwalker: a random walk model for combining trust-based and item-based recommendation
Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining
A matrix factorization technique with trust propagation for recommendation in social networks
Proceedings of the Fourth ACM Conference on Recommender Systems
Factorization meets the neighborhood: a multifaceted collaborative filtering model
Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining
Collaborative filtering with temporal dynamics
Commun. ACM
Ratings meet reviews, a combined approach to recommend
Proceedings of the 8th ACM Conference on Recommender Systems
Learning to rank for information retrieval
Found. Trends Inf. Retr.
Sorec: social recommendation using probabilistic matrix factorization
Proceedings of the 17th ACM Conference on Information and Knowledge Management
Learning to recommend with social trust ensemble
Proceedings of the 32nd International ACM SIGIR Conference on Research and Development in Information Retrieval
Recommender systems with social regularization
Proceedings of the Fourth ACM International Conference on Web Search and Data Mining
Analyzing and Modeling Rank Data
Trust-aware recommender systems
Proceedings of the 2007 ACM Conference on Recommender Systems
Cited by (49)
A generic Bayesian-based framework for enhancing top-N recommender algorithms
2021, Information SciencesContent-Aware Listwise Collaborative Filtering
2021, NeurocomputingData set quality in Machine Learning: Consistency measure based on Group Decision Making
2021, Applied Soft ComputingCitation Excerpt :This study focuses on the evaluation of training data consistency for ranking problems that are mainly solved using Learning to Rank algorithms (LTR) [1]. Among others, Learning to Rank algorithms are successfully applied to domains such as recommender systems [2–4], and Information Retrieval [5–7]. These algorithms rely on the assumption that similar labelers are agreed, not only about the highest-ranked alternative but on a ranked list of possible options.
BSPR: Basket-sensitive personalized ranking for product recommendation
2020, Information Sciences