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.
Lazy classifiers are most useful for large datasets with few attributes.
Famous quotes containing the words lazy and/or learning:
“The dreary flies, lazy and casual,
Stick to the ceiling, buzz along the wall.
O heart, the spider shuffles from the mould
Weaving, between the pinks and grapes, his pall.”
—Allen Tate (1899–1979)
“Our day of dependence, our long apprenticeship to the learning of other lands, draws to a close. The millions, that around us are rushing into life, cannot always be fed on the sere remains of foreign harvests.”
—Ralph Waldo Emerson (1803–1882)