Publicação
Exact and heuristic algorithms for variable selection: Extended Leaps and Bounds
Ver documento
open_in_new
Detalhes bibliográficos
| Resumo: | An implementation of enhanced versions of the classical Leaps and Bounds algorithm for variable selection is provided. Features of this implementation include: (i) The availability of general routines capable of handling many different statistical methodologies and comparison criteria. (ii) Routines designed for exact and heuristic searches. (iii) The possibility of dealing with problems with more variables than observations. The implementation is supplied in two different ways: i) as a C++ library with abstract classes that can be specialized to different problems and criteria. ii) as a console application ready to be applied to searches according to some of the most important comparison criteria proposed to date. The code of the C++ library and console application described here, can be freely obtained by sending an email to the author |
|---|
| Autores principais: | Silva, A. Pedro Duarte |
|---|
| Assunto: | Variable Selection Algorithms All-Subsets Heuristics |
|---|
| Ano: | 2009 |
|---|
| País: | Portugal |
|---|
| Tipo de documento: | working paper |
|---|
| Tipo de acesso: | acesso aberto |
|---|
| Instituição associada: | Universidade Católica Portuguesa |
|---|
| Idioma: | inglês |
|---|
| Origem: | Veritati - Repositório Institucional da Universidade Católica Portuguesa |
|---|