In machine learning, instance-based learning (sometimes called memory-based learning[1]) is a family of learning algorithms that, instead of performing explicit generalization, compare new problem instances with instances seen in training, which have been stored in memory. Because computation is postponed until a new instance is observed, these algorithms are sometimes referred to as "lazy."[2]

It is called instance-based because it constructs hypotheses directly from the training instances themselves.[3] This means that the hypothesis complexity can grow with the data:[3] in the worst case, a hypothesis is a list of n training items and the computational complexity of classifying a single new instance is O(n). One advantage that instance-based learning has over other methods of machine learning is its ability to adapt its model to previously unseen data. Instance-based learners may simply store a new instance or throw an old instance away.

Examples of instance-based learning algorithms are the k-nearest neighbors algorithm, kernel machines and RBF networks.[2]: ch. 8  These store (a subset of) their training set; when predicting a value/class for a new instance, they compute distances or similarities between this instance and the training instances to make a decision.

To battle the memory complexity of storing all training instances, as well as the risk of overfitting to noise in the training set, instance reduction algorithms have been proposed.[4]


See also

edit

References

edit
  1. ^ Walter Daelemans; Antal van den Bosch (2005). Memory-Based Language Processing. Cambridge University Press.
  2. ^ a b Tom Mitchell (1997). Machine Learning. McGraw-Hill.
  3. ^ a b Stuart Russell and Peter Norvig (2003). Artificial Intelligence: A Modern Approach, second edition, p. 733. Prentice Hall. ISBN 0-13-080302-2
  4. ^ D. Randall Wilson; Tony R. Martinez (2000). "Reduction techniques for instance-based learning algorithms". Machine Learning.


Stub icon

This machine learning–related article is a stub. You can help Wikipedia by adding missing information.

📚 Artikel Terkait di Wikipedia

Dynamic decision-making

Broadbent's Sugar Production Factory task[clarification needed]. The Instance-Based Learning Theory (IBLT) is a theory of how humans make decisions in dynamic

Multiple instance learning

In machine learning, multiple-instance learning (MIL) is a type of supervised learning. Instead of receiving a set of instances which are individually

Outline of machine learning

handling (GMDH) Inductive logic programming Instance-based learning Lazy learning Learning Automata Learning Vector Quantization Logistic Model Tree Minimum

Educational technology

encompasses several domains, including learning theory, computer-based training, online learning, and mobile learning (m-learning). The Association for Educational

Instance selection

pre-processing step that can be applied in many machine learning (or data mining) tasks. Approaches for instance selection can be applied for reducing the original

Lazy learning

k-NN technique, which is instance-based and function is only estimated locally. Theoretical disadvantages with lazy learning include: The large space

Educational game

problem solving. Game-based learning (GBL) is a type of game play that has defined learning outcomes. Generally, game-based learning is designed to balance

Task-based language teaching

task-based learning processes. According to Jon Larsson, in considering problem-based learning for language learning, i.e., task-based language learning: