SUBiNN: a stacked uni- and bivariate kNN sparse ensemble

Advances in Data Analysis and Classification, vol. 16, pp. 847–874

Abstract

Abstract Nearest Neighbor classification is an intuitive distance-based classification method. It has, however, two drawbacks: (1) it is sensitive to the number of features, and (2) it does not give information about the importance of single features or pairs of features. In stacking, a set of base-learners is combined in one overall ensemble classifier by means of a meta-learner. In this manuscript we combine univariate and bivariate nearest neighbor classifiers that are by itself easily interpretable. Furthermore, we combine these classifiers by a Lasso method that results in a sparse ensemble of nonlinear main and pairwise interaction effects. We christened the new method SUBiNN: Stacked Uni- and Bivariate Nearest Neighbors. SUBiNN overcomes the two drawbacks of simple nearest neighbor methods. In extensive simulations and using benchmark data sets, we evaluate the predictive performance of SUBiNN and compare it to other nearest neighbor ensemble methods as well as Random Forests and Support Vector Machines. Results indicate that SUBiNN often outperforms other nearest neighbor methods, that SUBiNN is well capable of identifying noise features, but that Random Forests is often, but not always, the best classifier.

Authors 2

1. Tiffany Elsten Aachen Methodology and Statistics Department Institute of Psychology, Leiden University

   Leiden University

   Affiliation as printed

   Methodology and Statistics Department, Institute of Psychology, Leiden University, PO Box 9555, 2300 RB, Leiden, The Netherlands

2. Mark de Rooij corresponding Aachen Methodology and Statistics Department Institute of Psychology, Leiden University

   Leiden University

   Affiliation as printed

   Methodology and Statistics Department, Institute of Psychology, Leiden University, PO Box 9555, 2300 RB, Leiden, The Netherlands