Comparing boosting and bagging for decision trees of rankings

DOI10.1007/S00357-021-09397-2MaRDI QIDQ2129304zbMATH OpenOpenAlexFDO

Authors Antonella Plaia, Simona Buscemi, Johannes Fürnkranz, Eneldo Loza Mencía

Publication date 22 April 2022

Published in Journal of Classification (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s00357-021-09397-2

zbMATH Keywords

boostingdecision treesensemble methodspreference learningrankings

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30)

Recommendations

• On the boosting ability of top-down decision tree learning algorithms
• scientific article; zbMATH DE number 1256765
• BoostingTree: parallel selection of weak learners in boosting, with application to ranking
• scientific article; zbMATH DE number 2086341
• Decision tree modeling for ranking data

Cites work

• 10.1162/1532443041827916
• A differential evolution algorithm for finding the median ranking under the Kemeny axiomatic approach
• A new rank correlation coefficient with application to the consensus ranking problem
• A novel method for estimating the common signals for consensus across multiple ranked lists
• A recursive partitioning method for the prediction of preference rankings based upon Kemeny distances
• Accurate algorithms for identifying the median ranking when dealing with weak and partial rankings under the Kemeny axiomatic approach
• An axiomatic approach to distance on partial orderings
• An introduction to statistical learning. With applications in R
• Analyzing bagging
• Arcing classifiers. (With discussion)
• Bagging predictors
• Binary trees for dissimilarity data
• Decision tree modeling for ranking data
• Detecting the end of agreement between two long ranked lists
• Discovering a taste for the unusual: exceptional models for preference mining
• Distance-based tree models for ranking data
• scientific article; zbMATH DE number 3860199 (Why is no real title available?)
• scientific article; zbMATH DE number 3782216 (Why is no real title available?)
• scientific article; zbMATH DE number 5056239 (Why is no real title available?)
• Label ranking algorithms: a survey
• Label ranking by learning pairwise preferences
• Model selection in linear mixed-effect models
• Moderate-deviation-based inference for random degeneration in paired rank lists
• NON-NULL RANKING MODELS. I
• On bagging and nonlinear estimation
• Preference learning: An introduction
• Random forests
• Using clustering of rankings to explain brand preferences with personality and socio-demographic variables
• Weighted distance-based trees for ranking data
• Weighted distances between preferences

Cited in

(1)

• Consolidated trees versus bagging when explanation is required

Describes a project that uses

Uses Software

• R
• adabag
• ISLR
• ConsRank

This page was built for publication: Comparing boosting and bagging for decision trees of rankings

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