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

被引:31
作者
Pan, Yanzhou [1 ]
Xu, Weihua [1 ]
Ran, Qinwen [1 ]
机构
[1] Southwest Univ, Coll Artificial Intelligence, Chongqing 400715, Peoples R China
基金
中国国家自然科学基金;
关键词
Dynamic ordered data; Feature selection; Incremental learning; Weighted dominance-based neighborhood rough sets; MULTIDIMENSIONAL VARIATION; ATTRIBUTE REDUCTION; APPROXIMATION; MACHINE; CLASSIFICATION;
D O I
10.1007/s13042-022-01695-4
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
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
页数:17
相关论文
共 42 条
[1]   An enhanced XCS rule discovery module using feature ranking [J].
Abedini, Mani ;
Kirley, Michael .
INTERNATIONAL JOURNAL OF MACHINE LEARNING AND CYBERNETICS, 2013, 4 (03) :173-187
[2]   Soft dominance based rough sets with applications in information systems [J].
Ali, Abbas ;
Ali, Muhammad Irfan ;
Rehman, Noor .
INTERNATIONAL JOURNAL OF APPROXIMATE REASONING, 2019, 113 :171-195
[3]  
Ali W, 2017, INT J ADV COMPUT SC, V8, P72
[4]  
[Anonymous], 1948, Bell System Technical Journal, DOI DOI 10.1002/J.1538-7305.1948.TB01338.X
[5]  
[Anonymous], 2016, INFORM SCIENTIST
[6]   Hierarchically penalized support vector machine with grouped variables [J].
Bang, Sungwan ;
Kang, Jongkyeong ;
Jhun, Myoungshic ;
Kim, Eunkyung .
INTERNATIONAL JOURNAL OF MACHINE LEARNING AND CYBERNETICS, 2017, 8 (04) :1211-1221
[7]   Incremental mechanism of attribute reduction based on discernible relations for dynamically increasing attribute [J].
Chen, Degang ;
Dong, Lianjie ;
Mi, Jusheng .
SOFT COMPUTING, 2020, 24 (01) :321-332
[8]   Parallel attribute reduction in dominance-based neighborhood rough set [J].
Chen, Hongmei ;
Li, Tianrui ;
Cai, Yong ;
Luo, Chuan ;
Fujita, Hamido .
INFORMATION SCIENCES, 2016, 373 :351-368
[9]   Dominance-Based Neighborhood Rough Sets and Its Attribute Reduction [J].
Chen, Hongmei ;
Li, Tianrui ;
Luo, Chuan ;
Hu, Jie .
ROUGH SETS AND KNOWLEDGE TECHNOLOGY, RSKT 2015, 2015, 9436 :89-99
[10]   Incremental attribute reduction with rough set for dynamic datasets with simultaneously increasing samples and attributes [J].
Dong, Lianjie ;
Chen, Degang .
INTERNATIONAL JOURNAL OF MACHINE LEARNING AND CYBERNETICS, 2020, 11 (06) :1339-1355