1. Advantages

2. Disadvantages

3. Examples of Lazy Learning Methods

4. References

In machine learning, lazy learning is a learning method in which generalization of the training data is, in theory, 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 primary motivation for employing lazy learning, as in the K-nearest neighbors algorithm, used by online recommendation systems ("people who viewed/purchased/listened to this movie/item/tune also ...") is that the data set is continuously updated with new entries (e.g., new items for sale at Amazon, new movies to view at Netflix, new clips at Youtube, new music at Spotify or Pandora). Because of the continuous update, the "training data" would be rendered obsolete in a relatively short time especially in areas like books and movies, where new best-sellers or hit movies/music are published/released continuously. Therefore, one cannot really talk of a "training phase".

Lazy classifiers are most useful for large, continuously changing datasets with few attributes that are commonly queried. Specifically, even if a large set of attributes exist - for example, books have a year of publication, author/s, publisher, title, edition, ISBN, selling price, etc. - recommendation queries rely on far fewer attributes - e.g., purchase or viewing co-occurrence data, and user ratings of items purchased/viewed.

Advantages

The main advantage gained in employing a lazy learning method 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.

Disadvantages

Theoretical disadvantages with lazy learning include:

• The large space requirement to store the entire training dataset. In practice, this is not an issue because of advances in hardware and the relatively small number of attributes (e.g.,as co-occurrence frequency) that need to be stored.
• Particularly noisy training data increases the case base unnecessarily, because no abstraction is made during the training phase. In practice, as stated earlier, lazy learning is applied to situations where any learning performed in advance soon becomes obsolete because of changes in the data. Also, for the problems for which lazy learning is optimal, "noisy" data does not really occur - the purchaser of a book has either bought another book or hasn't.
• Lazy learning methods are usually slower to evaluate. In practice, for very large databases with high concurrency loads, the queries are not postponed until actual query time, but recomputed in advance on a periodic basis - e.g., nightly, in anticipation of future queries, and the answers stored. This way, the next time new queries are asked about existing entries in the database, the answers are merely looked up rapidly instead of having to be computed on the fly, which would almost certainly bring a high-concurrency multi-user system to its knees.

There are standard techniques to improve re-computation efficiency so that a particular answer is not recomputed unless the data that impact this answer have changed (e.g., new items, new purchases, new views). In other words, the stored answers are updated incrementally.

This approach, used by large e-commerce or media sites, has long been used in the Entrez portal of the National Center for Biotechnology Information (NCBI) to precompute similarities between the different items in its large datasets: biological sequences, 3-D protein structures, published-article abstracts, etc. Because "find similar" queries are asked so frequently, the NCBI uses highly parallel hardware to perform nightly recomputation. The recomputation is performed only for new entries in the datasets against each other and against existing entries: the similarity between two existing entries need not be recomputed.

Examples of Lazy Learning Methods

• K-nearest neighbors, which is a special case of instance-based learning.
• Lazy naive Bayes rules, which are extensively used in commercial spam detection software. Here, the spammers keep getting smarter and revising their spamming strategies, and therefore the learning rules must also be continually updated.

References

• [https://cran.r-project.org/web/packages/lazy/ lazy: Lazy Learning for Local Regression], R package with reference manual
• {{cite web|url=http://iridia0.ulb.ac.be/~lazy/|title=The Lazy Learning Package|archive-url=https://web.archive.org/web/20120216183916/http://iridia0.ulb.ac.be/~lazy/|archive-date=16 February 2012}}
• Webb G.I. (2011) Lazy Learning. In: Sammut C., Webb G.I. (eds) Encyclopedia of Machine Learning. Springer, Boston, MA

• Baroness Ramsay of Cartvale
• Baroness Raymonde de LaRoche
• Baroness Rendell
• Baroness Richardson of Calow
• Baroness Sandys
• Baroness Sarah Ludford
• Baroness Scotland of Asthal
• Baroness Sharples
• Baroness Sharp of Guildford
• Baroness Soames
• Baroness (solitaire)
• Baroness Stern
• Baroness Sybille de Selys Longchamps
• Baroness Sybille de Selys-Longchamps
• Baroness Sybille de Sélys-Longchamps
• Baroness Sybille de Sélys Longchamps
• Baroness Symons of Vernham Dean
• Baroness Thatcher
• Baroness Thornton
• Baroness Trumptington
• Baroness Uddin
• Baroness Warwick of Undercliffe
• Baroness Wilcox
• Baroness Williams of Crosby
• Baroness Yarmouth