Geometric proximity graphs for improving nearest neighbor methods in instance-based learning and data mining

@article{Toussaint2005GeometricPG,
  title={Geometric proximity graphs for improving nearest neighbor methods in instance-based learning and data mining},
  author={Godfried T. Toussaint},
  journal={Int. J. Comput. Geometry Appl.},
  year={2005},
  volume={15},
  pages={101-150}
}
In the typical nonparametric approach to classification in instance-based learning and data mining, random data (the training set of patterns) are collected and used to design a decision rule (classifier). One of the most well known such rules is the k-nearestneighbor decision rule (also known as lazy learning) in which an unknown pattern is classified into the majority class among its k nearest neighbors in the training set. Several questions related to this rule have received considerable… CONTINUE READING
BETA

Citations

Publications citing this paper.
SHOWING 1-10 OF 49 CITATIONS

An Investigation of Significant Object Recognition Techniques

VIEW 6 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Data classification combining Self-Organizing Maps and Informative Nearest Neighbor

  • 2016 International Joint Conference on Neural Networks (IJCNN)
  • 2016
VIEW 1 EXCERPT

SepMe: 2002 New visual separation measures

  • 2016 IEEE Pacific Visualization Symposium (PacificVis)
  • 2016
VIEW 1 EXCERPT
CITES BACKGROUND

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…