Greedy Feature Construction
Abstract
We present an effective method for supervised feature construction. The main goal of the approach is to construct a feature representation for which a set of linear hypotheses is of sufficient capacity -- large enough to contain a satisfactory solution to the considered problem and small enough to allow good generalization from a small number of training examples. We achieve this goal with a greedy procedure that constructs features by empirically fitting squared error residuals. The proposed constructive procedure is consistent and can output a rich set of features. The effectiveness of the approach is evaluated empirically by fitting a linear ridge regression model in the constructed feature space and our empirical results indicate a superior performance of our approach over competing methods.
Cite
Text
Oglic and Gärtner. "Greedy Feature Construction." Neural Information Processing Systems, 2016.Markdown
[Oglic and Gärtner. "Greedy Feature Construction." Neural Information Processing Systems, 2016.](https://mlanthology.org/neurips/2016/oglic2016neurips-greedy/)BibTeX
@inproceedings{oglic2016neurips-greedy,
title = {{Greedy Feature Construction}},
author = {Oglic, Dino and Gärtner, Thomas},
booktitle = {Neural Information Processing Systems},
year = {2016},
pages = {3945-3953},
url = {https://mlanthology.org/neurips/2016/oglic2016neurips-greedy/}
}