Please use this identifier to cite or link to this item:
Title: Fast Algorithm Selection Using Learning Curves
Authors: van Rijn,JN
Salisu Mamman Abdulrhaman
Pavel Brazdil
Issue Date: 2015
Abstract: One of the challenges in Machine Learning to find a classifier and parameter settings that work well on a given dataset. Evaluating all possible combinations typically takes too much time, hence many solutions have been proposed that attempt to predict which classifiers are most promising to try. As the first recommended classifier is not always the correct choice, multiple recommendations should be made, making this a ranking problem rather than a classification problem. Even though this is a well studied problem, there is currently no good way of evaluating such rankings. We advocate the use of Loss Time Curves, as used in the optimization literature. These visualize the amount of budget (time) needed to converge to a acceptable solution. We also investigate a method that utilizes the measured performances of classifiers on small samples of data to make such recommendation, and adapt it so that it works well in Loss Time space. Experimental results show that this method converges extremely fast to an acceptable solution.
metadata.dc.type: conferenceObject
Appears in Collections:LIAAD - Articles in International Conferences

Files in This Item:
File Description SizeFormat 
P-00G-T0K.pdf320.36 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.