Maximum relevance minimum redundancy-based feature selection using rough mutual information in adaptive neighborhood rough sets

Kanglin Qu; Jiucheng Xu; Ziqin Han; Shihui Xu

doi:10.1007/s10489-022-04398-z

ScienceGate Book Chapters

JOURNAL ARTICLE

Maximum relevance minimum redundancy-based feature selection using rough mutual information in adaptive neighborhood rough sets

Kanglin Qu Jiucheng Xu Ziqin Han Shihui Xu

Year: 2023 Journal: Applied Intelligence Vol: 53 (14)Pages: 17727-17746 Publisher: Springer Science+Business Media

DOI: 10.1007/s10489-022-04398-z

Get Full-Text PDF Get Analytical Report

Keywords:

Mutual information Computer science Feature selection Relevance (law) Redundancy (engineering) Rough set Data mining Pattern recognition (psychology) Feature (linguistics) Algorithm Artificial intelligence

Metrics

Cited By

5.56

FWCI (Field Weighted Citation Impact)

Refs

0.94

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Rough Sets and Fuzzy Logic

Physical Sciences → Computer Science → Computational Theory and Mathematics

Data Mining Algorithms and Applications

Physical Sciences → Computer Science → Information Systems

Maximum relevance minimum redundancy-based feature selection using rough mutual information in adaptive neighborhood rough sets

Metrics

Citation History

Topics

Related Documents

Multilabel Feature Selection Using Relief and Minimum Redundancy Maximum Relevance Based on Neighborhood Rough Sets

Feature Selection With Missing Labels Using Multilabel Fuzzy Neighborhood Rough Sets and Maximum Relevance Minimum Redundancy

Maximum relevance, minimum redundancy band selection based on neighborhood rough set for hyperspectral data classification

Feature subset selection wrapper based on mutual information and rough sets

An Improved Maximum Relevance and Minimum Redundancy Feature Selection Algorithm Based on Normalized Mutual Information