Computer Science ›› 2017, Vol. 44 ›› Issue (9): 67-69, 92.doi: 10.11896/j.issn.1002-137X.2017.09.013

Previous Articles     Next Articles

Attribute Reduction Based on Multicost Decision-theoretic Rough Set

YANG Zhi-rong, WANG Yu and YANG Xi-bei   

  • Online:2018-11-13 Published:2018-11-13

Abstract: Compared with classic rough set,traditional decision-theoretic rough set takes the cost into consideration,using cost matrix to generate a pair of thresholds.But decision-theoretic rough set doesn’t meet the monotonicity that has been widely used in classic rough set,which has brought a new challenge for us in the study of attribute reduction in rough set. Cost matrix in traditional decision-theoretic rough set is only one,doesn’t think about the variability of cost.The pessimistic decision rules and the optimistic rules of muticost decision-theoretic rough set are introduced at first and the thresholds which generated by multiple cost matrix are applied to attribute reduction.An heuristic Local attribute reduction method is proposed not on whole decision class but on individual decision class,which can get more positive rules from relevant experiment results in optimistic conditions than in pessimistic conditions,when it compared with the method based on the whole decision class.

Key words: Decision-theoretic rough set,Multi-cost,Three-way decision-theoretic

[1] PAWLAK Z.Rough sets [J].International Journal of Computer and Information Sciences,1982,11(5):341-356.
[2] WOJCIECH Z.Variable precision rough set model [J].Journal of Computer & System Sciences,1993,46(1):39-59.
[3] YAO Y Y.Three-way decisions with probabilistic rough sets[J].Information Sciences,2010,180(3):341-353.
[4] YAO Y Y.Probabilistic rough set approximations[J].International Journal of Approximate Reasoning,2008,49(2):255-271.
[5] YAO Y Y.Three-way decision:an interpretation of rules in roughset theory [C]∥The 4th International Conference on Rough Sets and Knowledge Technology(RSKT 2009).Gold Coast,Austra-lia,2009:14-16.
[6] DOU H L,YANG X B,SONG X N,et al.Decision-theoreticrough set:A multicost strategy[J].Knowledge-Based Systems,2016,91:71-83.
[7] ZHOU B.Multi-class decision-theoretic rough sets[J].International Journal of Approximate Reasoning,2014,55(1):211-224.
[8] LIU D,LI T R,LI H X.A multiple-category classification approach with decision-theoretic rough sets [J].Fundament Informaticae,2012,115(2/3):173-188.
[9] QIAN Y H,ZHANG H,SANG Y L,et al.Multigranulation decision-theoretic rough sets[J].International Journal of Approximate Reasoning,2014,55(1):225-237.
[10] YANG X B,QI Y S,SONG X N,et al.Test cost sensitive multigranulation rough set:Model and minimal cost selection [J].Information Sciences,2013,250(11):184-199.
[11] JIA X Y,LIAO W H,TANG Z M,et al.Minimum cost attribu-te reduction in decision-theoretic rough set models[J].2013,219(1):151-167.
[12] LI H,ZHOU X,ZHAO J,et al.Attribute reduction in decision-theoretic rough set model:a further investigation[M]∥Rough Sets and Knowledge Technology.Springer Berlin Heidelberg,2011:466-475.
[13] MA J M,LEUNG Y,ZHANG W X.Attribute reductions in ob-ject-oriented concept lattice[J].International Journal of Machine Learning & Cybernetics,2014,5(5):789-813.
[14] JU H R,YANG X B,QI Y,et al.Approach to Monotonicity Attribute Reduction in Quantitative Rough Set[J].Computer Science,2015,42(8):36-39.(in Chinese) 鞠恒荣,杨习贝,戚湧,等.量化粗糙集的单调性属性约简方法[J].计算机科学,2015,42(8):36-39.
[15] YAO Y Y,ZHAO Y.Discernibility matrix simplication for constructing attribute reducts [J].Information Sciences,2009,179(7):867-882.
[16] JIA X Y,SHANG L.A Simulated Annealing Algorithm forLearning Thresholds in Three-way Decision-theoretic Rough Set Model[J].Journal of Chinese Computer Systems,2013,34(11):2603-2606.(in Chinese) 贾修一,商琳.一种求三支决策阈值的模拟退火算法[J].小型微型计算机系统,2013,34(11):2603-2606.

No related articles found!
Full text



[1] LEI Li-hui and WANG Jing. Parallelization of LTL Model Checking Based on Possibility Measure[J]. Computer Science, 2018, 45(4): 71 -75, 88 .
[2] XIA Qing-xun and ZHUANG Yi. Remote Attestation Mechanism Based on Locality Principle[J]. Computer Science, 2018, 45(4): 148 -151, 162 .
[3] LI Bai-shen, LI Ling-zhi, SUN Yong and ZHU Yan-qin. Intranet Defense Algorithm Based on Pseudo Boosting Decision Tree[J]. Computer Science, 2018, 45(4): 157 -162 .
[4] WANG Huan, ZHANG Yun-feng and ZHANG Yan. Rapid Decision Method for Repairing Sequence Based on CFDs[J]. Computer Science, 2018, 45(3): 311 -316 .
[5] SUN Qi, JIN Yan, HE Kun and XU Ling-xuan. Hybrid Evolutionary Algorithm for Solving Mixed Capacitated General Routing Problem[J]. Computer Science, 2018, 45(4): 76 -82 .
[6] ZHANG Jia-nan and XIAO Ming-yu. Approximation Algorithm for Weighted Mixed Domination Problem[J]. Computer Science, 2018, 45(4): 83 -88 .
[7] WU Jian-hui, HUANG Zhong-xiang, LI Wu, WU Jian-hui, PENG Xin and ZHANG Sheng. Robustness Optimization of Sequence Decision in Urban Road Construction[J]. Computer Science, 2018, 45(4): 89 -93 .
[8] LIU Qin. Study on Data Quality Based on Constraint in Computer Forensics[J]. Computer Science, 2018, 45(4): 169 -172 .
[9] ZHONG Fei and YANG Bin. License Plate Detection Based on Principal Component Analysis Network[J]. Computer Science, 2018, 45(3): 268 -273 .
[10] SHI Wen-jun, WU Ji-gang and LUO Yu-chun. Fast and Efficient Scheduling Algorithms for Mobile Cloud Offloading[J]. Computer Science, 2018, 45(4): 94 -99, 116 .