Go to:
Logótipo
Comuta visibilidade da coluna esquerda
Você está em: Start > Publications > View > Algorithm selection via meta-learning and sample-based active testing
Publication

Publications

Algorithm selection via meta-learning and sample-based active testing

Title
Algorithm selection via meta-learning and sample-based active testing
Type
Article in International Conference Proceedings Book
Year
2015
Authors
Abdulrahman, SM
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. View Authenticus page Without ORCID
Pavel Brazdil
(Author)
FEP
View Personal Page You do not have permissions to view the institutional email. Search for Participant Publications View Authenticus page Without ORCID
Van Rijn, JN
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. Without AUTHENTICUS Without ORCID
Vanschoren, J
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. Without AUTHENTICUS Without ORCID
Conference proceedings International
Pages: 55-66
International Workshop on Meta-Learning and Algorithm Selection, MetaSel 2015 - co-located with European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases 2015, ECMLPKDD 2015
7 September 2015
Indexing
Other information
Authenticus ID: P-00G-QJ3
Abstract (EN): Identifying the best machine learning algorithm for a given problem continues to be an active area of research. In this paper we present a new method which exploits both meta-level information acquired in past experiments and active testing, an algorithm selection strategy. Active testing attempts to iteratively identify an algorithm whose performance will most likely exceed the performance of previously tried algorithms. The novel method described in this paper uses tests on smaller data sample to rank the most promising candidates, thus optimizing the schedule of experiments to be carried out. The experimental results show that this approach leads to considerably faster algorithm selection.
Language: English
Type (Professor's evaluation): Scientific
Documents
We could not find any documents associated to the publication.
Related Publications

Of the same authors

Speeding up algorithm selection using average ranking and active testing by introducing runtime (2018)
Article in International Scientific Journal
Abdulrahman, SM; Pavel Brazdil; van Rijn, JN; Vanschoren, J
Fast Algorithm Selection Using Learning Curves (2015)
Article in International Conference Proceedings Book
van Rijn, JN; Abdulrahman, SM; Pavel Brazdil; Vanschoren, J
Recommend this page Top
Copyright 1996-2025 © Faculdade de Direito da Universidade do Porto  I Terms and Conditions  I Acessibility  I Index A-Z
Page created on: 2025-07-19 at 14:22:58 | Privacy Policy | Personal Data Protection Policy | Whistleblowing