Lazy Instance-based Learning Algorithm

A Lazy Instance-based Learning Algorithm is a lazy learning algorithm that is also an Instance-based Learning Algorithm.

• AKA: Supervised Instance-based Learning Algorithm, Lazy Instance-based Algorithm.
• Context:
  • It can be applied by a Lazy Instance-based Learning System (to solve a lazy instance-based learning task).
  • It can (lazily) postpone any work until an event that is to be predicted is presented.
  • It can base its prediction on the instances that are most Similar to the Test Case.
• Example(s):
  • a k-Nearest Neighbor Algorithm, such as the IB1 Algorithm.
  • …
• Counter-Example(s):
  • a Lazy Model-based Learning Algorithm.
  • an Eager Instance-based Learning Algorithm.
• See: Eager Model-based Learning Algorithm.

---

---

References

1991

• (Aha et al, 1991) ⇒ David W. Aha, D. Kibler, and M. K. Albert. (1991). “Instance-based learning algorithms.” In: Machine Learning, 6(1).

---