Lazy learning

Lazy learning

Lazy learning (engl., „Träges Lernen“) ist eine Klasse von maschinellen Lernverfahren. Im Gegensatz zum eager learning findet dabei die Modellbildung nicht während oder nach dem Trainieren statt, sondern erst zur Zeit der Anfrage.[1]

Der Vorteil ist dabei, dass zur Zeit der Abfrage die Modellbildung lokal in der Umgebung des aktuellen Arbeitspunktes geschehen kann.

Literatur

Einzelnachweise

  1. ↑ Christopher G. Atkeson, Andrew W. Moore, Stefan Schaal: Locally Weighted Learning. Juli 1999.

Wikimedia Foundation.

Игры ⚽ Нужно решить контрольную?

Schlagen Sie auch in anderen Wörterbüchern nach:

  • Lazy learning — In artificial intelligence, lazy learning is a learning method in which generalization beyond the training data is delayed until a query is made to the system, as opposed to in eager learning, where the system tries to generalize the training… …   Wikipedia

  • Learning Resource Centers — Information and communication development opportunities and information flow are the big challenges dedicated review most of educational questions, whether from theoretical frames or material facilitations. School libraries are considered one of… …   Wikipedia

  • Eager learning — (engl., „Eifriges Lernen“) ist eine Klasse von maschinellen Lernverfahren. Im Gegensatz zum lazy learning findet dabei die Modellbildung offline einmalig auf Basis der Trainingsdaten statt, und nicht online zur Zeit der Anfrage. Der Vorteil ist,… …   Deutsch Wikipedia

  • Eager learning — In artificial intelligence, eager learning is a learning method in which the system tries to construct a general, input independent target function during training of the system, as opposed to lazy learning, where generalization beyond the… …   Wikipedia

  • Online machine learning — In machine learning, online learning is a model of induction that learns one instance at a time. The goal in online learning is to predict labels for instances. For example, the instances could describe the current conditions of the stock market …   Wikipedia

  • Instance-based learning — In machine learning, instance based learning or memory based learning 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 …   Wikipedia

  • Concept learning — Concept learning, also known as category learning, concept attainment, and concept formation, is largely based on the works of the cognitive psychologist Jerome Bruner. Bruner, Goodnow, Austin (1967) defined concept attainment (or concept… …   Wikipedia

  • k-nearest neighbor algorithm — KNN redirects here. For other uses, see KNN (disambiguation). In pattern recognition, the k nearest neighbor algorithm (k NN) is a method for classifying objects based on closest training examples in the feature space. k NN is a type of instance… …   Wikipedia

  • K-nearest neighbor algorithm — In pattern recognition, the k nearest neighbor algorithm ( k NN) is a method for classifying objects based on closest training examples in the feature space. k NN is a type of instance based learning, or lazy learning where the function is only… …   Wikipedia

  • K-Nearest-Neighbor — K Nächste Nachbarn in einer zweidimensionalen Punktmenge mit k=1 (dunkelblau) und k=5 (hellblau). Der Radius der Kreise ist nicht fest. Die Nächste Nachbarn Klassifikation ist eine parameterfreie Methode zur Schätzung von… …   Deutsch Wikipedia

Share the article and excerpts

Direct link
… Do a right-click on the link above
and select “Copy Link”