A characterization of nearest-neighbor rule decision surfaces and a new approach to generate them

DOI10.1016/0031-3203(78)90047-XzbMATH Open0372.68024OpenAlexW2024413472MaRDI QIDQ1244052FDOQ1244052

Authors: K. Appert 

Publication date: 1978

Published in: Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0031-3203(78)90047-x

Recommendations

• Open problems in geometric methods for instance-based learning
• scientific article; zbMATH DE number 78497
• GEOMETRIC PROXIMITY GRAPHS FOR IMPROVING NEAREST NEIGHBOR METHODS IN INSTANCE-BASED LEARNING AND DATA MINING
• Max–min separability
• Output-sensitive algorithms for computing nearest-neighbour decision boundaries

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Pattern recognition, speech recognition (68T10) Algorithms in computer science (68W99)

Cites Work

• Nearest neighbor pattern classification
• An efficient algorithm for determining the convex hull of a finite planar set
• Linear and Nonlinear Separation of Patterns by Linear Programming
• Title not available (Why is that?)
• Multisurface method of pattern separation
• Title not available (Why is that?)
• A Recognition Method Using Neighbor Dependence
• Linear and Nonlinear Methods in Pattern Classification

Cited In (2)

• An algorithm for determining identity of nearest-neighbor and potential function decision rules
• GEOMETRIC PROXIMITY GRAPHS FOR IMPROVING NEAREST NEIGHBOR METHODS IN INSTANCE-BASED LEARNING AND DATA MINING

This page was built for publication: A characterization of nearest-neighbor rule decision surfaces and a new approach to generate them

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1244052)