Skip to main content

On Pruning and Tuning Rules for Associative Classifiers

  • Conference paper
Knowledge-Based Intelligent Information and Engineering Systems (KES 2005)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3683))

Abstract

The integration of supervised classification and association rules for building classification models is not new. One major advantage is that models are human readable and can be edited. However, it is common knowledge that association rule mining typically yields a sheer number of rules defeating the purpose of a human readable model. Pruning unnecessary rules without jeopardizing the classification accuracy is paramount but very challenging. In this paper we study strategies for classification rule pruning in the case of associative classifiers.

Partially supported by Alberta Ingenuity Fund, iCORE and NSERC Canada

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proc. Intl. Conf. on Very Large Data Bases, pp. 487–499 (1994)

    Google Scholar 

  2. Antonie, M.-L., Zaïane, O.R.: Text document categorization by term association. In: Proc. of the IEEE International Conference on Data Mining (ICDM 2002), pp. 19–26 (2002)

    Google Scholar 

  3. Antonie, M.-L., Zaïane, O.R., Coman, A.: Associative classifiers for medical images. In: Zaïane, O.R., Simoff, S.J., Djeraba, C. (eds.) MDM/KDD 2002 and KDMCD 2002. LNCS (LNAI), vol. 2797, pp. 68–83. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  4. Bayardo, R.: Brute-force mining of high-confidence classification rules. In: 3rd Intl. Conf. on Knowledge Discovery and Data Mining (KDD 1997), pp. 123–126 (1997)

    Google Scholar 

  5. Coenen, F., Leng, P.: An evaluation of approaches to classification rule selection. In: IEEE International Conference on Data Mining (ICDM 2004), pp. 359–362 (2004)

    Google Scholar 

  6. Li, W., Han, J., Pei, J.: CMAR: Accurate and efficient classification based on multiple class-association rules. In: IEEE International Conference on Data Mining (ICDM 2001), pp. 369–376 (2001)

    Google Scholar 

  7. Liu, B., Hsu, H., Ma, Y.: Integrating classification and association rule mining. In: 4th Intl. Conf. on Knowledge Discovery and Data Mining (KDD 1998), pp. 80–86 (1998)

    Google Scholar 

  8. UCI repository, http://www.ics.uci.edu/~mlearn/MLRepository.html

  9. Zaïane, O.R., Antonie, M.-L.: Classifying text documents by associating terms with text categories. In: Proc. of the Thirteenth Australasian Database Conference (ADC 2002), pp. 215–222 (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zaïane, O.R., Antonie, ML. (2005). On Pruning and Tuning Rules for Associative Classifiers. In: Khosla, R., Howlett, R.J., Jain, L.C. (eds) Knowledge-Based Intelligent Information and Engineering Systems. KES 2005. Lecture Notes in Computer Science(), vol 3683. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11553939_136

Download citation

  • DOI: https://doi.org/10.1007/11553939_136

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28896-1

  • Online ISBN: 978-3-540-31990-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics