Ensemble learning for the partial label ranking problem

DOI10.1002/MMA.8489MaRDI QIDQ6181961zbMATH OpenFDO

Authors Juan Carlos Alfaro, Juan A. Aledo, José A. Gámez

Publication date 20 December 2023

Published in Mathematical Methods in the Applied Sciences (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.1002/MMA.8489

zbMATH Keywords

decision treesensembleslabel-ranking problempartial label-ranking problempreference learning

Mathematics Subject Classification ID

Statistical ranking and selection procedures (62F07) Learning and adaptive systems in artificial intelligence (68T05)

Cites work

• A decision-theoretic generalization of on-line learning and an application to boosting
• A Mathematical Theory of Communication
• A probabilistic graphical model-based approach for the label ranking problem
• A randomized approximation algorithm for computing bucket orders
• An extension on ``Statistical comparisons of classifiers over multiple data sets for all pairwise comparisons
• Approaching rank aggregation problems by using evolution strategies: the case of the optimal bucket order problem
• Bagging predictors
• BoosTexter: A boosting-based system for text categorization
• Experiments with Kemeny ranking: What works when?
• Label ranking algorithms: a survey
• Label ranking by learning pairwise preferences
• Machine learning. The art and science of algorithms that make sense of data.
• NON-NULL RANKING MODELS. I
• Random forests
• Statistical comparisons of classifiers over multiple data sets

Cited in

(2)

• scientific article; zbMATH DE number 6907801 (Why is no real title available?)
• MORE-PLR: multi-output regression employed for partial label ranking

This page was built for publication: Ensemble learning for the partial label ranking problem

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