arrow
返回

Feature selection using Decomposed Mutual Information Maximization

delete2022-11-01
delete13
delete
OA
AI
F
Francisco Macedo
R
Rui Valadas *
E
Eunice Carrasquinha
M
M. Rosário Oliveira
A
António Pacheco
DOI:10.1016/j.neucom.2022.09.101delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
Feature selection has been recognized for long as an important preprocessing technique to reduce dimen-sionality and improve the performance of regression and classification tasks. The class of sequential for-ward feature selection methods based on Mutual Information (MI) is widely used in practice, mainly due to its computational efficiency and independence from the specific classifier. A recent work introduced a theoretical framework for this class of methods which explains the existing proposals as approximations to an optimal target objective function. Such framework made clear the advantages and drawbacks of each proposal. Methods accounting for the redundancy of candidate features using a maximization func-tion and considering the so-called complementary effect are among the best ones. However, they still penalize the complementarity, which is an important drawback. This paper proposes the Decomposed Mutual Information Maximization (DMIM) method, which keeps the good theoretical properties of the best methods proposed so far but overcomes the complementarity penalization by applying the maxi-mization separately to the inter-feature and class-relevant redundancies. DMIM was extensively evalu-ated and compared with other methods, both theoretically and using two synthetic scenarios and 20 publicly available real datasets applied to specific classifiers. Our results show that DMIM achieves a bet -ter classification performance than the remaining forward feature selection methods based on MI. (c) 2022 The Author(s). Published by Elsevier B.V. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/).
Keyword:
Mutual information
Feature selection
Classification
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Neurocomputing 封面图
Neurocomputing
IF:
6.5
论文数:
2.5W
被引数:
6.5W

机构

U
universidade de lisboa
学者数:
3.4W
论文数: 3.1W
被引数: 29
I
instituto de telecomunicacoes
学者数:
808
论文数: 852
被引数: 0
引用论文

引用论文

Can high-order dependencies improve mutual information based feature selection?
err2016-05-01
err84
errOAAI
errNguyen Xuan Vinh; Zhou, Shuo; Chan, Jeffrey; Bailey, James
err分享
err收藏
SpHnf6, a transcription factor that executes multiple functions in sea urchin embryogenesis
err2004-09-01
err0
PREAI
errOchan Otim; Gabriele Amore; Takuya Minokawa; David R. McClay; Eric H. Davidson
err分享
err收藏
The Effects of Sequence and Delay on Crowd Work
err2015-04-18
err0
errOAAI
errWalter S. Lasecki; Jeffrey M. Rzeszotarski; Adam Marcus; Jeffrey P. Bigham
err分享
err收藏
A comparative analysis of speech signal processing algorithms for Parkinson's disease classification and the use of the tunable Q-factor wavelet transform
err2019-01-01
err271
PREAI
errSakar, C. Okan; Serbes, Gorkem; Gunduz, Aysegul; Tunc, Hunkar C.; Nizam, Hatice; Sakar, Betul Erdogdu; Tutuncu, Melih; Aydin, Tarkan; Isenkul, M. Erdem; Apaydin, Hulya
err分享
err收藏
Theoretical foundations of forward feature selection methods based on mutual information
err2019-01-01
err55
errOAAI
errMacedo, Francisco; Rosario Oliveira, M.; Pacheco, Antonio; Valadas, Rui
err分享
err收藏
The electroneutrality approximation in electrochemistry电化学中的电中性近似
err2011-02-22
err0
PREAI
errEdmund J. F. Dickinson; Juan G. Limon-Petersen; Richard G. Compton
err分享
err收藏
err分享
err收藏
学者 查看更多内容