Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

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

From MaRDI portal
Publication:1244052
Jump to:navigation, search

DOI10.1016/0031-3203(78)90047-XzbMath0372.68024OpenAlexW2024413472MaRDI QIDQ1244052

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



Mathematics Subject Classification ID

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


Related Items (2)

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



Cites Work

  • An efficient algorithm for determining the convex hull of a finite planar set
  • Linear and Nonlinear Separation of Patterns by Linear Programming
  • Nearest neighbor pattern classification
  • Multisurface method of pattern separation
  • Linear and Nonlinear Methods in Pattern Classification
  • A Recognition Method Using Neighbor Dependence
  • Unnamed Item
  • Unnamed Item


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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1244052&oldid=13332243"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 09:30.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki