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
相关论文
共 50 条
  • [41] Dominance-based rough set approach to incomplete ordered information systems
    Du, Wen Sheng
    Hu, Bao Qing
    INFORMATION SCIENCES, 2016, 346 : 106 - 129
  • [42] Using Rough Sets with Heuristics for Feature Selection
    Ning Zhong
    Juzhen Dong
    Setsuo Ohsuga
    Journal of Intelligent Information Systems, 2001, 16 : 199 - 214
  • [43] Rough set Theory-Based group incremental approach to feature selection
    Zhao, Jie
    Wu, Dai-yang
    Zhou, Yong-xin
    Liang, Jia-ming
    Wei, WenHong
    Li, Yun
    INFORMATION SCIENCES, 2024, 675
  • [44] Granule-specific feature selection for continuous data classification using neighborhood rough sets
    Sewwandi, Mahawaga Arachchige Nayomi Dulanjala
    Li, Yuefeng
    Zhang, Jinglan
    EXPERT SYSTEMS WITH APPLICATIONS, 2024, 238
  • [45] Information-theoretic partially labeled heterogeneous feature selection based on neighborhood rough sets
    Zhang, Hongying
    Sun, Qianqian
    Dong, Kezhen
    INTERNATIONAL JOURNAL OF APPROXIMATE REASONING, 2023, 154 : 200 - 217
  • [46] Feature Selection for Multi-Label Learning Based on F-Neighborhood Rough Sets
    Deng, Zhixuan
    Zheng, Zhonglong
    Deng, Dayong
    Wang, Tianxiang
    He, Yiran
    Zhang, Dawei
    IEEE ACCESS, 2020, 8 : 39678 - 39688
  • [47] A new method for feature selection based on weighted k-nearest neighborhood rough set
    Wang, Ning
    Zhao, Enhui
    EXPERT SYSTEMS WITH APPLICATIONS, 2024, 238
  • [48] On fuzzy-rough sets approach to feature selection
    Bhatt, RB
    Gopal, M
    PATTERN RECOGNITION LETTERS, 2005, 26 (07) : 965 - 975
  • [49] A fuzzy rough set approach for incremental feature selection on hybrid information systems
    Zeng, Anping
    Li, Tianrui
    Liu, Dun
    Zhang, Junbo
    Chen, Hongmei
    FUZZY SETS AND SYSTEMS, 2015, 258 : 39 - 60
  • [50] Interval Dominance-Based Feature Selection for Interval-Valued Ordered Data
    Li, Wentao
    Zhou, Haoxiang
    Xu, Weihua
    Wang, Xi-Zhao
    Pedrycz, Witold
    IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS, 2023, 34 (10) : 6898 - 6912