Loading [MathJax]/extensions/MathMenu.js
Convergence of the edited nearest neighbor (Corresp.) | IEEE Journals & Magazine | IEEE Xplore
Scheduled Maintenance: On Tuesday, 25 February, IEEE Xplore will undergo scheduled maintenance from 1:00-5:00 PM ET (1800-2200 UTC). During this time, there may be intermittent impact on performance. We apologize for any inconvenience.

Convergence of the edited nearest neighbor (Corresp.)


Abstract:

The editedknearest neighbor rule (k-NNR) consists of 1) eliminating those samples from the data which are not classified correctly by thek-NNR and the remainder of the da...Show More

Abstract:

The editedknearest neighbor rule (k-NNR) consists of 1) eliminating those samples from the data which are not classified correctly by thek-NNR and the remainder of the data, and 2) using the NNR with the samples which remain from 1) to classify new observations. Wilson has shown that this rule has an asymptotic probability of error which is better than that of thek-NNR. A key step in his development is showing the convergence of the edited nearest neighbor. His lengthy argument is replaced here by a somewhat simpler one which uses an intuitive fact about the editing procedure.
Published in: IEEE Transactions on Information Theory ( Volume: 19, Issue: 5, September 1973)
Page(s): 696 - 697
Date of Publication: 06 January 2003

ISSN Information:


References

References is not available for this document.