1991
DOI: 10.1023/a:1022689900470
|View full text |Cite
|
Sign up to set email alerts
|

Untitled

Abstract: Storing and using specific instances improves the performance of several supervised learning algorithms. These include algorithms that learn decision trees, classification rules, and distributed networks. However, no investigation has analyzed algorithms that use only specific instances to solve incremental learning tasks. In this paper, we describe a framework and methodology, called instance-based learning, that generates classification predictions using only specific instances. Instance-based learning algor… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
50
0
1

Year Published

2002
2002
2016
2016

Publication Types

Select...
5
4
1

Relationship

0
10

Authors

Journals

citations
Cited by 1,063 publications
(51 citation statements)
references
References 38 publications
0
50
0
1
Order By: Relevance
“…K-nearest neighbors (kNN) classifier calculates distance between feature vector of input vector and others feature vectors from training set [40]. It has used Euclidean distance metrics, k = 3 and distance weighting with equation: 1/distance.…”
Section: Features Extractionmentioning
confidence: 99%
“…K-nearest neighbors (kNN) classifier calculates distance between feature vector of input vector and others feature vectors from training set [40]. It has used Euclidean distance metrics, k = 3 and distance weighting with equation: 1/distance.…”
Section: Features Extractionmentioning
confidence: 99%
“…Relational Instance-Based Learning (RIBL) algorithms extend the idea of instance based learning to relational learning (Emde and Wettschereck, 1996). Instance-Based Learning (IBL) algorithms (Aha et al, 1991) are very popular and a well studied choice (Wettsschereck and Dietterich, 1995) for propositional learning problems. Probabilistic Relational Models (PRMs) (Getoor et al, 2001) provide another approach to relational data mining that is grounded in a sound statistical framework.…”
Section: Learning Data In a Multi-relational Environmentmentioning
confidence: 99%
“…IBK is an instance based algorithm (Aha et al, 1991), which belongs to the lazy learning algorithms, using the k-Nearest Neighbors algorithm (k-NN). At first it stores the training instances verbatim and then searches for the instance that most closely resembles the new instance.…”
Section: Lazy Learning Algorithmsmentioning
confidence: 99%