Abstract
As mentioned in Chap. 1, pruning methods are increasingly required for rule simplification due to the overfitting problem. This chapter introduces two approaches of rule simplification namely, pre-pruning and post-pruning. In particular, some existing rule pruning algorithms are described in detail. These algorithms are also discussed comparatively with respects to their advantages and disadvantages.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Higgins, C.M.: Classification and Approximation with Rule-Based Networks. California (1993)
Smyth, P., Rodney, G.M.: An information theoretic approach to rule induction from databases. IEEE Trans. Knowl. Data Eng. 4(4), 301–316 (1992)
Liu, H., Gegov, A., Stahl, F.: J-measure based hybrid pruning for complexity reduction in classification rules. WSEAS Trans. Syst. 12(9), 433–446 (2013)
Kononenko, I., Kukar, M.: Machine Learning and Data Mining: Introduction to Principles and Algorithms, Chichester. Horwood Publishing Limited, West Sussex (2007)
Furnkranz, J.: Separate-and-conquer rule learning. Artif. Intell. Rev. 13, 3–54 (1999)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Liu, H., Gegov, A., Cocea, M. (2016). Simplification of Classification Rules. In: Rule Based Systems for Big Data. Studies in Big Data, vol 13. Springer, Cham. https://doi.org/10.1007/978-3-319-23696-4_4
Download citation
DOI: https://doi.org/10.1007/978-3-319-23696-4_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-23695-7
Online ISBN: 978-3-319-23696-4
eBook Packages: EngineeringEngineering (R0)