scientific article; zbMATH DE number 1726664

MaRDI QIDQ2781900zbMATH OpenFDO

Authors Patrice Latinne, Olivier Debeir, Christine Decaestecker

Publication date 2 July 2002

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Computing methodologies and applications (68U99)

Recommendations

• Random forests
• An empirical comparison of ensemble methods based on classification trees
• Machine Learning: ECML 2004
• Search for the smallest random forest
• To tune or not to tune the number of trees in random forest

Cited in

(16)

• Ensemble of optimal trees, random forest and random projection ensemble classification
• Approximate classification with web ontologies through evidential terminological trees and forests
• How large should ensembles of classifiers be?
• Applying randomness effectively based on random forests for classification task of datasets of insufficient information
• Estimating a sharp convergence bound for randomized ensembles
• A random forest guided tour
• Do we need hundreds of classifiers to solve real world classification problems?
• Search for the smallest random forest
• To tune or not to tune the number of trees in random forest
• Measuring the algorithmic convergence of randomized ensembles: the regression setting
• Cost-complexity pruning of random forests
• Machine Learning: ECML 2004
• An empirical comparison of ensemble methods based on classification trees
• Extremely randomized trees
• Extremely randomized trees
• Estimating the algorithmic variance of randomized ensembles via the bootstrap

Describes a project that uses

Uses Software

• C4.5

This page was built for publication:

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