Industrial and Engineering Applications of Artificial Intelligence and Expert Systems
DOI: 10.1007/bfb0024976
|View full text |Cite
|
Sign up to set email alerts
|

Retraining and redundancy elimination for a Condensed Nearest Neighbour network

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 8 publications
0
1
0
Order By: Relevance
“…Thus we propose to adapt the database (memory) in order to span the nonlinear parts with more samples, providing a variable sample distribution and a variable size of the local neighborhood. This approach is similar to the socalled condensed nearest neighbor classification [12], which tries to find and retain only those samples that lie on the decision boundaries between classification categories [13]. This results in a piecewise constant approximation of the function with values between the decision boundaries being interpolated as constant.…”
Section: A Memory Managementmentioning
confidence: 99%
“…Thus we propose to adapt the database (memory) in order to span the nonlinear parts with more samples, providing a variable sample distribution and a variable size of the local neighborhood. This approach is similar to the socalled condensed nearest neighbor classification [12], which tries to find and retain only those samples that lie on the decision boundaries between classification categories [13]. This results in a piecewise constant approximation of the function with values between the decision boundaries being interpolated as constant.…”
Section: A Memory Managementmentioning
confidence: 99%