Consolidated trees versus bagging when explanation is required

DOI10.1007/S00607-010-0094-ZzbMATH Open1206.68260OpenAlexW2056349277MaRDI QIDQ610446FDOQ610446

Authors: Jesús M. Pérez, Iñaki Albisua, Olatz Arbelaitz, Ibai Gurrutxaga, José I. Martín, Javier Muguerza, Iñigo Perona 

Publication date: 8 December 2010

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00607-010-0094-z

Recommendations

• Bundling classifiers by bagging trees
• Conceptual views on tree ensemble classifiers
• Comparing boosting and bagging for decision trees of rankings
• On Tackling Explanation Redundancy in Decision Trees
• scientific article; zbMATH DE number 5280159

zbMATH Keywords

machine learningdecision treesbaggingcomprehensibilitymultiple classifier systems

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)

Cites Work

• The elements of statistical learning. Data mining, inference, and prediction
• Bagging predictors
• Statistical comparisons of classifiers over multiple data sets
• An extension on ``Statistical comparisons of classifiers over multiple data sets for all pairwise comparisons
• Title not available (Why is that?)
• Stability of randomized learning algorithms
• Boosted classification trees and class probability/quantile estimation
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Uses Software

• UCI-ml
• C4.5

This page was built for publication: Consolidated trees versus bagging when explanation is required

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