Classification trees with soft splits optimized for ranking

DOI10.1007/S00180-019-00867-1MaRDI QIDQ120445zbMATH OpenOpenAlexWikidataFDO

Authors Jakub Dvořák

Publication date 4 February 2019

Published in Computational Statistics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00180-019-00867-1

zbMATH Keywords

supervised learningdecision treesscoring classifier

Mathematics Subject Classification ID

Computational methods for problems pertaining to statistics (62-08) Classification and discrimination; cluster analysis (statistical aspects) (62H30)

Recommendations

• Soft classification trees
• Optimal classification trees
• A novel algorithm to optimize classification trees
• A ranking algorithm based on decision tree
• scientific article; zbMATH DE number 2079498

Cites work

• scientific article; zbMATH DE number 3860199 (Why is no real title available?)
• A Simplex Method for Function Minimization
• Ensemble of randomized soft decision trees for robust classification
• Ranking forests

Cited in

(5)

• Soft classification trees
• scientific article; zbMATH DE number 2079498 (Why is no real title available?)
• SplitSoftening
• Ensemble of randomized soft decision trees for robust classification
• Explainable ensemble trees

Describes a project that uses

Uses Software

• C4.5
• mlbench
• randomForest
• UCI

This page was built for publication: Classification trees with soft splits optimized for ranking

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