Hodge, Victoria Jane orcid.org/0000-0002-2469-0224 and Austin, Jim orcid.org/0000-0001-5762-8614 (2012) Discretisation of Data in a Binary Neural k-Nearest Neighbour Algorithm. UNSPECIFIED, Department of Computer Science, University of York, UK.
Abstract
This paper evaluates several methods of discretisation (binning) within a k-Nearest Neighbour predictor. Our k-NN is constructed using binary neural networks which require continuous-valued data to be discretised to allow it to be mapped to the binary neural framework. Our approach uses discretisation coupled with robust encoding to map data sets onto the binary neural network. In this paper, we compare seven unsupervised discretisation methods for retrieval accuracy (prediction accuracy) across a range of well-known prediction data sets comprising time-series data. We analyse whether there is an optimal discretisation configuration for our k-NN. The analyses demonstrate that the configuration is data specific. Hence, we recommend running evaluations of a number of configurations, varying both the discretisation methods and the number of discretisation bins, using a test data set. This evaluation will pinpoint the optimum configuration for new data sets.
Metadata
Item Type: | Other |
---|---|
Authors/Creators: |
|
Keywords: | k-Nearest Neighbour,binary neural network,discretisation,binning,quantisation |
Dates: |
|
Institution: | The University of York |
Academic Units: | The University of York > Faculty of Sciences (York) > Computer Science (York) |
Depositing User: | Pure (York) |
Date Deposited: | 23 Jun 2016 10:13 |
Last Modified: | 19 Feb 2025 00:12 |
Status: | Published |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:89484 |