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

Efficient prototype reordering in nearest neighbor classification

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

DOI10.1016/S0031-3203(01)00234-5zbMath1007.68933WikidataQ61941610 ScholiaQ61941610MaRDI QIDQ1856702

Ujjwal Maulik, Sanghamitra Bandyopadhyay

Publication date: 11 February 2003

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


zbMATH Keywords

pattern recognitionsupervised classificationneighborhood computationNN rule


Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Computing methodologies and applications (68U99)


Related Items (1)

An efficient technique for superfamily classification of amino acid sequences: feature extraction, fuzzy clustering and prototype selection




Cites Work

  • A Branch and Bound Algorithm for Computing k-Nearest Neighbors
  • An Algorithm for Finding Nearest Neighbors
  • A Technique to Identify Nearest Neighbors
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item




This page was built for publication: Efficient prototype reordering in nearest neighbor classification

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