Cost-Sensitive Feature Reduction Applied to a Hybrid Genetic Algorithm
Abstract
This study is concerned with whether it is possible to detect what information contained in the training data and background knowledge is relevant for solving the learning problem, and whether irrelevant information can be eliminated in preprocessing before starting the learning process. A case study of data preprocessing for a hybrid genetic algorithm shows that the elimination of irrelevant features can substantially improve the efficiency of learning. In addition, cost-sensitive feature elimination can be effective for reducing costs of induced hypotheses.
Cite
Text
Lavrac et al. "Cost-Sensitive Feature Reduction Applied to a Hybrid Genetic Algorithm." International Conference on Algorithmic Learning Theory, 1996. doi:10.1007/3-540-61863-5_40Markdown
[Lavrac et al. "Cost-Sensitive Feature Reduction Applied to a Hybrid Genetic Algorithm." International Conference on Algorithmic Learning Theory, 1996.](https://mlanthology.org/alt/1996/lavrac1996alt-costsensitive/) doi:10.1007/3-540-61863-5_40BibTeX
@inproceedings{lavrac1996alt-costsensitive,
title = {{Cost-Sensitive Feature Reduction Applied to a Hybrid Genetic Algorithm}},
author = {Lavrac, Nada and Gamberger, Dragan and Turney, Peter D.},
booktitle = {International Conference on Algorithmic Learning Theory},
year = {1996},
pages = {127-134},
doi = {10.1007/3-540-61863-5_40},
url = {https://mlanthology.org/alt/1996/lavrac1996alt-costsensitive/}
}