skip to main content
article

Collaborative recommendation: A robustness analysis

Published:01 November 2004Publication History
Skip Abstract Section

Abstract

Collaborative recommendation has emerged as an effective technique for personalized information access. However, there has been relatively little theoretical analysis of the conditions under which the technique is effective. To explore this issue, we analyse the <i>robustness</i> of collaborative recommendation: the ability to make recommendations despite (possibly intentional) noisy product ratings. There are two aspects to robustness: recommendation <i>accuracy</i> and <i>stability</i>. We formalize recommendation accuracy in machine learning terms and develop theoretically justified models of accuracy. In addition, we present a framework to examine recommendation stability in the context of a widely-used collaborative filtering algorithm. For each case, we evaluate our analysis using several real-world data-sets. Our investigation is both practically relevant for enterprises wondering whether collaborative recommendation leaves their marketing operations open to attack, and theoretically interesting for the light it sheds on a comprehensive theory of collaborative recommendation.

References

  1. Albert, M. and Aha, D. 1991. Analyses of instance-based learning algorithms. In Proceedings of the 9th National Conference on Artificial Intelligence.]]Google ScholarGoogle Scholar
  2. Angluin, D. and Laird, P. 1988. Learning from noisy examples. Machine Learning 2, 4, 343--370.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Azar, Y., Fiat, A., Karlin, A., McSherry, F., and Saia, J. 2001. Spectral analysis of data. In Proceedings of the 32nd ACM Symposium on the Theory of Computing.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Breese, J., Heckerman, D., and Kadie, C. 1998. Empirical analysis of predictive algorithms for collaborative filtering. In Conference on the Uncertainty in Artificial Intelligence.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Drineas, P., Kerenidis, I., and Raghavan, P. 2002. Competetive recommender systems. In Proceedings of the 32nd ACM Symposium on the Theory of Computing.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Goldberg, D., Nichols, D., Oki, B., and Terry, D. 1992. Using collaborative filtering to weave an information tapestry. Comm. ACM 35, 12, 61--70.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Groot, P., van Harmelen, F., and ten Teije, A. 2000. Torture tests: a quantitative analysis for the robustness of knowledge-based systems. In European Workshop on Knowledge Acquisition, Modelling and Management (EKAW'00). LNAI Springer-Verlag.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Haussler, D. 1990. Probably approximately correct learning. In National Conference on Artificial Intelligence. 1101--1108.]]Google ScholarGoogle Scholar
  9. Herlocker, J., Konstan, J., Borchers, A., and Riedl, J. 1999. An algorithmic framework for performing collaborative filtering. In Proceedings of ACM SIGIR'99.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Hsu, C.-N. and Knoblock, C. A. 1995. Estimating the robustness of discovered knowledge. In Proceedings of the First International Conference on Knwledge Discovery and Data Mining. Montreal, Canada.]]Google ScholarGoogle Scholar
  11. Hsu, C.-N. and Knoblock, C. A. 1996. Discovering robust knowledge from dynamic closed-world data. In Proceedings of AAAI'96.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. http://movielens.umn.edu.]]Google ScholarGoogle Scholar
  13. http://www.changingworlds.com.]]Google ScholarGoogle Scholar
  14. IEEE. 1990. IEEE standard glossary of software engineering terminology. IEEE Standard 610.12-1990.]]Google ScholarGoogle Scholar
  15. Kearns, M. and Li, M. 1988. Learning in the presence of malicious errors. In Proceedings of the ACM Symposium on the Theory of Computing.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Kleinberg, J. 1998. Authoritative sources in a hyperlinked environment. In Proceedings of the ACM SIAM Symposium on Discrete Algorithms.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Kumar, R., Raghavan, P., Rajagopalan, S., and Tompkins, A. 1998. Recommender systems: A probabilistic analysis. In Proceedings of the 39th IEEE Symposium on the Foundations of Computer Science.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. Ng, A., Zheng, A., and Jordan, M. 2001. Link analysis, eigenvectors and stability. In Proceedings of the 17th International Joint Conference on Artificial Intelligence.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Pennock, D., Horvitz, E., and Giles, L. 2000. Socal choice theory and recommender systems: Analysis of the axiomatic foundations of collabortative filtering. In National Conference on Artificial Intelligence. 729--734.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. Resnick, P., Iacovou, N., Suchak, M., Bergstrom, P., and Riedl, J. 1994. An open architecture for collaborative filtering of netnews. In ACM Conference on Computer Supported Cooperative Work.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. Shardanand, U. and Maes, P. 1994. Social information filtering: Algorithms for automating "word of mouth". In Proceedings of the Conference on Human Factors in Computing Systems.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. Valiant, L. 1984. A theory of the learnable. Comm. ACM, 1134--1142.]] Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Collaborative recommendation: A robustness analysis

      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

      Full Access

      • Published in

        cover image ACM Transactions on Internet Technology
        ACM Transactions on Internet Technology  Volume 4, Issue 4
        November 2004
        108 pages
        ISSN:1533-5399
        EISSN:1557-6051
        DOI:10.1145/1031114
        Issue’s Table of Contents

        Copyright © 2004 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: 1 November 2004
        Published in toit Volume 4, Issue 4

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • article

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader