VARIABLE COSTS-BASED MULTI-GRANULARITY FEATURE SELECTION WITH TEST COST CONSTRAINT

被引:1
作者
Liao, Shujiao [1 ]
Lin, Yidong [1 ,2 ]
机构
[1] Minnan Normal Univ, Sch Math & Stat, 36 Xianqianzhi St, Zhangzhou 363000, Peoples R China
[2] Xiamen Univ, Sch Math Sci, 422 Siming South Rd, Xiamen 361005, Peoples R China
来源
INTERNATIONAL JOURNAL OF INNOVATIVE COMPUTING INFORMATION AND CONTROL | 2020年 / 16卷 / 06期
基金
中国国家自然科学基金;
关键词
Feature-granularity selection; Multi-granularity; Neighborhood rough set; Test cost constraint; Variable costs; SENSITIVE ATTRIBUTE REDUCTION; ROUGH SET; NEIGHBORHOOD; INFORMATION;
D O I
10.24507/ijicic.16.06.2047
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In recent years, some researchers have studied the cost-sensitive feature selection problem based on the rough set theory. Especially, in view of the variability of test costs and misclassification costs as well as the diversity of feature-value granularities between different features, recently an effective cost-sensitive multi-granularity feature selection approach has been proposed. Nevertheless, the approach does not consider the case where a test cost constraint occurs because of limited resources. To tackle this problem, in this paper a variable costs-based multi-granularity feature selection approach is presented in consideration of test cost constraint. First, based on the theoretic framework called confidence-level-vector-based neighborhood rough set, the test cost-constrained multi-granularity feature selection problem is formally defined. Then a heuristic feature-granularity selection algorithm is designed, by which desirable features and their respective feature-value granularities can be simultaneously selected to minimize the total cost consumed in the test cost-constrained situation. Detailed experiments undertaken on six UCI (University of California - Irvine) datasets validate the effectiveness of the algorithm.
引用
收藏
页码:2047 / 2061
页数:15
相关论文
共 25 条
[1]  
Ahmad Tohari, 2019, ICIC Express Letters, V13, P93, DOI 10.24507/icicel.13.02.93
[2]   Neighbor Inconsistent Pair Selection for Attribute Reduction by Rough Set Approach [J].
Dai, Jianhua ;
Hu, Qinghua ;
Hu, Hu ;
Huang, Debiao .
IEEE TRANSACTIONS ON FUZZY SYSTEMS, 2018, 26 (02) :937-950
[3]   A PSO algorithm for multi-objective cost-sensitive attribute reduction on numeric data with error ranges [J].
Fang, Yu ;
Liu, Zhong-Hui ;
Min, Fan .
SOFT COMPUTING, 2017, 21 (23) :7173-7189
[4]  
Fisher R.A., 1922, Philosophical Transactions of the Royal Society A, V222, P309, DOI [10.1098/rsta.1922.0009, DOI 10.1098/RSTA.1922.0009]
[5]   High dimensional data classification and feature selection using support vector machines [J].
Ghaddar, Bissan ;
Naoum-Sawaya, Joe .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2018, 265 (03) :993-1004
[6]   Cost-Sensitive Learning of Deep Feature Representations From Imbalanced Data [J].
Khan, Salman H. ;
Hayat, Munawar ;
Bennamoun, Mohammed ;
Sohel, Ferdous A. ;
Togneri, Roberto .
IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS, 2018, 29 (08) :3573-3587
[7]   Update of approximations in composite information systems [J].
Li, Shaoyong ;
Li, Tianrui ;
Hu, Jie .
KNOWLEDGE-BASED SYSTEMS, 2015, 83 :138-148
[8]   Feature-granularity selection with variable costs for hybrid data [J].
Liao, Shujiao ;
Zhu, Qingxin ;
Qian, Yuhua .
SOFT COMPUTING, 2019, 23 (24) :13105-13126
[9]  
[廖淑娇 Liao Shujiao], 2018, [计算机工程与科学, Computer Engineering and Science], V40, P1468
[10]   Multi-granularity feature selection on cost-sensitive data with measurement errors and variable costs [J].
Liao, Shujiao ;
Zhu, Qingxin ;
Qian, Yuhua ;
Lin, Guoping .
KNOWLEDGE-BASED SYSTEMS, 2018, 158 :25-42