.png){kind=icon}
返回
Optimization approach for feature selection in multi-label classification
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patrec.2017.02.004.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Nowadays, many data sources that include multi-label learning and multi-label classification have emerged in recent application areas. To achieve high classification accuracy, the multi-label feature selection method has received much attention because its accuracy can be significantly improved by selecting important features. In previous multi-label feature selection studies, a score function was designed based on the measure of the dependency between features and labels. However, identifying the optimal feature subset is an impractical task because all possible feature subsets are 2 N, where N is the number of total features in a given dataset. Thus, the conventional methods utilized a greedy search approach that can be stuck in local optima. To circumvent the drawback of the greedy approaches, we design a score function based on mutual information and present a numerical optimization approach to avoid being stuck in the local optima. The experimental results demonstrate the superiority of the proposed multi-label feature selection method. (C) 2017 Elsevier B.V. All rights reserved.
Keyword:
Multi-label feature selection
Numerical optimization
Mutual information
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.3
论文数:
7.9K
被引数:
1.6W
机构
引用论文
ML-KNN: A lazy learning approach to multi-label leamingMl-knn: 一种多标签学习的懒惰学习方法.png)
PATTERN RECOGNITION
OAAI
PATTERN RECOGNITIONIF7.6
OAAI分享收藏分享收藏分享收藏分享收藏
查看更多内容