Lazy learning

In artificial intelligence, lazy learning is a learning method in which generalization beyond the training data is delayed until a query is made to the system, as opposed to in eager learning, where the system tries to generalize the training data before receiving queries.

The main advantage gained in employing a lazy learning method, such as Case based reasoning, is that the target function will be approximated locally, such as in the k-nearest neighbor algorithm. Because the target function is approximated locally for each query to the system, lazy learning systems can simultaneously solve multiple problems and deal successfully with changes in the problem domain.

The disadvantages with lazy learning include the large space requirement to store the entire training dataset. Particularly noisy training data increases the case base unnecessarily, because no abstraction is made during the training phase. Another disadvantage is that lazy learning methods are usually slower to evaluate, though this is coupled with a faster training phase.

Tech-stub

References

http://cran.r-project.org/web/packages/lazy/ -- Lazy Learning for Local Regression
http://www.ulb.ac.be/di/map/gbonte/Papers.html -- Publications of Gianluca Bontempi
http://iridia0.ulb.ac.be/~lazy/ --The Lazy Learning Package