Lightweight Collaborative Filtering Method for Binary-Encoded Data

  • Sholom M. Weiss
  • Nitin Indurkhya
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2168)


A lightweight method for collaborative filtering is described that processes binary encoded data. Examples of transactions that can be described in this manner are items purchased by customers or web pages visited by individuals. As with all collaborative filtering, the objective is to match a person’s records to customers with similar records. For example, based on prior purchases of a customer, one might recommend new items for purchase by examining stored records of other customers who made similar purchases. Because the data are binary (true-or-false) encoded, and not ranked preferences on a numerical scale, efficient and lightweight schemes are described for compactly storing data, computing similarities between new and stored records, and making recommendations tailored to an individual.


Bayesian Network Recommendation System Computer Support Cooperative Work Inverted List Similar Record 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    D. Goldberg, D. Nichols, B. Oki, and D. Terry. Using collaborative filtering to weave an information tapestry. CACM, 35(12):61–70, 1992.Google Scholar
  2. 2.
    T. Cover and P. Hart. Nearest neighbour pattern classification. IEEE Transactions on Information Theory, 13:21–27, 1967.zbMATHCrossRefGoogle Scholar
  3. 3.
    J. Breese, D. Heckerman, and C. Kadie. Empirical analysis of predictive algorithms for collaborative filtering. In Proceedings of the Fourteenth Conference on Uncertainty in AI, 1998.Google Scholar
  4. 4.
    D. Chickering, D. Heckerman, and C. Meek. A bayesian approach to learning bayesian networks with local structure. In Proceedings of the Thirteenth Conference on Uncertainty in AI, 1997.Google Scholar
  5. 5.
    P. Resnick, N. Iacovou, M. Suchak, P Bergstrom, and J. Riedl. Grouplens: An open architecture for collaborative filtering of netnews. In Proceedings of the ACM Conference on Computer Supported Cooperative Work, pages 175–186, 1994.Google Scholar
  6. 6.
    G. Salton and M. McGill. Introduction to Modern Information Retrieval. McGraw-Hill, New York, 1983.zbMATHGoogle Scholar
  7. 7.
    S. Weiss, H. White, and C. Apté. Lightweight document clustering. In Proceedings of PKDD-2000, pages 665–672. Springer, 2000.Google Scholar
  8. 8.
    S. Weiss, B. White, C. Apte, and F. Damerau. Lightweight document matching for help-desk applications. IEEE Intelligent Systems, pages 57–61, 2000.Google Scholar
  9. 9.
    D. Heckerman, D. Chickering, C. Meek, R. Rounthwaite, and C. Kadie. Dependency networks for inference, collaborative filtering and data visualization. Journal of Machine Learning Research, 1:49–75, 2000.CrossRefGoogle Scholar
  10. 10.
    G. Karypis. Evaluation of item-based top-n recommendation algorithms. Technical Report 046, Department of Computer Science, University of Minnesota, 2000.Google Scholar
  11. 11.
    M. Deshpande and G. Karypis. Selective markov models for predicting web-page accesses. In Proceedings of SIAM Data Mining Conference, 2001.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Sholom M. Weiss
    • 1
  • Nitin Indurkhya
    • 1
  1. 1.IBM T.J. Watson Research CenterYorktown HeightsUSA

Personalised recommendations