Skip to main content

Simple and Accurate Classification Method Based on Class Association Rules Performs Well on Well-Known Datasets

Part of the Lecture Notes in Computer Science book series (LNISA,volume 11943)


Existing classification rule learning algorithms use mainly greedy heuristic search to find regularities in datasets for classification. In recent years, extensive research on association rule mining was performed in the machine learning community on learning rules by using exhaustive search. The main objective is to find all rules in data that satisfy the user-specified minimum support and minimum confidence constraints. Although the whole set of rules may not be used directly for accurate classification, effective and efficient classifiers have been built using these, so called, classification association rules.

In this paper, we compare “classical” classification rule learning algorithms that use greedy heuristic search to produce the final classifier with a class association rule learner that uses constrained exhaustive search to find classification rules on “well known” datasets. We propose a simple method to extract class association rules by simple pruning to form an accurate classifier. This is a preliminary study that aims to show that an adequate choice of the “right” class association rules by considering the dependent (class) attribute distribution of values can produce a compact, understandable and relatively accurate classifier. We have performed experiments on 12 datasets from UCI Machine Learning Database Repository and compared the results with well-known rule-based and tree-based classification algorithms. Experimental results show that our method was consistent and comparative with other well-known classification algorithms. Although not achieving the best results in terms of classification accuracy, our method is relatively simple and produces compact and understandable classifiers by exhaustively searching the entire example space.


  • Attribute
  • Frequent itemset
  • Minimum support
  • Minimum confidence
  • Class association rules (CAR)
  • Associative classification

This is a preview of subscription content, access via your institution.

Buying options

USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and 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

Learn about institutional subscriptions


  1. Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: VLDB 1994 Proceedings of the 20th International Conference on Very Large Data Bases, Chile, pp. 487–499 (1994)

    Google Scholar 

  2. Ali, K., Manganaris, S., Srikant, R.: Partial classification using association rules. In: Proceedings of KDD-1997, U.S.A., pp. 115–118 (1997)

    Google Scholar 

  3. Baralis, E., Cagliero, L., Garza, P.: A novel pattern-based Bayesian classifier. IEEE Trans. Knowl. Data Eng. 25(12), 2780–2795 (2013)

    CrossRef  Google Scholar 

  4. Bayardo, R.J.: Brute-force mining of high-confidence classification rules. In: Proceedings of the Third International Conference on Knowledge Discovery and Data Mining, U.S.A., pp. 123–126 (1997)

    Google Scholar 

  5. Breiman, L.: Random Forests. Mach. Learn. 45(1), 5–32 (2001)

    CrossRef  Google Scholar 

  6. Cendrowska, J.: PRISM: an algorithm for inducing modular rules. Int. J. Man-Mach. Stud. 27(4), 349–370 (1987)

    CrossRef  Google Scholar 

  7. Chen, G., Liu, H., Yu, L., Wei, Q., Zhang, X.: A new approach to classification based on association rule mining. Decis. Support Syst. 42(2), 674–689 (2006)

    CrossRef  Google Scholar 

  8. Clark, P., Niblett, T.: The CN2 induction algorithm. Mach. Learn. 3(4), 261–283 (1989)

    Google Scholar 

  9. Cohen, W.W.: Fast effective rule induction. In: ICML 1995 Proceedings of the Twelfth International Conference on Machine Learning, Tahoe City, California, pp. 115–123 (1995)

    Google Scholar 

  10. Dua, D., Graff, C.: UCI Machine Learning Repository. University of California, Irvine (2019)

    Google Scholar 

  11. Frank, E., Witten, I.: Generating accurate rule sets without global optimization. In: Fifteenth International Conference on Machine Learning, USA, pp. 144–151 (1998)

    Google Scholar 

  12. Holte, R.: Very simple classification rules perform well on most commonly used datasets. Mach. Learn. 11(1), 63–91 (1993)

    CrossRef  Google Scholar 

  13. Kohavi, R.: The power of decision tables. In: 8th European Conference on Machine Learning, Heraclion, Crete, Greece, pp. 174–189 (1995)

    Google Scholar 

  14. Lent, B., Swami, A., Widom, J.: Clustering association rules. In: ICDE 1997 Proceedings of the Thirteenth International Conference on Data Engineering, England, pp. 220–231 (1997)

    Google Scholar 

  15. Li, W., Han, J., Pei, J.: CMAR: accurate and efficient classification based on multiple class-association rules. In: Proceedings of the 1st IEEE International Conference on Data Mining (ICDM 2001), San Jose, California, USA, pp. 369–376 (2001)

    Google Scholar 

  16. Liu, B., Hsu, W., Ma, Y.: Integrating classification and association rule mining. In: Proceedings of the 4th International Conference on Knowledge Discovery and Data Mining (KDD 1998), New York, USA, pp. 80–86 (1998)

    Google Scholar 

  17. Quinlan, J.: C4.5: Programs for machine learning. Mach. Learn. 16(3), 235–240 (1993)

    Google Scholar 

  18. Xiaoxin, Y., Jiawei, H. CPAR: classification based on predictive association rules. In: Proceedings of the SIAM International Conference on Data Mining, San Francisco, U.S.A., pp. 331–335 (2003)

    Google Scholar 

  19. Zhang, M., Zhou Z.: A k-nearest neighbor based algorithm for multi-label classification. In: Proceedings of the 1st IEEE International Conference on Granular Computing (GrC 2005), Beijing, China, vol. 2, pp. 718–721 (2005)

    Google Scholar 

  20. Zhou, Z., Liu, X.: Training cost-sensitive neural networks with methods addressing the class imbalance problem. IEEE Trans. Knowl. Data Eng. 18(1), 63–77 (2006)

    CrossRef  MathSciNet  Google Scholar 

Download references


The authors gratefully acknowledge the European Commission for funding the InnoRenew CoE project (Grant Agreement #739574) under the Horizon2020 Widespread-Teaming program and and the Republic of Slovenia (Investment funding of the Republic of Slovenia and the European Union of the European Regional Development Fund).

Author information

Authors and Affiliations


Corresponding author

Correspondence to Branko Kavšek .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Mattiev, J., Kavšek, B. (2019). Simple and Accurate Classification Method Based on Class Association Rules Performs Well on Well-Known Datasets. In: Nicosia, G., Pardalos, P., Umeton, R., Giuffrida, G., Sciacca, V. (eds) Machine Learning, Optimization, and Data Science. LOD 2019. Lecture Notes in Computer Science(), vol 11943. Springer, Cham.

Download citation

  • DOI:

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-37598-0

  • Online ISBN: 978-3-030-37599-7

  • eBook Packages: Computer ScienceComputer Science (R0)