Mining Optimal Class Association Rule Set

  • Jiuyong Li
  • Hong Shen
  • Rodney Topor
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2035)


We define an optimal class association rule set to be the minimum rule set with the same prediction power of the complete class association rule set. Using this rule set instead of the complete class association rule set we can avoid redundant computation that would otherwise be required for mining predictive association rules and hence improve the efficiency of the mining process significantly. We present an efficient algorithm for mining the optimal class association rule set using an upward closure property of pruning weak rules before they are actually generated. We have implemented the algorithm and our experimental results show that our algorithm generates the optimal class association rule set, whose size is smaller than 1/17 of the complete class association rule set on average, in significantly less time than generating the complete class association rule set. Our proposed criterion has been shown very effective for pruning weak rules in dense databases.


Association Rule Minimum Support Association Rule Mining Prediction Power Strong Rule 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    R. Agrawal, T. Imielinski, and A. Swami. Mining associations between sets of items in massive databases. In Proc. of the ACM SIGMOD Int’l Conference on Management of Data, 1993.Google Scholar
  2. 2.
    R. Agrawal, H. Mannila, R. Srikant, H. Toivonen, and A.I. Verkamo. Fast discovery of association rules. In Fayyad U. and et al, editors, Advances in Knowledge Discovery and Data Mining. MIT Press, 1996.Google Scholar
  3. 3.
    Kamal Ali, Stefanos Manganaris, and Ramakrishnan Srikant. Partial classification using association rules. In David Heckerman, Heikki Mannila, Daryl Pregibon, and Ramasamy Uthurusamy, editors, Proceedings of the Third International Conference on Knowledge Discovery and Data Mining (KDD-97), page 115. AAAI Press, 1997.Google Scholar
  4. 4.
    Roberto Bayardo and Rakesh Agrawal. Mining the most interesting rules. In Surajit Chaudhuri and David Madigan, editors, Proceedings of the Fifth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 145–154, N.Y., August 1518 1999. ACM Press.Google Scholar
  5. 5.
    Roberto Bayardo, Rakesh Agrawal, and Dimitrios Gunopulos. Constraint-based rule mining in large, dense database. In Proc. of the 15th Int’l Conf. on Data Engineering, pages 188–197, 1999.Google Scholar
  6. 6.
    E. Keogh C. Blake and C.J. Merz. UCI repository of machine learning databases,, 1998.
  7. 7.
    Sergey Brin, Rajeev Motwani, and Craig Silverstein. Beyond market baskets: Generalizing association rules to correlations. SIGMOD Record (ACM Special Interest Group on Management of Data), 26(2):265.Google Scholar
  8. 8.
    P. Clark and R. Boswell. Rule induction with CN2: Some recent improvements. In Y. Kodratoff, editor, Machine Learning-EWSL-91, 1991.Google Scholar
  9. 9.
    H. Toivonene M. Klemettinen P RonKainen K Hatonen and H Mannila. Pruning and grouping discovered association rules. Technical report, Department of Computer Science, University of Helsinki, Finland ( Project/PMDM/), 1998.
  10. 10.
    M. Houtsma and A. Swami. Set-oriented mining of association rules in relational databases. In 11th Intl. Conf. data Engineering, 1995.Google Scholar
  11. 11.
    Ron Kohavi, Dan Sommerfield, and James Dougherty. Data mining using MLC++: A machine learning library in C++. In Tools with Artificial Intelligence, pages 234–245. IEEE Computer Society Press, 1996. Received the best paper award.Google Scholar
  12. 12.
    Bing Liu, Wynne Hsu, and Yiming Ma. Integrating classification and association rule mining. In SIGKDD 98, pages 80–86, 1998.Google Scholar
  13. 13.
    Bing Liu, Wynne Hsu, and Yiming Ma. Pruning and summarizing the discovered associations. In SIGKDD 99, 1999.Google Scholar
  14. 14.
    H. Mannila, H. Toivonen, and I. Verkamo. Efficient algorithms for discovering association rules. InAAAI Wkshp. Knowledge Discovery in Databases, July 1994.Google Scholar
  15. 15.
    Tom M. Mitchell. Machine Learning. McGraw-Hill, 1997.Google Scholar
  16. 16.
    Raymond T. Ng, Laks V.S. Lakshmanan, Jiawei Han, and Alex Pang. Exploratory mining and pruning optimizations of constrained associations rules. In Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD-98), volume 27, 2 of ACM SIGMOD Record, pages 13–24, New York, June 1-4 1998. ACM Press.CrossRefGoogle Scholar
  17. 17.
    J.S. Park, M. Chen, and P.S. Yu. An effective hash based algorithm for mining association rules. In ACM SIGMOD Intl. Conf. Management of Data, May 1995.Google Scholar
  18. 18.
    J.R. Quinlan. C4.5: Programs for Machine Learning. MK, San Mateo, CA, 1993.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Jiuyong Li
    • 1
  • Hong Shen
    • 1
  • Rodney Topor
    • 1
  1. 1.School of Computing and Information TechnologyGriffith UniversityNathanAustralia

Personalised recommendations