Scalable Feature Selection for Multi-Class Problems
Abstract
Scalable feature selection algorithms should remove irrelevant and redundant features and scale well on very large datasets. We identify that the currently best state-of-art methods perform well on binary classification tasks but often underperform on multi-class tasks. We suggest that they suffer from the so-called accumulative effect which becomes more visible with the growing number of classes and results in removing relevant and unredundant features. To remedy the problem, we propose two new feature filtering methods which are both scalable and well adapted for the multi-class cases. We report the evaluation results on 17 different datasets which include both binary and multi-class cases.
Cite
Text
Chidlovskii and Lecerf. "Scalable Feature Selection for Multi-Class Problems." European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, 2008. doi:10.1007/978-3-540-87479-9_33Markdown
[Chidlovskii and Lecerf. "Scalable Feature Selection for Multi-Class Problems." European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, 2008.](https://mlanthology.org/ecmlpkdd/2008/chidlovskii2008ecmlpkdd-scalable/) doi:10.1007/978-3-540-87479-9_33BibTeX
@inproceedings{chidlovskii2008ecmlpkdd-scalable,
title = {{Scalable Feature Selection for Multi-Class Problems}},
author = {Chidlovskii, Boris and Lecerf, Loïc},
booktitle = {European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases},
year = {2008},
pages = {227-240},
doi = {10.1007/978-3-540-87479-9_33},
url = {https://mlanthology.org/ecmlpkdd/2008/chidlovskii2008ecmlpkdd-scalable/}
}