Improving the AUC of probabilistic estimation trees.

DOI10.1007/B13633MaRDI QIDQ5897341zbMATH OpenOpenAlexFDO

Authors C. Ferri, Peter Flach, J. Hernández-Orallo

Publication date 23 February 2010

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

Full work available at URL https://doi.org/10.1007/b13633

zbMATH Keywords

decision-tree learning

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Tree induction for probability-based ranking
• A comparison of pruning criteria for probability trees
• Machine Learning: ECML 2004
• scientific article; zbMATH DE number 2088082
• Improved class probability estimates from decision tree models

Cited in

(9)

• Using negotiable features for prescription problems
• A critical analysis of variants of the AUC
• Semiparametric regression for discrete time-to-event data
• Machine Learning: ECML 2004
• A comparison of pruning criteria for probability trees
• A classification tree approach for the modeling of competing risks in discrete time
• Improved class probability estimates from decision tree models
• Adaptive partitioning schemes for bipartite ranking
• Tree induction for probability-based ranking

Describes a project that uses

Uses Software

• UCI
• HandTill2001

This page was built for publication: Improving the AUC of probabilistic estimation trees.

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