An Empirical Evaluation of Supervised Learning in High Dimensions
Abstract
In this paper we perform an empirical evaluation of supervised learning methods on high dimensional data. We evaluate learning performance on three metrics: accuracy, AUC, and squared loss. We also study the effect of increasing dimensionality on the relative performance of the learning algorithms. Our findings are consistent with previous studies for problems of relatively low dimension, but suggest that as dimensionality increases the relative performance of the various learning algorithms changes. To our surprise, the methods that seem best able to learn from high dimensional data are random forests and neural nets.
Cite
Text
Caruana et al. "An Empirical Evaluation of Supervised Learning in High Dimensions." International Conference on Machine Learning, 2008. doi:10.1145/1390156.1390169Markdown
[Caruana et al. "An Empirical Evaluation of Supervised Learning in High Dimensions." International Conference on Machine Learning, 2008.](https://mlanthology.org/icml/2008/caruana2008icml-empirical/) doi:10.1145/1390156.1390169BibTeX
@inproceedings{caruana2008icml-empirical,
title = {{An Empirical Evaluation of Supervised Learning in High Dimensions}},
author = {Caruana, Rich and Karampatziakis, Nikolaos and Yessenalina, Ainur},
booktitle = {International Conference on Machine Learning},
year = {2008},
pages = {96-103},
doi = {10.1145/1390156.1390169},
url = {https://mlanthology.org/icml/2008/caruana2008icml-empirical/}
}