Search-Based Class Discretization
Abstract
We present a methodology that enables the use of classification algorithms on regression tasks. We implement this method in system RECLA that transforms a regression problem into a classification one and then uses an existent classification system to solve this new problem. The transformation consists of mapping a continuous variable into an ordinal variable by grouping its values into an appropriate set of intervals. We use misclassification costs as a means to reflect the implicit ordering among the ordinal values of the new variable. We describe a set of alternative discretization methods and, based on our experimental results, justify the need for a search-based approach to choose the best method. Our experimental results confirm the validity of our search-based approach to class discretization, and reveal the accuracy benefits of adding misclassification costs.
Cite
Text
Torgo and Gama. "Search-Based Class Discretization." European Conference on Machine Learning, 1997. doi:10.1007/3-540-62858-4_91Markdown
[Torgo and Gama. "Search-Based Class Discretization." European Conference on Machine Learning, 1997.](https://mlanthology.org/ecmlpkdd/1997/torgo1997ecml-searchbased/) doi:10.1007/3-540-62858-4_91BibTeX
@inproceedings{torgo1997ecml-searchbased,
title = {{Search-Based Class Discretization}},
author = {Torgo, Luís and Gama, João},
booktitle = {European Conference on Machine Learning},
year = {1997},
pages = {266-273},
doi = {10.1007/3-540-62858-4_91},
url = {https://mlanthology.org/ecmlpkdd/1997/torgo1997ecml-searchbased/}
}