Semi-supervised feature selection based on fuzzy related family

被引:14
作者
Guo, Zhijun [1 ]
Shen, Yang [1 ]
Yang, Tian [1 ]
Li, Yuan-Jiang [1 ]
Deng, Yanfang [1 ]
Qian, Yuhua [2 ]
机构
[1] Hunan Normal Univ, Hunan Prov Lab Intelligent Comp & Language Informa, Changsha 410081, Hunan, Peoples R China
[2] Shanxi Univ, Inst Big Data Sci & Ind, Taiyuan 030006, Shanxi, Peoples R China
基金
中国国家自然科学基金;
关键词
Rough sets; Fuzzy sets; Feature selection; Covering rough set; Partially labeled data; Related family; ROUGH SET; ATTRIBUTE REDUCTION; INFORMATION; DEPENDENCY;
D O I
10.1016/j.ins.2023.119660
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Current machine learning algorithms encounter challenges such as missing labels and high dimensionality. Feature selection serves as an effective dimensionality reduction technique, enhancing the efficiency and accuracy of subsequent machine learning tasks by eliminating irrelevant and redundant features. Given the difficulty in obtaining fully labeled data, partially labeled data has become a crucial target for machine learning models to address. The related family is an efficient, rough set-based feature selection approach; however, it cannot be applied to semi-supervised learning tasks. Consequently, this paper introduces a semi-supervised feature selection method based on a fuzzy related family for partially labeled data. At first, the fuzzy label values of unlabeled samples are calculated based on fuzzy similarity relationships by establishing a novel fuzzy covering system. Subsequently, a fuzzy related family is constructed by a consistent fuzzy set. Then a semi-supervised feature selection algorithm, referred to as the Semi-supervised Fuzzy Related Family (SFRF), is developed using the established feature significance measurement. Compared to existing semi-supervised feature selection algorithms, SFRF considerably enhances feature selection efficiency while preserving classification accuracy. Specifically, the average reduction efficiency across twelve datasets increased by up to 109 times.
引用
收藏
页数:15
相关论文
共 45 条
[1]   Robust fuzzy rough approximations with kNN granules for semi-supervised feature selection [J].
An, Shuang ;
Zhang, Mengru ;
Wang, Changzhong ;
Ding, Weiping .
FUZZY SETS AND SYSTEMS, 2023, 461
[2]   Rough-set Based Genetic Algorithms for Weakly Supervised Feature Selection [J].
Campagner, Andrea ;
Ciucci, Davide .
INFORMATION PROCESSING AND MANAGEMENT OF UNCERTAINTY IN KNOWLEDGE-BASED SYSTEMS, IPMU 2022, PT II, 2022, 1602 :761-773
[3]   Belief functions and rough sets: Survey and new insights [J].
Campagner, Andrea ;
Ciucci, Davide ;
Denoeux, Thierry .
INTERNATIONAL JOURNAL OF APPROXIMATE REASONING, 2022, 143 :192-215
[4]   Rough set-based feature selection for weakly labeled data [J].
Campagner, Andrea ;
Ciucci, Davide ;
Huellermeier, Eyke .
INTERNATIONAL JOURNAL OF APPROXIMATE REASONING, 2021, 136 :150-167
[5]   Maximal-Discernibility-Pair-Based Approach to Attribute Reduction in Fuzzy Rough Sets [J].
Dai, Jianhua ;
Hu, Hu ;
Wu, Wei-Zhi ;
Qian, Yuhua ;
Huang, Debiao .
IEEE TRANSACTIONS ON FUZZY SYSTEMS, 2018, 26 (04) :2174-2187
[6]   Attribute Selection for Partially Labeled Categorical Data By Rough Set Approach [J].
Dai, Jianhua ;
Hu, Qinghua ;
Zhang, Jinghong ;
Hu, Hu ;
Zheng, Nenggan .
IEEE TRANSACTIONS ON CYBERNETICS, 2017, 47 (09) :2460-2471
[7]   ROUGH FUZZY-SETS AND FUZZY ROUGH SETS [J].
DUBOIS, D ;
PRADE, H .
INTERNATIONAL JOURNAL OF GENERAL SYSTEMS, 1990, 17 (2-3) :191-209
[8]   The reduction and fusion of fuzzy covering systems based on the evidence theory [J].
Feng, Tao ;
Zhang, Shao-Pu ;
Mi, Ju-Sheng .
INTERNATIONAL JOURNAL OF APPROXIMATE REASONING, 2012, 53 (01) :87-103
[9]   Large-Scale Multimodality Attribute Reduction With Multi-Kernel Fuzzy Rough Sets [J].
Hu, Qinghua ;
Zhang, Lingjun ;
Zhou, Yucan ;
Pedrycz, Witold .
IEEE TRANSACTIONS ON FUZZY SYSTEMS, 2018, 26 (01) :226-238
[10]   Noise-Tolerant Fuzzy-β-Covering-Based Multigranulation Rough Sets and Feature Subset Selection [J].
Huang, Zhehuang ;
Li, Jinjin ;
Qian, Yuhua .
IEEE TRANSACTIONS ON FUZZY SYSTEMS, 2022, 30 (07) :2721-2735