Supervised Lazy Learning Algorithm: Difference between revisions
Jump to navigation
Jump to search
m (Text replace - ") => [" to ") ⇒ [") |
m (Text replacement - ". ----" to ". ----") |
||
| (16 intermediate revisions by the same user not shown) | |||
| Line 1: | Line 1: | ||
A [[Supervised Lazy Learning Algorithm]] is a [[Supervised Learning Algorithm]] that is a [[Lazy Learning Algorithm]]. | A [[Supervised Lazy Learning Algorithm]] is a [[Supervised Learning Algorithm]] that is a [[Lazy Learning Algorithm]]. | ||
* <B | * <B>Context</U>:</B> | ||
** It can be: | ** It can be: | ||
*** a [[Supervised Lazy Model-based Algorithm]]. | *** a [[Supervised Lazy Model-based Algorithm]]. | ||
*** a [[Supervised Lazy Instance-based Algorithm]]. | *** a [[Supervised Lazy Instance-based Algorithm]]. | ||
* <B | * <B>Example(s):</B> | ||
** [[DBPredictor]], a [[Supervised Lazy Model-based Classification Algorithm]]. | ** [[DBPredictor]], a [[Supervised Lazy Model-based Classification Algorithm]]. | ||
* <B | ** … | ||
* <B>Counter-Example(s):</B> | |||
** [[k-Nearest Neighbor]], a [[Lazy Instance-based Learning Algorithm]]. | ** [[k-Nearest Neighbor]], a [[Lazy Instance-based Learning Algorithm]]. | ||
** [[C4.5]], an [[Eager Model-based Learning Algorithm]]. | ** [[C4.5]], an [[Eager Model-based Learning Algorithm]]. | ||
* <B | * <B>See:</B> [[Eager Learning Algorithm]], [[Instance-based Learning Algorithm]]. | ||
---- | ---- | ||
---- | ---- | ||
===1999=== | == References == | ||
* ([[1999_LazyLearningMeetstheRecursiveLe|Birattari | |||
=== 1999 === | |||
* ([[1999_LazyLearningMeetstheRecursiveLe|Birattari et al., 1999]]) ⇒ [[Mauro Birattari]], [[Gianluca Bontempi]], and [[Hugues Bersini]]. ([[1999]]). “[http://iridia.ulb.ac.be/~mbiro/paperi/BirBonBer1999nips.pdf Lazy Learning Meets the Recursive Least Squares Algorithm].” In: [[Proceedings of the 1998 conference on Advances in Neural Information Processing Systems II]]. | |||
** QUOTE: [[Supervised Lazy Learning Algorithm|Lazy learning]] is a [[memory-based technique]] that, once a query is received, extracts a prediction interpolating locally the neighboring examples of the query which are considered relevant according to a [[distance measure]]. | ** QUOTE: [[Supervised Lazy Learning Algorithm|Lazy learning]] is a [[memory-based technique]] that, once a query is received, extracts a prediction interpolating locally the neighboring examples of the query which are considered relevant according to a [[distance measure]]. | ||
---- | |||
__NOTOC__ | __NOTOC__ | ||
[[Category:Concept]] | [[Category:Concept]] | ||
Latest revision as of 02:27, 24 September 2021
A Supervised Lazy Learning Algorithm is a Supervised Learning Algorithm that is a Lazy Learning Algorithm.
- Context:
- Example(s):
- Counter-Example(s):
- See: Eager Learning Algorithm, Instance-based Learning Algorithm.
References
1999
- (Birattari et al., 1999) ⇒ Mauro Birattari, Gianluca Bontempi, and Hugues Bersini. (1999). “Lazy Learning Meets the Recursive Least Squares Algorithm.” In: Proceedings of the 1998 conference on Advances in Neural Information Processing Systems II.
- QUOTE: Lazy learning is a memory-based technique that, once a query is received, extracts a prediction interpolating locally the neighboring examples of the query which are considered relevant according to a distance measure.