Nearest neighbor ensembles in lasso feature subspaces - Université de technologie de Troyes Access content directly
Conference Papers Year : 2008

Nearest neighbor ensembles in lasso feature subspaces


The least absolute shrinkage and selection operator lasso is a promising feature selection technique. However, it has traditionally not been a focus of research in ensemble classification methods. In this paper, we propose an algorithm for building an ensemble of classifiers in lasso feature subspaces. The algorithm consists of two stages: the first is a lasso based feature subset selection cycle, which tries to find several discriminant feature subspaces; the second is an ensemble based decisional system that intends to preserve the classification performances in case of nonstationary perturbations. Experimental results on the two-class textured image segmentation problem assess the effectiveness of the proposed approach.
No file

Dates and versions

hal-02353659 , version 1 (07-11-2019)



Xiyan He, Pierre Beauseroy, André Smolarz. Nearest neighbor ensembles in lasso feature subspaces. 5th International Conference on Visual Information Engineering (VIE 2008), Jul 2008, Xi'an, China. pp.100-105, ⟨10.1049/cp:20080291⟩. ⟨hal-02353659⟩
11 View
0 Download



Gmail Facebook X LinkedIn More