Data Mining and Knowledge Discovery

, Volume 6, Issue 1, pp 83–105 | Cite as

Efficient Adaptive-Support Association Rule Mining for Recommender Systems

  • Weiyang Lin
  • Sergio A. Alvarez
  • Carolina Ruiz


Collaborative recommender systems allow personalization for e-commerce by exploiting similarities and dissimilarities among customers' preferences. We investigate the use of association rule mining as an underlying technology for collaborative recommender systems. Association rules have been used with success in other domains. However, most currently existing association rule mining algorithms were designed with market basket analysis in mind. Such algorithms are inefficient for collaborative recommendation because they mine many rules that are not relevant to a given user. Also, it is necessary to specify the minimum support of the mined rules in advance, often leading to either too many or too few rules; this negatively impacts the performance of the overall system. We describe a collaborative recommendation technique based on a new algorithm specifically designed to mine association rules for this purpose. Our algorithm does not require the minimum support to be specified in advance. Rather, a target range is given for the number of rules, and the algorithm adjusts the minimum support for each user in order to obtain a ruleset whose size is in the desired range. Rules are mined for a specific target user, reducing the time required for the mining process. We employ associations between users as well as associations between items in making recommendations. Experimental evaluation of a system based on our algorithm reveals performance that is significantly better than that of traditional correlation-based approaches.

data mining efficient association rule mining e-commerce recommender systems adaptive computation 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Agarwal, R.C., Aggarwal, C.C., and Prasad, V. 2000. Depth first generation of long patterns. In Proc. of the Sixth ACM SIGKDD Conference on Knowledge Discovery and Data Mining, Boston, MA, pp. 108–118.Google Scholar
  2. Agrawal, R., Imielinski, T., and Swami, A. 1993. Mining association rules between sets of items in large databases. In Proc. of the ACM SIGMOD Conference on Management of Data, Washington, D.C., pp. 207–216.Google Scholar
  3. Agrawal, R. and Srikant, R. 1994. Fast algorithms for mining association rules. In Proc. of the 20th VLDB Conference, Santiago, Chile, pp. 487–499.Google Scholar
  4. Balabanovic, M. and Shoham, Y. 1997. Fab: Content-based, collaborative recommendation. Communications of the ACM, 40(3):66–72.Google Scholar
  5. Billsus, D. and Pazzani, M.J. 1998. Learning collaborative information filters. In Proc. of the Fifteenth International Conference on Machine Learning, Madison, Wisconsin, Morgan Kaufmann Publishers.Google Scholar
  6. Breese, J., Heckerman, D., and Kadie, C. 1998. Empirical analysis of predictive algorithms for collaborative filtering. In Proceedings of the Fourteenth Conference on Uncertainty in Artificial Intelligence, Madison, WI.Google Scholar
  7. Brin, S., Motwani, R., Ullman, J.D., and Tsur, S. 1997. Dynamic itemset counting and implication rules for market basket data. In Proceedings of the ACM SIGMOD International Conference on Management of Data, New York, ACM Press, pp. 255–264.Google Scholar
  8. Chen, M.-S., Park, J.S., and Yu, P.S. 1998. Efficient data mining for path traversal patterns. IEEE Trans. on Knowledge and Data Engineering, 10(2):209–221.Google Scholar
  9. Cooley, R., Mobasher, B., and Srivastava, J. 1997a. Grouping web page references into transactions for mining world wide web browsing patterns. Technical Report TR 97-021, Department of Computer Science and Engineering, University of Minnesota, Minneapolis, MN 55455, USA.Google Scholar
  10. Cooley, R., Srivastava, J., and Mobasher, B. 1997b. Web mining: Information and pattern discovery on the world wide web. In Proceedings of the 9th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'97).Google Scholar
  11. Cooley, R., Tan, P.-N., and Srivastava, J. 1999. WebSIFT: The web site information filter system. In Proc. of the Workshop on Web Usage Analysis and User Pr ofiling (WebKDD99), Available at dd99/.Google Scholar
  12. Fu, X., Budzik, J., and Hammond, K.J. 2000. Mining navigation history for recommendation. In Proceedings of the 2000 International Conference on Intelligent User Interfaces, New Orleans, LA, pp. 106–112.Google Scholar
  13. Hájek, P., Havel, I., and Chytil, M. 1966. The GUHA method of automatic hypotheses determination. Computing, 1:293–308.Google Scholar
  14. Hájek, P. and Havranek, T. 1977. On generation of inductive hypotheses. Int. J. Man-Machine Studies, 9:415–438.Google Scholar
  15. Liu, B., Hsu, W., and Ma, Y. 1998. Integrating classification and association rule mining. In Proceedings of the Fourth International Conference on Knowledge Discovery and Data Mining, New York, pp. 80–86.Google Scholar
  16. McJones, P. 1997. EachMovie collaborative filtering data set. Compaq Systems Research Center.Google Scholar
  17. Resnick, P., Iacovou, N., Suchak, M., Bergstrom, P., and Riedl, J. 1994. GroupLens: An open architecture for collaborative filtering of netnews. In Proceedings of the Conference on Computer Supported Cooperative Work (CSCW94), pp. 175–186.Google Scholar
  18. Sarwar, B. 2001. Sparsity, scalability, and distribution in recommender systems. Ph.D. thesis, University of Minnesota.Google Scholar
  19. Shardanand, U. and Maes, P. 1995. Social information filtering: Algorithms for automating “Word of mouth”. In Proceedings of the Conference on Human Factors in Computing Systems (CHI95), pp. 210–217.Google Scholar
  20. Srikant, R. and Agrawal, R. 1996. Mining quantitative association rules in large relational tables. In Proc. of the 1996 ACM SIGMOD Conference on Management of Data, Montreal, Canada.Google Scholar
  21. Webb, G.I. 2000. Efficient search for association rules. In Proc. of the Sixth ACM SIGKDD Conference on Knowledge Discovery and Data Mining, Boston, MA, pp. 99–107.Google Scholar

Copyright information

© Kluwer Academic Publishers 2002

Authors and Affiliations

  • Weiyang Lin
    • 1
  • Sergio A. Alvarez
    • 2
  • Carolina Ruiz
    • 3
  1. 1.SVC-3/2955, Microsoft CorporationMountain ViewUSA
  2. 2.Department of Computer Science, Boston CollegeChestnut HillUSA
  3. 3.Department of Computer ScienceWorcester Polytechnic InstituteWorcesterUSA

Personalised recommendations