Skip to main content
Springer Nature Link
Log in

An Alternative Pruning Method Based on the Impurity-Complexity Measure

  • Conference paper
COMPSTAT

  • 742 Accesses

Abstract

This paper provides a new pruning method for classification trees based on the impurity-complexity measure. Advantages of the proposed approach compared to the error-complexity pruning method are outlined showing an example on a real data set.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

Similar content being viewed by others

References

  • Breiman, L., Friedman, J. H., Olshen, R. A. & Stone, C. J. (1984). Classification and Regression Trees. Wadsworth, Belmont CA.

    MATH  Google Scholar 

  • Cappelli, C. & Siciliano, R. (1997). On simplification methods for decision trees. In: Proceedings of the Ngus-97 Conference, 104–108.

    Google Scholar 

  • Esposito, F., Malerba, D. & Semeraro, G. (1993). Decision tree pruning as a search in the state space. In: Machine Learning: ECML-93, Lecture Notes in Artificial Intelligence (ed. P. Bradzil), 165–184. Berlin: Springer Verlag.

    Google Scholar 

  • Light, R.J. & Margolin, B.H. (1971). An analysis of variance for categorical data. Journal of the American Statistical Association, 66, 534–544.

    Article  MathSciNet  MATH  Google Scholar 

  • Mingers, J. (1989). An empirical comparison of pruning methods for decision tree induction. Machine Learning, 4, 227–243.

    Article  Google Scholar 

  • Mola, F & Siciliano, R (1997). A Fast Splitting Procedure for Classification trees. Statistics and Computing, 7, 208–216.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Matematica e Statistica, Università di Napoli Federico II, Italy

    Carmela Cappelli, Francesco Mola & Roberta Siciliano

Authors
  1. Carmela Cappelli
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Francesco Mola
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Roberta Siciliano
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Statistics Department, IACR-Rothamsted, AL5 2JQ, Harpenden, Herts, UK

    Roger Payne

  2. Department of Mathematics, University of Bristol, BS8 1TW, Bristol, UK

    Peter Green

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cappelli, C., Mola, F., Siciliano, R. (1998). An Alternative Pruning Method Based on the Impurity-Complexity Measure. In: Payne, R., Green, P. (eds) COMPSTAT. Physica, Heidelberg. https://doi.org/10.1007/978-3-662-01131-7_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-01131-7_25

  • Publisher Name: Physica, Heidelberg

  • Print ISBN: 978-3-7908-1131-5

  • Online ISBN: 978-3-662-01131-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics