Nearest-neighbour ensembles in lasso feature subspaces - Archive ouverte HAL Access content directly
Journal Articles IET Computer Vision Year : 2010

Nearest-neighbour ensembles in lasso feature subspaces

(1) , (1) , (1)
1

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 study, the authors propose a robust classification algorithm that makes use of an ensemble of classifiers in lasso feature subspaces. The algorithm consists of two stages: the first is a lasso-based multiple feature subsets selection cycle, which tries to find a number of relevant and diverse feature subspaces; the second is an ensemble-based decision system that intends to preserve the classification performance in case of abrupt changes in the representation space. Experimental results on the two-class textured image segmentation problem prove the effectiveness of the proposed classification method.
Not file

Dates and versions

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

Identifiers

Cite

Xiyan He, Pierre Beauseroy, André Smolarz. Nearest-neighbour ensembles in lasso feature subspaces. IET Computer Vision, 2010, 4 (4), pp.306. ⟨10.1049/iet-cvi.2009.0056⟩. ⟨hal-02353673⟩
9 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More