Prototype selection for the nearest neighbour rule through proximity graphs
Pattern Recognition LettersPublished 1 June 1997
J. Salvador Sánchez, Filiberto Pla, Francesc J. Ferri
Citations153
SJR quartileQ1
SJR score1.00
SNIP1.43
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
The Gabriel and Relative Neighbourhood graphs are used to select a suitable subset of prototypes for the Nearest Neighbour rule and its performance is compared to those obtained by classical techniques.
Abstract
In this paper, the Gabriel and Relative Neighbourhood graphs are used to select a suitable subset of prototypes for the Nearest Neighbour rule. Experiments and results are reported showing the effectiveness of the method and comparing its performance to those obtained by classical techniques.
Keywords
Computer Science
IEEE Transactions on Systems Man and CyberneticsAsymptotic Properties of Nearest Neighbor Rules Using Edited Data
2,050 Citations1972Dennis L. Wilson
The convergence properties of a nearest neighbor rule that uses an editing procedure to reduce the number of preclassified samples and to improve the performance of the rule are developed.
Pattern Recognition LettersEditing for the k-nearest neighbors rule by a genetic algorithm
170 Citations1995Ludmila I. Kuncheva
A genetic algorithm is applied for selecting a reference set for the k-Nearest Neighbors rule and the results are commented together with those obtained with the standard k-NN, random selection, Wilson's technique, and the MULTIEDIT algorithm.
Pattern Recognition LettersOn the use of neighbourhood-based non-parametric classifiers
99 Citations1997J. Salvador Sánchez, Filiberto Pla +1 more
Alternative non-parametric classification schemes, which come from the use of different definitions of neighbourhood, are introduced and the Nearest Centroid Neighbourhood along with the neighbourhood relation derived from the Gabriel Graph and the Relative Neighbourhip Graph are used to define corresponding (k-)Nearest Neighbour-like classifiers.
Pattern RecognitionRelative sensitivity of a family of closest-point graphs in computer vision applications
55 Citations1991Mihran Tüceryan, Terrence Chorzempa
This paper studies the properties of a set of four related closest-point graphs using Monte Carlo methods and finds Delaunay triangulation to be the least sensitive to such noisy conditions.
Computers and Electronics in AgricultureColour segmentation based on a light reflection model to locate citrus fruits for robotic harvesting
31 Citations1993Filiberto Pla, F. Juste +2 more
A method based on the Dichromatic Reflection Model for the light reflected from the surface object is reported here, reaching 95% of visible fruits detected and 6% failure rate for fruit detection.