Robust Flexible Feature Selection via Exclusive L21 Regularization
Abstract
Recently, exclusive lasso has demonstrated its promising results in selecting discriminative features for each class. The sparsity is enforced on each feature across all the classes via L12-norm. However, the exclusive sparsity of L12-norm could not screen out a large amount of irrelevant and redundant noise features in high-dimensional data space, since each feature belongs to at least one class. Thus, in this paper, we introduce a novel regularization called "exclusive L21", which is short for "L21 with exclusive lasso", towards robust flexible feature selection. The exclusive L21 regularization is the mix of L21-norm and L12-norm, which brings out joint sparsity at inter-group level and exclusive sparsity at intra-group level simultaneously. An efficient augmented Lagrange multipliers based optimization algorithm is proposed to iteratively solve the exclusive L21 regularization in a row-wise fashion. Extensive experiments on twelve benchmark datasets demonstrate the effectiveness of the proposed regularization and the optimization algorithm as compared to state-of-the-arts.
Cite
Text
Ming and Ding. "Robust Flexible Feature Selection via Exclusive L21 Regularization." International Joint Conference on Artificial Intelligence, 2019. doi:10.24963/IJCAI.2019/438Markdown
[Ming and Ding. "Robust Flexible Feature Selection via Exclusive L21 Regularization." International Joint Conference on Artificial Intelligence, 2019.](https://mlanthology.org/ijcai/2019/ming2019ijcai-robust/) doi:10.24963/IJCAI.2019/438BibTeX
@inproceedings{ming2019ijcai-robust,
title = {{Robust Flexible Feature Selection via Exclusive L21 Regularization}},
author = {Ming, Di and Ding, Chris},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2019},
pages = {3158-3164},
doi = {10.24963/IJCAI.2019/438},
url = {https://mlanthology.org/ijcai/2019/ming2019ijcai-robust/}
}