Comparing boosting and bagging for decision trees of rankings
From MaRDI portal
Publication:2129304
DOI10.1007/s00357-021-09397-2OpenAlexW3197024523MaRDI QIDQ2129304
Johannes Fürnkranz, Antonella Plaia, Simona Buscemi, 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
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Bagging predictors
- A recursive partitioning method for the prediction of preference rankings based upon Kemeny distances
- On bagging and nonlinear estimation
- 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
- Arcing classifiers. (With discussion)
- Analyzing bagging
- Weighted distance-based trees for ranking data
- Model selection in linear mixed-effect models
- Label ranking by learning pairwise preferences
- Weighted distances between preferences
- Binary trees for dissimilarity data
- Distance-based tree models for ranking data
- Detecting the end of agreement between two long ranked lists
- Preference Learning: An Introduction
- Label Ranking Algorithms: A Survey
- Decision Tree Modeling for Ranking Data
- NON-NULL RANKING MODELS. I
- An axiomatic approach to distance on partial orderings
- A new rank correlation coefficient with application to the consensus ranking problem
- 10.1162/1532443041827916
- An Introduction to Statistical Learning
- Moderate-Deviation-Based Inference for Random Degeneration in Paired Rank Lists
- Using clustering of rankings to explain brand preferences with personality and socio-demographic variables
- Random forests
