Supervised Lazy Learning Algorithm

A Supervised Lazy Learning Algorithm is a Supervised Learning Algorithm that is a Lazy Learning Algorithm.

• Context:
  • It can be:
    • a Supervised Lazy Model-based Algorithm.
    • a Supervised Lazy Instance-based Algorithm.
• Example(s):
  • DBPredictor, a Supervised Lazy Model-based Classification Algorithm.
• Counter-Example(s):
  • k-Nearest Neighbor, a Lazy Instance-based Learning Algorithm.
  • C4.5, an Eager Model-based Learning Algorithm.
• See: Eager Learning Algorithm, Instance-based Learning Algorithm.

---

---

References

1999

• (Birattari & 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.