An incremental approach to feature selection using the weighted dominance-based neighborhood rough sets

被引:0
作者
Yanzhou Pan
Weihua Xu
Qinwen Ran
机构
[1] Southwest University,College of Artificial Intelligence
来源
International Journal of Machine Learning and Cybernetics | 2023年 / 14卷
关键词
Dynamic ordered data; Feature selection; Incremental learning; Weighted dominance-based neighborhood rough sets;
D O I
暂无
中图分类号
学科分类号
摘要
Dominance-based neighborhood rough set (DNRS) is capable to give qualitative and quantitative descriptions of the relations between ordered objects. In spite of its effectiveness in feature selection, DNRS ignores the various significance of features. In fact, different features exert different impacts on decision-making. Once we explore these differences in advance, it is easier to find out features with high correlation and dependency. Likewise, it is inevitable that in big-data era the objects may update from time to time, which calls for efficient attribute reduction. However, the existing approaches are inappropriate for the weighted and ordered data. Motivated by these two deficiencies, first, we assign different weights to conditional attributes and establish the weighted dominance-based neighborhood rough set (WDNRS). Then a kind of conditional entropy in matrix form and ensuing updating principles are put forward to evaluate the significance of the attributes. In addition, grounded on the entropy, we come up with the heuristic algorithm and corresponding incremental mechanism when objects increase. Finally, twelve experiments are carried out to verify that it is effective and efficient for the designed method to select features in dynamic datasets.
引用
收藏
页码:1217 / 1233
页数:16
相关论文
共 154 条
[1]  
Zhong J(2015)A feature selection method for prediction essential protein Tsinghua Sci Technol 20 491-499
[2]  
Wang J(2017)Hierarchically penalized support vector machine with grouped variables Int J Mach Learn Cyb 8 1211-1221
[3]  
Peng W(2013)An enhanced XCS rule discovery module using feature ranking Int J Mach Learn Cyb 4 173-187
[4]  
Zhang Z(2018)Feature selection for high-dimensional classification using a competitive swarm optimizer Soft Comput 22 811-822
[5]  
Li M(2021)Comparing methods of feature extraction of brain activities for octave illusion classification using machine learning Sensors 21 6407-6407
[6]  
Bang S(2017)Phishing website detection based on supervised machine learning with wrapper features selection Int J Adv Comput 8 72-1008
[7]  
Kang J(2018)Hierarchical feature selection with subtree based graph regularization Knowl-Based Syst 163 996-4410
[8]  
Jhun M(2020)Infinite feature selection: a raph-based feature filtering approach IEEE Trans Pattern Anal 43 4396-365
[9]  
Kim E(1982)Rough sets Int J Comput Inform Sci 11 341-259
[10]  
Abedini M(1998)Relational interpretations of neighborhood operators and rough set approximation operators Inform Sci 111 239-59