Abstract
This work continues an earlier analysis (Castineira and Monard, 1990; Nicoletti and Monard, 1993) of the problem of pruning, within a framework of automated feature construction when learning boolean functions. Automated feature construction is implemented through three different biases, namely root, fringe and root-fringe. It presents an empirical evaluation of two pruning techniques (reduced error pruning and of its variation) based on their application to trees generated through an automated feature construction. These techniques, although at first studied only for classical boolean functions, appear very promising for an analysis of fuzzy boolean connectives.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.