A. Pedro Duarte Silva () (Faculdade de Economia e Gestão - Universidade Católica Portuguesa (Porto))
Abstract
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.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
page. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
References listed on IDEAS Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.: