Online feature selection for hierarchical classification learning based on improved ReliefF

In hierarchical classification learning, the feature space of data has high dimensionality and is unknown with emergent features. To solve the above problems, we propose an online hierarchical feature selection algorithm based on adaptive ReliefF. Firstly, ReliefF is adaptively improved via using th...

Full description

Saved in:
Bibliographic Details
Published in:Concurrency and computation 2023-12, Vol.35 (27)
Main Authors: Wang, Chenxi, Ren, Mengli, E, Chen, Guo, Lei, Yu, Xiehua, Lin, Yaojin, Li, Shaozi
Format: Article
Language:English
Subjects:
Adaptive algorithms
Classification
Correlation analysis
Learning
Redundancy
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In hierarchical classification learning, the feature space of data has high dimensionality and is unknown with emergent features. To solve the above problems, we propose an online hierarchical feature selection algorithm based on adaptive ReliefF. Firstly, ReliefF is adaptively improved via using the density information of instances around the target sample, making it unnecessary to prespecify parameters. Secondly, the hierarchical relationship between classes is used, and a new method for calculating the feature weight of hierarchical data is defined. Then, an online correlation analysis method based on feature interaction is designed. Finally, the adaptive ReliefF algorithm is improved based on feature redundancy, and the feature weight is scaled by the correlation between features in order to achieve the dynamic updating of feature redundancy. A large number of experiments verify the effectiveness of the proposed algorithm.
ISSN:1532-0626
1532-0634
DOI:10.1002/cpe.7844