FAQ

Lazy learning

Known as: Lazy-learning 
In machine learning, lazy learning is a learning method in which generalization beyond the training data is delayed until a query is made to the… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1994-2018
0102019942018

Related topics

Related topics

6 relations
Eager learningGaussian processInstance-based learningK-nearest neighbors algorithm
(More)

Broader (1)

Machine learning

Related mentions per year

Related mentions per year

1936-2018
19401960198020002020
Lazy learning
Machine learning
K-nearest neighbors algorithm
Gaussian process
Online machine learning
Instance-based learning

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2007
Highly Cited
2007
ML-KNN: A lazy learning approach to multi-label learning
Multi-label learning originated from the investigation of text categorization problem, where each document may belong to several… (More)
  • figure 2
  • table 1
  • table 2
  • table 3
  • figure 3
Is this relevant?
2002
2002
SNNB: A Selective Neighborhood Based Naïve Bayes for Lazy Learning
Naive Bayes is a probability-based classification method which is based on the assumption that attributes are conditionally… (More)
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Lazy Learning of Bayesian Rules
The naive Bayesian classifier provides a simple and effective approach to classifier learning, but its attribute independence… (More)
  • table 1
  • table 2
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Solving the Multiple-Instance Problem: A Lazy Learning Approach
As opposed to traditional supervised learning, multiple-instance learning concerns the problem of classifying a bag of instances… (More)
  • figure 1
  • table 1
  • table 2
  • table 3
  • table 4
Is this relevant?
1998
1998
Lazy Learning Meets the Recursive Least Squares Algorithm
Lazy learning is a memory-based technique that, once a query is received, extracts a prediction interpolating locally the… (More)
  • table 1
  • table 2
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Lazy Learning for Local Modeling and Control Design
This paper presents local methods for modeling and control of discrete-time unknown nonlinear dynamical systems, when only a… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1997
Highly Cited
1997
IGTree: Using Trees for Compression and Classification in Lazy Learning Algorithms
We describe the IGTree learning algorithm, which compresses an instance base into a tree structure. The concept of information… (More)
  • table 1
  • table 2
  • table 3
  • table 4
Is this relevant?
Highly Cited
1997
Highly Cited
1997
The Racing Algorithm: Model Selection for Lazy Learners
Given a set of models and some training data, we would like to find the model that best describes the data. Finding the model… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
Review
1997
Review
1997
A Review and Empirical Evaluation of Feature Weighting Methods for a Class of Lazy Learning Algorithms
Many lazy learning algorithms are derivatives of the k-nearest neighbor (k-NN) classifier, which uses a distance function to… (More)
  • table 1
  • table 2
  • figure 1
  • table 3
  • table 4
Is this relevant?
Highly Cited
1996
Highly Cited
1996
Lazy Decision Trees
Lazy learning algorithms, exemplified by nearestneighbor algorithms, do not induce a concise hypothesis from a given training set… (More)
  • figure 2
Is this relevant?