Most machine learning algorithms are eager methods in the sense that a model is generated with the complete training data set and, afterwards, this model is used to generalize the new test instances. In this work we study the performance of different machine learning algorithms when they are learned using a lazy approach. The idea is to build a classification model once the test instance is received and this model will only learn a selection of training patterns, the most relevant for the test instance. The method presented here incorporates a dynamic selection of training patterns using a weighting function. The lazy approach is applied to machine learning algorithms based on different paradigms and is validated in different classification domains. © 2009 International Federation for Information Processing.
CITATION STYLE
Galván, I. M., Valls, J. M., Lecomte, N., & Isasi, P. (2009). A lazy approach for machine learning algorithms. IFIP International Federation for Information Processing, 296, 517–522. https://doi.org/10.1007/978-1-4419-0221-4_60
Mendeley helps you to discover research relevant for your work.