Skip to main content

Collaborative Filtering Using Electrical Resistance Network Models

  • Conference paper
Advances in Data Mining. Theoretical Aspects and Applications (ICDM 2007)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4597))

Included in the following conference series:

Abstract

In a recommender system where users rate items we predict the rating of items users have not rated. We define a rating graph containing users and items as vertices and ratings as weighted edges. We extend the work of [1] that uses the resistance distance on the bipartite rating graph incorporating negative edge weights into the calculation of the resistance distance. This algorithm is then compared to other rating prediction algorithms using data from two rating corpora.

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. Fouss, F., Pirotte, A., Saerens, M.: The application of new concepts of dissimilarities between nodes of a graph to collaborative filtering. ACM Trans. Math. Softw. (2003), Also TR-03-010 at www.cise.ufl.edu/tech-reports

  2. Billsus, D., Pazzani, M.J.: Learning collaborative information filters. In: Proc. 15th International Conf. on Machine Learning, pp. 46–54. Morgan Kaufmann, San Francisco (1998)

    Google Scholar 

  3. Breese, J.S., Heckerman, D., Kadie, C.: Empirical analysis of predictive algorithms for collaborative filtering. In: Proc. of the Fourteenth Annual Conference on Uncertainty in Artificial Intelligence, pp. 43–52 (1998)

    Google Scholar 

  4. Mirza, B.J., Keller, B.J., Ramakrishnan, N.: Evaluating recommendation algorithms by graph analysis. CoRR cs.IR/0104009 (2001)

    Google Scholar 

  5. Keller, B.J., mi Kim, S., Vemuri, N.S., Ramakrishnan, N., Perugini, S.: The good, bad and the indifferent: Explorations in recommender system health, San Diego, California (2005), http://www.grouplens.org/beyond2005/full/keller.pdf

  6. Klein, D.J.: Resistance-distance sum rules. Croatica Chemica Acta 75(2), 633–649 (2002)

    Google Scholar 

  7. Qin, Z., Cheng, C.K.: Linear network reduction via Y-Δ-Transformation. technical report 2002-0706, University of California, San Diego, United States (2002)

    Google Scholar 

  8. George, A., Liu, W.H.: The evolution of the minimum degree ordering algorithm. SIAM Rev. 31(1), 1–19 (1989)

    Article  MATH  Google Scholar 

  9. Heggernes, P., Eisenstat, S., Kumfert, G., Pothen, A.: The computational complexity of the minimum degree algorithm (2001)

    Google Scholar 

  10. Herlocker, J.L., Konstan, J.A., Terveen, L.G., Riedl, J.T.: Evaluating collaborative filtering recommender systems. ACM Trans. Inf. Syst. 22(1), 5–53 (2004)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Petra Perner

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kunegis, J., Schmidt, S. (2007). Collaborative Filtering Using Electrical Resistance Network Models. In: Perner, P. (eds) Advances in Data Mining. Theoretical Aspects and Applications. ICDM 2007. Lecture Notes in Computer Science(), vol 4597. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73435-2_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-73435-2_21

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-73434-5

  • Online ISBN: 978-3-540-73435-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics