|Table of Contents|

Generalized cost-sensitive approximate attributereduction based on three-way decisions(PDF)


Research Field:
Publishing date:


Generalized cost-sensitive approximate attributereduction based on three-way decisions
Fang Yu1Gao Lei1Liu Zhonghui1Yang Xin2
1.School of Computer Science,Southwest Petroleum University,Chengdu 610500,China; 2. School of Economic Information Engineering,Southwestern University of Finance andEconomics,Chengdu 611130,China
attribute reduction cost-sensitive learning(in)discernibility granular computing three-way decisions
In the research spectrum of rough sets,the primary task of attribute reduction is to obtain a minimum subset of attribute set while maintaining the relevant features of the original data. The goal of cost-sensitive learning is to minimize the various costs. The significance of approximate attribute reduction is to enable decision makers to leverage the cost tolerance and the grade of knowledge discovery. This paper proposes a cost-sensitive approximate attribute reduction problem with both qualitative and quantitative criteria. The qualitative criteria refers to(in)discernibility,and the quantitative criteria refers to approximate parameters ε and costs. Based on the three-way decisions and discernible matrix,this paper portrays a framework to solve the problem of cost-sensitive approximate attribute reduction. First,we define the quality function of attribute set which explains the multi-granularity structure. Second,we propose a‘cost-performance index’fitness function to evaluate the importance of attribute,then the proposed fitness function and (α,β) thresholds pair with three-way decisions are applied to tri-partition the attribute sets. Finally,we design the two algorithms(deletion-based and addition-based)to tackle the reduction problem. The validity of the algorithms is verified by the experimental result analysis,which proves that our framework has broader adaptability and applicability.


[1] Pawlak Z. Rough Sets:Theoretical aspects of reasoning about data[M]. Part of the Theory and Decision Library Book Series:Netherlands:Springer Science & Business Media,2012:33-44.
[2]Skowron A,Rauszer C. The discernibility matrices and functions in information systems[M]. Sowiński R.(eds)Intelligent Decision Support. Theory and Decision Library(Series D:System Theory,Knowledge Engineering and Problem Solving),vol 11. Dordrecht:Springer,1992:331-362.
[3]Dai Jianhua,Hu Hu,Wu Weizhi,et al. Maximal discernibility pairs based approach to attribute reduction in fuzzy rough sets[J]. IEEE Transactions on Fuzzy Systems,2018,26(4):2174-2187.
[4]Miao Duoqian,Zhao Yan,Yao Yiyu,et al. Relative reducts in consistent and inconsistent decision tables of the Pawlak rough set model[J]. Information Sciences,2009,179(24):4140-4150.
[5]Min Fan,He Huaping,Qian Yuhua,et al. Test-cost-sensitive attribute reduction[J]. Information Sciences,2011,181(22):4928-4942.
[6]Fang Yu,Min Fan. Cost-sensitive approximate attribute reduction with three-way decisions[J]. International Journal of Approximate Reasoning,2019,104:148-165.
[7]Yao Yiyu,Wong S K M. A decision theoretic framework for approximating concepts[J]. International Journal of Man-Machine Studies,1992,37(6):793-809.
[8]王宇,杨志荣,杨习贝,决策粗糙集属性约简:一种局部视角方法[J]. 南京理工大学学报,2003,27(5):630-635.
Wang Yu,Yang Zhirong,Yang Xibei. Local attribute reduction approach based on decision-theoretic rough set[J]. Journal of Nanjing University of Science and Technology,2003,27(5):630-635.
[9]Ziarko W. Probabilistic approach to rough sets[J]. International Journal of Approximate Reasoning,2008,49(2):272-284.
[10]Ziarko W. Variable precision rough set model[J]. Journal of Computer and System Sciences,1993,46(1):39-59.
[11]Zhang Benwen,Min Fan,Ciucci D. Representative-based classification through covering-based neighborhood rough sets[J]. Applied Intelligence,2015,43(4):840-854.
[12]Sl zak D. Normalized decision functions and measures for inconsistent decision tables analysis[J]. Fundamenta Informaticae,2000,44(3):291-319.
[13]方宇,闵帆,刘忠慧,等. 序贯三支决策的代价敏感分类方法[J]. 南京大学学报(自然科学),2018,54(1):148-156.
Fang Yu,Min Fan,Liu Zhonghui,et al. Sequential three-way decisions based on cost-sensitive approach to classification[J]. Journal of Nanjing University(Nature Science),2018,54(1):148-156
[14]杨新,李天瑞,刘盾,等. 基于决策粗糙集的广义序贯三支决策方法[J]. 计算机科学,2018,45(10):8-12,27.
Yang Xin,Li Tianrui,Liu Dun,et al. Generalized sequential three-way decisions approach based on decision-theoretic rough sets[J]. Computer Science,2018,45(10):8-12,27.
[15]Yao Yiyu,Zhao Yan. Attribute reduction in decision-theoretic rough set models[J]. Information Sciences,2008,178(17):3356-3373.
[16]Yao Yiyu,Zhao Yan. Discernibility matrix simplification for constructing attribute reducts[J]. Information Sciences,2009,179(7):867-882.
[17]Slzak D. Approximate reducts in decision tables[C]//IMPU-96 Information Process and Management of Uncertainty in Knowledge Based Systems(Vol.2). Granada,Spain:Springer,1996:1159-1164.
[18]Yao Yiyu. Three-way decisions and cognitive computing[J]. Cognitive Computation,2016,8(4):543-554.
[19]Fang Yu,Liu Zhonghui,Min Fan. Multi-objective cost-sensitive attribute reduction on data with error ranges[J]. International Journal of Machine Learning and Cybernetics,2016,7(5):783-793.
[20]Fang Yu,Liu Zhonghui,Min Fan. A PSO algorithm for multi-objective cost-sensitive attribute reduction on numeric data with error ranges[J]. Soft Computing,2017,21(23):7173-7189.
[21]Zhang Qinghua,Lv Gongxun,Chen Yuhong,et al. A dynamic three-way decision model based on the updating of attribute values[J]. Knowledge-Based Systems,2017,142:71-84.
[22]Li Weiwei,Jia Xiuyi,Wang Lu,et al. Multi-objective attribute reduction in three-way decision-theoretic rough set model[J]. International Journal of Approximate Reasoning,2019,105:327-341.
[23]张明,徐妍,陈韬,等. 基于核酸物化属性显著性约简的m6A位点识别[J]. 南京理工大学学报,2019,43(2):199-208.
Zhang Ming,Xu Yan,Chen Tao,et al. Identification of m6A site based on reduction of nucleotide physical-chemical properties significance[J]. Journal of Nanjing University of Science and Technology,2019,43(2):199-208.


Last Update: 2019-09-30