Using J-pruning to reduce overfitting of classification rules in noisy domains

DOI10.1007/3-540-46146-9_43MaRDI QIDQ4410651zbMATH OpenFDO

Authors Max Bramer

Publication date 3 July 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2453/24530433.htm

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Learning and adaptive systems in artificial intelligence (68T05) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35) Computing methodologies and applications (68U99)

Recommendations

• Pre-pruning classification trees to reduce overfitting in noisy domains
• An empirical comparison of pruning methods for ensemble classifiers
• Cost complexity-based pruning of ensemble classifiers

Cited in

(7)

• A new classification method to overcome over-branching
• scientific article; zbMATH DE number 2089835 (Why is no real title available?)
• scientific article; zbMATH DE number 4166889 (Why is no real title available?)
• Noise elimination in inductive concept learning: A case study in medical diagnosis
• scientific article; zbMATH DE number 67792 (Why is no real title available?)
• scientific article; zbMATH DE number 2032414 (Why is no real title available?)
• Pre-pruning classification trees to reduce overfitting in noisy domains

This page was built for publication: Using J-pruning to reduce overfitting of classification rules in noisy domains

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4410651)