Complexity measures for meta-learning and their optimality

DOI10.1007/978-3-642-44958-1_15MaRDI QIDQ2868413zbMATH OpenOpenAlexFDO

Authors Norbert Jankowski

Publication date 17 December 2013

Published in Algorithmic Probability and Friends. Bayesian Prediction and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-44958-1_15

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Data complexity meta-features for regression problems
• scientific article; zbMATH DE number 2079494
• Summary of algorithm selection problems based on meta-learning
• Meta-learning in computational intelligence.
• Selective generation of training examples in active meta-learning

Cited in

(6)

• Speeding up algorithm selection using average ranking and active testing by introducing runtime
• Dataset2Vec: learning dataset meta-features
• scientific article; zbMATH DE number 1966530 (Why is no real title available?)
• scientific article; zbMATH DE number 2044698 (Why is no real title available?)
• scientific article; zbMATH DE number 2079494 (Why is no real title available?)
• scientific article; zbMATH DE number 1843025 (Why is no real title available?)

This page was built for publication: Complexity measures for meta-learning and their optimality

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