0000000000287621

AUTHOR

Eneldo Loza Mencía

showing 1 related works from this author

Comparing Boosting and Bagging for Decision Trees of Rankings

2021

AbstractDecision tree learning is among the most popular and most traditional families of machine learning algorithms. While these techniques excel in being quite intuitive and interpretable, they also suffer from instability: small perturbations in the training data may result in big changes in the predictions. The so-called ensemble methods combine the output of multiple trees, which makes the decision more reliable and stable. They have been primarily applied to numeric prediction problems and to classification tasks. In the last years, some attempts to extend the ensemble methods to ordinal data can be found in the literature, but no concrete methodology has been provided for preference…

Ordinal dataBoosting (machine learning)Preference learningEnsemble methodsComputer sciencebusiness.industryDecision tree learningDecision treesDecision treeLibrary and Information SciencesMachine learningcomputer.software_genreEnsemble learningBoostingMathematics (miscellaneous)RankingPattern recognition (psychology)Psychology (miscellaneous)Artificial intelligencePreference learningStatistics Probability and UncertaintybusinesscomputerRankings
researchProduct