.png){kind=icon}
返回
Mutual information based multi-label feature selection via constrained convex optimization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neucom.2018.10.047.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Multi-label learning has been extensively studied in many areas such as information retrieval, bioinfor-matics, and multimedia annotation. However, multi-label datasets often have noisy, irrelevant and redundant features with high dimensionality. Accompanying with these issues, a critical challenge is known as the curse of dimensionality. As an effective data preprocessing method, feature selection has received much attention for that it can provide a way in reducing computation time, improving prediction performance and enhancing understanding of the data. Based on this, a large number of informationtheoretical-based feature selection methods are developed to solve the learning problem, i.e. multi-label classification. Unfortunately, most of existing information-theoretical-based feature selection methods are either directly transformed from single-label feature selection methods or insufficient in light of using heuristic algorithms as the search component. Motivated by this, in this paper, we propose a novel mutual-information-based feature selection method, which obtains the optimal solution via constrained convex optimization with less time. Specifically, by incorporating the label information into the feature selection process, label-correlation is taken into consideration to generate the generalized model. Finally, the experimental results on various multi-label datasets demonstrate the effectiveness and efficiency of the proposed framework. (C) 2018 Published by Elsevier B.V.
Keyword:
Multi-label learning
Feature selection
Mutual information
Label-correlation
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
2.5W
被引数:
6.5W
机构
引用论文
.png){kind=icon}
分享收藏分享收藏
查看更多内容