Comparing boosting and bagging for decision trees of rankings

DOI10.1007/S00357-021-09397-2OpenAlexW3197024523MaRDI QIDQ2129304FDOQ2129304

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)

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

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

zbMATH Keywords

boostingdecision treesensemble methodsrankingspreference learning

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (1)

• Consolidated trees versus bagging when explanation is required

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)