ACCELERATION METHOD FOR ATTRIBUTE REDUCTION BASED ON THREE-WAY DECISIONS

被引:0
作者
Guo, Doudou [1 ]
Jiang, Chunmao [1 ]
Liu, Anpeng [1 ]
He, Guanqi [2 ]
机构
[1] Harbin Normal Univ, Dept Comp Sci & Informat Engineer, Harbin, Peoples R China
[2] Shanghai Univ Sci & Technol, Shanghai, Peoples R China
来源
UNIVERSITY POLITEHNICA OF BUCHAREST SCIENTIFIC BULLETIN SERIES C-ELECTRICAL ENGINEERING AND COMPUTER SCIENCE | 2021年 / 83卷 / 01期
关键词
attribute reduction; neighborhood rough set; sequential decision; significance; three-way decisions;
D O I
暂无
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Attribution reduction is one of the key topics in the field of rough set theory. There is a redundant calculation in the traditional reduction resulting in lots of time consumption. To solve this problem, an acceleration method for attribute reduction based on sequential three-way decisions are proposed. The specific steps are as follows: 1) calculate the significance of the attribute in the decision system; 2) the attributes will be divided into three domains in terms of the significance of the corresponding attribute. And the attribute with maximal significance will be classified into the positive domain. The attributes whose significance value equal zero will be classified into the negative domain and other attributes will be classified into the boundary domain; 3) calculate the significance of the attributes in the boundary domain cyclically and divide the obtained result, until the set of attributes in the positive domain intended constraints is satisfied. In this research, 6 UCI data sets are selected to conduct experiments in the global and local reduction environments, respectively. The experimental results show that the proposed method can effectively reduce the time consumption of searching reduct in such two environments and will not contribute to a poor classification performance.
引用
收藏
页码:77 / 90
页数:14
相关论文
共 23 条
[1]   Enhanced cultural algorithm to solve multi-objective attribute reduction based on rough set theory [J].
Abdolrazzagh-Nezhad, Majid .
MATHEMATICS AND COMPUTERS IN SIMULATION, 2020, 170 :332-350
[2]   LIBSVM: A Library for Support Vector Machines [J].
Chang, Chih-Chung ;
Lin, Chih-Jen .
ACM TRANSACTIONS ON INTELLIGENT SYSTEMS AND TECHNOLOGY, 2011, 2 (03)
[3]  
Chen Manru, 2019, Journal of Computer Applications, V39, P3426, DOI 10.11772/j.issn.1001-9081.2019049238
[4]   Approximate statistical tests for comparing supervised classification learning algorithms [J].
Dietterich, TG .
NEURAL COMPUTATION, 1998, 10 (07) :1895-1923
[5]  
Fan H. T., 2018, J ZHENGZHOU U NAT SC, V50, P39
[6]   Neighborhood classifiers [J].
Hu, Qinghua ;
Yu, Daren ;
Me, Zongxia .
EXPERT SYSTEMS WITH APPLICATIONS, 2008, 34 (02) :866-876
[7]   Accelerator for multi-granularity attribute reduction [J].
Jiang, Zehua ;
Yang, Xibei ;
Yu, Hualong ;
Liu, Dun ;
Wang, Pingxin ;
Qian, Yuhua .
KNOWLEDGE-BASED SYSTEMS, 2019, 177 :145-158
[8]   Cost-sensitive rough set: A multi-granulation approach [J].
Ju, Hengrong ;
Li, Huaxiong ;
Yang, Xibei ;
Zhou, Xianzhong ;
Huang, Bing .
KNOWLEDGE-BASED SYSTEMS, 2017, 123 :137-153
[9]  
Liu Dun, 2019, CAAI Transactions on Intelligent Systems, V14, P1111, DOI 10.11992/tis.201905039
[10]  
Liu Hai-tao, 2016, Journal of Chinese Computer Systems, V37, P375