Combining Rough Set-based Relevance and Redundancy for the Ranking and Selection of Nominal Features
Author(s) -
Wojciech Froelich,
Petr Hájek
Publication year - 2020
Publication title -
procedia computer science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.334
H-Index - 76
ISSN - 1877-0509
DOI - 10.1016/j.procs.2020.09.156
Subject(s) - computer science , redundancy (engineering) , ranking (information retrieval) , data mining , relevance (law) , classifier (uml) , rough set , feature selection , artificial intelligence , machine learning , pattern recognition (psychology) , selection (genetic algorithm) , filter (signal processing) , political science , computer vision , law , operating system
In this paper, we propose a new method for features ranking and selection. Our approach is based on ranking nominal features in terms of their relevance to the assigned class and mutual redundancy with the other features. To calculate the relevance and redundancy, we propose to use a rough-set based approach. After performing the ranking, features filtering is carried out in a supervised way enabling the user to decide on the number of the retained features. The experiments revealed that thanks to our method, it is possible to filter out numerous features describing data while still maintaining satisfactory classification accuracy achieved by the classifier trained using the reduced dataset. The comparative experiments performed with the use of publicly available datasets proved the high efficiency and competitiveness of our approach.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom