Pairwise meta-rules for better meta-learning-based algorithm ranking

DOI10.1007/S10994-013-5387-YzbMath1293.68241OpenAlexW2145955992MaRDI QIDQ399914

Bernhard Pfahringer, Quan Sun

Publication date: 20 August 2014

Published in: Machine Learning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10994-013-5387-y

zbMATH Keywords

ensemble learningmeta-learningalgorithm rankingranking trees

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items (3)

Scalable Gaussian process-based transfer surrogates for hyperparameter optimization ⋮ Speeding up algorithm selection using average ranking and active testing by introducing runtime ⋮ \textsc{Alors}: an algorithm recommender system

Uses Software

• WEKA
• bootstrap

Cites Work

• Bagging predictors
• Meta-learning in computational intelligence.
• A meta-learning method to select the kernel width in support vector regression
• Asymptotic theory for measures of concordance with special reference to average Kendall tau
• Ranking learning algorithms: Using IBL and meta-learning on accuracy and time results
• Label ranking by learning pairwise preferences
• Metalearning
• A WEIGHTED RANK MEASURE OF CORRELATION
• Random forests
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Pairwise meta-rules for better meta-learning-based algorithm ranking