Skip to main content

Distinguishing Social Ties in Recommender Systems by Graph-Based Algorithms

  • Conference paper
Web Information Systems Engineering – WISE 2013 (WISE 2013)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 8180))

Included in the following conference series:

Abstract

Incorporating the social network information into recommender systems has been demonstrated as an effective approach in improving the recommendation performance. When predicting ratings for an active user, his/her taste is influenced by the ones of his/her friends. Intuitively, different friends have different influential power to the active user. Most existing social recommendation algorithms, however, fail to consider such differences, and unfairly treat them equally. The problem is that the friends with less influential power might mislead the rating predictions, and finally impair the recommendation performance. Some previous work has tried to differentiate the influential power by local similarity calculations, but it has not provided a systematic solution and it has ignored the propagation of the influence among the social network. To solve the above limitations, in this paper, we investigate the issue of distinguishing different users’ influence power in recommendation systematically. We propose to employ three graph-based algorithms (including PageRank, HITS, and heat diffusion) to distinguish and propagate the influence among the friends of an active user, and then integrate them into the factorization-based social recommendation framework. Through experimental verification in the Epinions dataset, we demonstrate that the proposed approaches consistently outperform previous social recommendation algorithms significantly.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Brin, S., Page, L.: The Anatomy of a Large-Scale Hypertextual Web Search Engine. Computer Networks and ISDN Systems J. 30, 107–117 (1998)

    Article  Google Scholar 

  2. Canny, J.: Collaborative Filtering with Privacy via Factor Analysis. In: Proceedings of SIGIR 2002, pp. 238–245. ACM Press, New York (2002)

    Google Scholar 

  3. Chakrabarti, S., Dom, B., Gibson, D., Kleinberg, J., Raghavan, P., Rajagopalan, S.: Automatic Resource Compilation by Analyzing Hyperlink Structure and Associated Text. Computer Networks and ISDN Systems 30(1), 65–74 (1998)

    Article  Google Scholar 

  4. Kleinberg, J.: Authoritative sources in a hyperlinked environment. In: 9th ACM-SIAM Symposium on Discrete Algorithms, pp. 604–632. ACM Press, New York (2008)

    Google Scholar 

  5. Linden, G., Smith, B., York, J.: Amazon.com Recommendations: Item-to-item Collaborative Filtering. IEEE Internet Computing J. 7(1), 76–80 (2003)

    Article  Google Scholar 

  6. Ma, H., King, I., Lyu, M.R.: Effective Missing Data Prediction for Collaborative Filtering. In: Proceedings of SIGIR 2007, pp. 39–46. ACM Press, New York (2007)

    Google Scholar 

  7. Ma, H., Yang, H.X., Lyu, M.R., King, I.: Mining Social Networks Using Heat Diffusion Processes for Marketing Candidates Selection. In: Proceedings of CIKM 2008, pp. 233–242. ACM Press, Napa Valley (2008)

    Google Scholar 

  8. Ma, H., Yang, H., Lyu, M.R., King, I.: SoRec: Social Recommendation Using Probabilistic Matrix Factorization. In: Proceedings of CIKM 2008, pp. 931–940. ACM Press, New York (2008)

    Google Scholar 

  9. Ma, H., King, I., Lyu, M.R.: Learning to Recommend with Social Trust Ensemble. In: Proceedings of SIGIR 2009, pp. 203–210. ACM Press, Boston (2009)

    Google Scholar 

  10. Ma, H., Zhou, D.Y., Liu, C.: Recommender System with Social Regularization. In: Proceedings of WSDM 2011, pp. 287–296. ACM Press, Hong Kong (2011)

    Google Scholar 

  11. Xin, X., King, I., Deng, H., Lyu, M.R.: A social recommendation framework based on multi-scale continuous conditional random fields. In: Proceedings of CIKM 2009, pp. 1247–1256. ACM Press, Hong Kong (2009)

    Google Scholar 

  12. Xing, W., Ghorbani, A.: Weighted Pagerank Algorithm. In: 2nd Annual Conference on Communication Networks and Services Research, pp. 305–314. IEEE Press, Fredericton (2004)

    Google Scholar 

  13. Yang, H., King, I., Lyu, M.R.: Diffusionrank: a possible penicillin for web spamming. In: Proceedings of SIGIR 2007, pp. 431–438. ACM Press, Amsterdam (2007)

    Google Scholar 

  14. Zhang, Y., Koren, J.: Efficient Bayesian Hierarchial User Modeling for Recommendation System. In: Proceedings of SIGIR 2002, pp. 47–54. ACM Press, New York (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wei, X., Huang, H., Xin, X., Yang, X. (2013). Distinguishing Social Ties in Recommender Systems by Graph-Based Algorithms. In: Lin, X., Manolopoulos, Y., Srivastava, D., Huang, G. (eds) Web Information Systems Engineering – WISE 2013. WISE 2013. Lecture Notes in Computer Science, vol 8180. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41230-1_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-41230-1_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-41229-5

  • Online ISBN: 978-3-642-41230-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics