Exploiting two-faceted web of trust for enhanced-quality recommendations

  • Authors:
  • Surong Yan;Xiaolin Zheng;Deren Chen;Yan Wang

  • Affiliations:
  • College of Computer Science, Zhejiang University, 310027 Hangzhou, China and College of Information, Zhejiang University of Finance and Economics, 310018 Hangzhou, China;College of Computer Science, Zhejiang University, 310027 Hangzhou, China and Stanford University, Stanford, CA 94305, USA;College of Computer Science, Zhejiang University, 310027 Hangzhou, China;Department of Computing, Macquarie University, Sydney, NSW 2109, Australia

  • Venue:
  • Expert Systems with Applications: An International Journal
  • Year:
  • 2013

Quantified Score

Hi-index 12.05

Visualization

Abstract

Traditional collaborative filtering (CF) based recommender systems on the basis of user similarity often suffer from low accuracy because of the difficulty in finding similar users. Incorporating trust network into CF-based recommender system is an attractive approach to resolve the neighbor selection problem. Most existing trust-based CF methods assume that underlying relationships (whether inferred or pre-existing) can be described and reasoned in a web of trust. However, in online sharing communities or e-commerce sites, a web of trust is not always available and is typically sparse. The limited and sparse web of trust strongly affects the quality of recommendation. In this paper, we propose a novel method that establishes and exploits a two-faceted web of trust on the basis of users' personal activities and relationship networks in online sharing communities or e-commerce sites, to provide enhanced-quality recommendations. The developed web of trust consists of interest similarity graphs and directed trust graphs and mitigates the sparsity of web of trust. Moreover, the proposed method captures the temporal nature of trust and interest by dynamically updating the two-faceted web of trust. Furthermore, this method adapts to the differences in user rating scales by using a modified Resnick's prediction formula. As enabled by the Pareto principle and graph theory, new users highly benefit from the aggregated global interest similarity (popularity) in interest similarity graph and the global trust (reputation) in the directed trust graph. The experiments on two datasets with different sparsity levels (i.e., Jester and MovieLens datasets) show that the proposed approach can significantly improve the predictive accuracy and decision-support accuracy of the trust-based CF recommender system.