Skip to Main content Skip to Navigation
Conference papers

Nearest neighbor ensembles in lasso feature subspaces

Abstract : 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.
Document type :
Conference papers
Complete list of metadatas

https://hal-utt.archives-ouvertes.fr/hal-02353659
Contributor : Jean-Baptiste Vu Van <>
Submitted on : Thursday, November 7, 2019 - 1:48:01 PM
Last modification on : Friday, November 8, 2019 - 1:39:49 AM

Identifiers

Collections

CNRS | ROSAS | UTT

Citation

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⟩

Share

Metrics

Record views

36