Location of Repository

A high performance k-NN approach using binary neural networks

By V J Hodge, K J Lees and J L Austin


This paper evaluates a novel k-nearest neighbour (k-NN) classifier built from binary neural networks. The binary neural approach uses robust encoding to map standard ordinal, categorical and numeric data sets onto a binary neural network. The binary neural network uses high speed pattern matching to recall a candidate set of matching records, which are then processed by a conventional k-NN approach to determine the k-best matches. We compare various configurations of the binary approach to a conventional approach for memory overheads, training speed, retrieval speed and retrieval accuracy. We demonstrate the superior performance with respect to speed and memory requirements of the binary approach compared to the standard approach and we pinpoint the optimal configurations. (C) 2003 Elsevier Ltd. All rights reserved

Year: 2004
DOI identifier: 10.1016/j.neunet.2003.11.008
OAI identifier: oai:eprints.whiterose.ac.uk:768

Suggested articles


To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.