An efficient randomised sphere cover classifier

Younsi, R and Bagnall, A (2012) An efficient randomised sphere cover classifier. International Journal of Data Mining, Modelling and Management, 4 (2). p. 156. ISSN 1759-1163

[img]
Preview
PDF (Younsi12_Preprint_Version.pdf)
Download (286kB) | Preview

Abstract

This paper describes an efficient randomised sphere cover classifier(aRSC), that reduces the training data set size without loss of accuracy when compared to nearest neighbour classifiers. The motivation for developing this algorithm is the desire to have a non-deterministic, fast, instance-based classifier that performs well in isolation but is also ideal for use with ensembles. We use 24 benchmark datasets from UCI repository and six gene expression datasets for evaluation. The first set of experiments demonstrate the basic benefits of sphere covering. The second set of experiments demonstrate that when we set the a parameter through cross validation, the resulting aRSC algorithm outperforms several well known classifiers when compared using the Friedman rank sum test. Thirdly, we test the usefulness of aRSC when used with three feature filtering filters on six gene expression datasets. Finally, we highlight the benefits of pruning with a bias/variance decomposition

Item Type: Article
Faculty \ School: Faculty of Science > School of Computing Sciences
Related URLs:
Depositing User: Users 2731 not found.
Date Deposited: 12 Sep 2012 11:29
Last Modified: 24 Jul 2019 13:20
URI: https://ueaeprints.uea.ac.uk/id/eprint/39532
DOI: 10.1504/IJDMMM.2012.046808

Actions (login required)

View Item View Item