Sampling-based relative landmarks: Systematically test-driving algorithms before choosing

DOI10.1007/3-540-45329-6_12MaRDI QIDQ4736461zbMATH OpenFDO

Authors Carlos Soares, Johann Petrak, Pavel Brazdil

Publication date 9 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2258/22580088.htm

Mathematics Subject Classification ID

Database theory (68P15) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Determining the best classification algorithm with recourse to sampling and metalearning
• Finding representative landmarks of data on manifolds
• Adaptive sampling methods for scaling up knowledge discovery algorithms
• Sequential sampling algorithms: Unified analysis and lower bounds
• Choosing an algorithm of estimation based on samples of limited size

Cited in

(2)

• Instance spaces for machine learning classification
• AutonoML: Towards an Integrated Framework for Autonomous Machine Learning

This page was built for publication: Sampling-based relative landmarks: Systematically test-driving algorithms before choosing

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