skip to main content
10.1145/2184751.2184787acmconferencesArticle/Chapter ViewAbstractPublication PagesicuimcConference Proceedingsconference-collections
research-article

Efficient routing on finding recommenders for trust-aware recommender systems

Authors Info & Claims
Published:20 February 2012Publication History

ABSTRACT

The trust-aware recommender system (TARS) is a newly proposed trust-aware application. It is able to solve the data sparseness problem of the conventional recommender systems. One of the basic research challenges in TARS is to find the recommenders efficiently. Existing works of TARS use the strategy of random walk to find the recommenders, which is obviously low efficiency. Though the trust network has been verified to be the scale-free network, due to the small power of its degree distributions, we have verified via experiments that the prediction coverage of TARS is very limited by applying the classical routing protocol of scale-free networks directly. We therefore propose a routing protocol for TARS, which is able to efficiently find reliable recommenders for the users of TARS. Our protocol is able to achieve much higher prediction coverage than the classical routing protocol of scale-free networks, while the computational complexity is greatly reduced comparing with existing works of TARS.

References

  1. Yuan, W., Guan, D., Lee, Y. K., Lee, S., and Hur, S. J. Improved trust-aware recommender system using small-worldness of trust networks. Knowledge-Based Systems 23 (2010) 232--238. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Yuan, W., Guan, D., Lee, Y. K., and Lee, S. The Small-World Trust Network. Applied Intelligence (2010): 1--12, April 27, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Yuan, W., Guan, D., Lee, Y. K., and Lee, S. iTARS: Trust-Aware Recommender System using Implicit Trust Networks. IET Communications 14 (2010) 1709--1721.Google ScholarGoogle Scholar
  4. Pastor-satorras, R. and Vespignani, A.. Epidemic Spreading in Scale-Free Networks", Phys. Rev. Lett. 86, 3200--3203 (2001)Google ScholarGoogle ScholarCross RefCross Ref
  5. Massa, P., and Avesani, P.. Trust-aware Collaborative Filtering for Recommender Systems. Proc. Of Federated Int. Conf. on the Move to Meaningful Internet, 2004, pp. 492--508.Google ScholarGoogle ScholarCross RefCross Ref
  6. Massa, P., and Avesani, P.. Trust Metrics in Recommender Systems. Proc. of Computing With Social Trust, 2009, pp. 259--285.Google ScholarGoogle ScholarCross RefCross Ref
  7. Li, Y. and Kao, C.,. TREPPS: A Trust-based Recommender System for Peer Production Services. Expert Systems with Applications. 36 (2009) 3263--3277. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Walter, F., Battistion, S. and Schweitzer, F.. A model of a trust-based recommendation on a social network. Autonomous Agents and Multi-Agent System. 16 (2008) 57--74. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Massa, P., and Avesani, P.. Trust-aware recommender systems. Proc. Of the 2007 ACM Conference on Recommender Systems, 2007, pp. 121--126. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Watts, D. and Strogatz, S.. Collective dynamics of 'small-world' networks. Nature, 1998, 393, pp. 440--44Google ScholarGoogle Scholar

Index Terms

  1. Efficient routing on finding recommenders for trust-aware recommender systems

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Conferences
      ICUIMC '12: Proceedings of the 6th International Conference on Ubiquitous Information Management and Communication
      February 2012
      852 pages
      ISBN:9781450311724
      DOI:10.1145/2184751

      Copyright © 2012 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 20 February 2012

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article

      Acceptance Rates

      Overall Acceptance Rate251of941submissions,27%

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader