Ensemble of subset of k-nearest neighbours models for class membership probability estimation

Gul, A., Khan, Z., Perperoglou, A., Mahmoud, O. ORCID: https://orcid.org/0000-0003-0342-6704, Miftahuddin, M., Adler, W. and Lausen, B. (2016) Ensemble of subset of k-nearest neighbours models for class membership probability estimation. In: Studies in Classification, Data Analysis, and Knowledge Organization. UNSPECIFIED.

Full text not available from this repository. (Request a copy)

Abstract

Combining multiple classifiers can give substantial improvement in prediction performance of learning algorithms especially in the presence of non-informative features in the data sets. This technique can also be used for estimating class membership probabilities. We propose an ensemble of k-Nearest Neighbours (kNN) classifiers for class membership probability estimation in the presence of non-informative features in the data. This is done in two steps. Firstly, we select classifiers based upon their individual performance from a set of base kNN models, each generated on a bootstrap sample using a random feature set from the feature space of training data. Secondly, a step wise selection is used on the selected learners, and those models are added to the ensemble that maximize its predictive performance. We use bench mark data sets with some added non-informative features for the evaluation of our method. Experimental comparison of the proposed method with usual kNN, bagged kNN, random kNN and random forest shows that it leads to high predictive performance in terms of minimum Brier score on most of the data sets. The results are also verified by simulation studies.

Item Type: Book Section
Faculty \ School: Faculty of Science > School of Biological Sciences
Faculty of Medicine and Health Sciences > Norwich Medical School
Related URLs:
Depositing User: LivePure Connector
Date Deposited: 26 Oct 2026 11:00
Last Modified: 26 Oct 2026 11:00
URI: https://ueaeprints.uea.ac.uk/id/eprint/104844
DOI: 10.1007/978-3-319-25226-1_35

Actions (login required)

View Item View Item