Context-Aware Recommendation Using Role-Based Trust Network

Recommender systems have been studied comprehensively in both academic and industrial fields over the past decade. As user interests can be affected by context at any time and any place in mobile scenarios, rich context information becomes more and more important for personalized context-aware recommendations. Although existing context-aware recommender systems can make context-aware recommendations to some extent, they suffer several inherent weaknesses: (1) Users’ context-aware interests are not modeled realistically, which reduces the recommendation quality; (2) Current context-aware recommender systems ignore trust relations among users. Trust relations are actually context-aware and associated with certain aspects (i.e., categories of items) in mobile scenarios. In this article, we define a term role to model common context-aware interests among a group of users. We propose an efficient role mining algorithm to mine roles from a “user-context-behavior” matrix, and a role-based trust model to calculate context-aware trust value between two users. During online recommendation, given a user u in a context c, an efficient weighted set similarity query (WSSQ) algorithm is designed to build u’s role-based trust network in context c. Finally, we make recommendations to u based on u’s role-based trust network by considering both context-aware roles and trust relations. Extensive experiments demonstrate that our recommendation approach outperforms the state-of-the-art methods in both effectiveness and efficiency.

[1]  Hui Xiong,et al.  An Unsupervised Approach to Modeling Personalized Contexts of Mobile Users , 2010, ICDM.

[2]  Lars Schmidt-Thieme,et al.  Fast context-aware recommendations with factorization machines , 2011, SIGIR.

[3]  Divesh Srivastava,et al.  Weighted Set-Based String Similarity , 2010, IEEE Data Eng. Bull..

[4]  Steffen Rendle,et al.  Factorization Machines with libFM , 2012, TIST.

[5]  Qiang Yang,et al.  Transfer Learning in Collaborative Filtering for Sparsity Reduction , 2010, AAAI.

[6]  Jiawei Han,et al.  ACM Transactions on Knowledge Discovery from Data: Introduction , 2007 .

[7]  Wei Chu,et al.  A contextual-bandit approach to personalized news article recommendation , 2010, WWW '10.

[8]  Francesco Ricci,et al.  Context-Aware Recommender Systems , 2011, AI Mag..

[9]  Christos Faloutsos,et al.  Fast Random Walk with Restart and Its Applications , 2006, Sixth International Conference on Data Mining (ICDM'06).

[10]  Qiang Yang,et al.  Transfer learning for collaborative filtering via a rating-matrix generative model , 2009, ICML '09.

[11]  Cheng Zeng,et al.  Role-Based Contextual Recommendation , 2011, 2011 International Conference on Internet of Things and 4th International Conference on Cyber, Physical and Social Computing.

[12]  Divesh Srivastava,et al.  Incremental maintenance of length normalized indexes for approximate string matching , 2009, SIGMOD Conference.

[13]  Martin Ester,et al.  Using a trust network to improve top-N recommendation , 2009, RecSys '09.

[14]  Djamel A. Zighed,et al.  Roles in social networks: Methodologies and research issues , 2012, Web Intell. Agent Syst..

[15]  Paolo Avesani,et al.  Trust-aware recommender systems , 2007, RecSys '07.

[16]  Michael R. Lyu,et al.  Learning to recommend with social trust ensemble , 2009, SIGIR.

[17]  Divesh Srivastava,et al.  Fast Indexes and Algorithms for Set Similarity Selection Queries , 2008, 2008 IEEE 24th International Conference on Data Engineering.

[18]  Martin Ester,et al.  TrustWalker: a random walk model for combining trust-based and item-based recommendation , 2009, KDD.

[19]  Hui Xiong,et al.  An unsupervised approach to modeling personalized contexts of mobile users , 2010, 2010 IEEE International Conference on Data Mining.

[20]  Surajit Chaudhuri,et al.  A Primitive Operator for Similarity Joins in Data Cleaning , 2006, 22nd International Conference on Data Engineering (ICDE'06).

[21]  Michael R. Lyu,et al.  SoRec: social recommendation using probabilistic matrix factorization , 2008, CIKM '08.

[22]  Douglas B. Terry,et al.  Using collaborative filtering to weave an information tapestry , 1992, CACM.

[23]  M. McPherson,et al.  Birds of a Feather: Homophily in Social Networks , 2001 .

[24]  Sunita Sarawagi,et al.  Efficient set joins on similarity predicates , 2004, SIGMOD '04.

[25]  Jaideep Srivastava,et al.  Predicting trusts among users of online communities: an epinions case study , 2008, EC '08.

[26]  Jayant Madhavan,et al.  Socialising Data with Google Fusion Tables , 2010, IEEE Data Eng. Bull..

[27]  Jennifer Golbeck,et al.  Trust and nuanced profile similarity in online social networks , 2009, TWEB.

[28]  Daniel Kifer,et al.  Context-aware citation recommendation , 2010, WWW '10.

[29]  Thomas DuBois Improving Recommendation Accuracy by Clustering Social Networks with Trust , 2009 .

[30]  Bamshad Mobasher,et al.  Contextual Recommendation , 2007, WebMine.

[31]  Gediminas Adomavicius,et al.  Context-aware recommender systems , 2008, RecSys '08.

[32]  Chong Wang,et al.  MusicSense: contextual music recommendation using emotional allocation modeling , 2007, ACM Multimedia.

[33]  Mohammad Ali Abbasi,et al.  Trust-Aware Recommender Systems , 2014 .

[34]  Gediminas Adomavicius,et al.  Incorporating contextual information in recommender systems using a multidimensional approach , 2005, TOIS.

[35]  Ross Macmillan,et al.  Violence and the Life Course: The Consequences of Victimization for Personal and Social Development , 2001 .

[36]  Nuria Oliver,et al.  Multiverse recommendation: n-dimensional tensor factorization for context-aware collaborative filtering , 2010, RecSys '10.

[37]  Vijayalakshmi Atluri,et al.  The role mining problem: finding a minimal descriptive set of roles , 2007, SACMAT '07.