Optimal feature selection for nonlinear data using branch-and-bound in kernel space
Author(s): Ring M, Eskofier B
Publication year: 2015
Pages range: 56-62
Branch-and-bound (B&B) feature selection finds optimal feature subsets without performing an exhaustive search. However, the classification accuracy achievable with optimal B&B feature subsets is often inferior compared to the accuracy achievable with other algorithms that guarantee optimality. We argue this is due to the existing criterion functions that define the optimal feature subset but may not conceive inherent nonlinear data structures. Therefore, we propose B&B feature selection in Reproducing Kernel Hilbert Space (B&B-RKHS). This algorithm employs two existing criterion functions (Bhattacharyya distance, Kullback-Leibler divergence) and one new criterion function (mean class distance), however, all computed in RKHS. This enables B&B-RKHS to conceive inherent nonlinear data structures. The algorithm was experimentally compared to the popular wrapper approach that has to use an exhaustive search to guarantee optimality. The classification accuracy achieved with both methods was comparable. However, runtime of B&B-RKHS was superior using the two existing criterion functions and even completely out of reach using the new criterion function (about 60 times faster on average). Therefore, this paper proposes an efficient algorithm if feature subsets that guarantee optimality have to be selected in data sets with inherent nonlinear structures.
FAU Authors / FAU Editors How to cite
APA: Ring, M., & Eskofier, B. (2015). Optimal feature selection for nonlinear data using branch-and-bound in kernel space. Pattern Recognition Letters, 68, 56-62. https://dx.doi.org/10.1016/j.patrec.2015.08.007
MLA: Ring, Matthias, and Björn Eskofier. "Optimal feature selection for nonlinear data using branch-and-bound in kernel space." Pattern Recognition Letters 68 (2015): 56-62.