A Practical Generalization of Fourier-Based Learning
Abstract
This paper presents a search algorithm for finding functions that are highly correlated with an arbitrary set of data. The functions found by the search can be used to approximate the unknown function that generated the data. A special case of this approach is a method for learning Fourier representations. Empirical results demonstrate that on typical real-world problems the most highly correlated functions can be found very quickly, while combinations of these functions provide good approximations of the unknown function.
Cite
Text
Drake and Ventura. "A Practical Generalization of Fourier-Based Learning." International Conference on Machine Learning, 2005. doi:10.1145/1102351.1102375Markdown
[Drake and Ventura. "A Practical Generalization of Fourier-Based Learning." International Conference on Machine Learning, 2005.](https://mlanthology.org/icml/2005/drake2005icml-practical/) doi:10.1145/1102351.1102375BibTeX
@inproceedings{drake2005icml-practical,
title = {{A Practical Generalization of Fourier-Based Learning}},
author = {Drake, Adam and Ventura, Dan},
booktitle = {International Conference on Machine Learning},
year = {2005},
pages = {185-192},
doi = {10.1145/1102351.1102375},
url = {https://mlanthology.org/icml/2005/drake2005icml-practical/}
}