Function (biology)

Algorithm

Linguistics

Philosophy

Biology

Construct (python library)

Selection (genetic algorithm)

Set (abstract data type)

Data mining

Computer science

Mathematical optimization

Greedy algorithm

Evolutionary biology

Pattern recognition (psychology)

Mathematics

Feature selection

Feature (linguistics)

Artificial intelligence

Measure (data warehouse)

Programming language

Dependency (UML)

Mutual information

Class (philosophy)

Rough set

IEEE Transactions on Cybernetics

The concept of dependency in a neighborhood rough set model is an important evaluation function for the feature selection. This function considers only the classification information contained in the lower approximation of the decision while ignoring the upper approximation. In this paper, we construct a class of uncertainty measures: decision self-information for the feature selection. These measures take into account the uncertainty information in the lower and the upper approximations. The relationships between these measures and their properties are discussed in detail. It is proven that the fourth measure, called relative neighborhood self-information, is better for feature selection than the other measures, because not only does it consider both the lower and the upper approximations but also the change of its magnitude is largest with the variation of feature subsets. This helps to facilitate the selection of optimal feature subsets. Finally, a greedy algorithm for feature selection has been designed and a series of numerical experiments was carried out to verify the effectiveness of the proposed algorithm. The experimental results show that the proposed algorithm often chooses fewer features and improves the classification accuracy in most cases.

Feature Selection Based on Neighborhood Self-Information