Computer Science

Computer Science ›› 2022, Vol. 49 ›› Issue (4): 168-173.doi: 10.11896/jsjkx.210500067

• Database & Big Data & Data Science • Previous Articles     Next Articles

Three-way Approximate Reduction Based on Positive Region

WANG Zhi-cheng, GAO Can, XING Jin-ming   

  1. College of Computer Science and Software Engineering, Shenzhen University, Shenzhen, Guangdong 518060, ChinaKey Laboratory of Intelligent Information Processing, Shenzhen, Guangdong 518060, China
  • Received:2021-05-10 Revised:2021-10-15 Published:2022-04-01
  • About author:WANG Zhi-cheng,born in 1998,postgraduate.His main research interests include machine learning and granular computing.GAO Can,born in 1983,Ph.D,assistant professor,master supervisor.His main research interests include machine lear-ning and computer vision.
  • Supported by:
    This work was supported by the National Natural Science Foundation of China(61806127,62076164) and Bureau of Education of Foshan(2019XJZZ05).

PDF (PC)

453

Abstract: Attribute reduction is one of the most important research topics in the theory of three-way decision.However, the existing attribute reduction methods based on three-way decision are too strict, which limit the efficiency of attribute reduction.In this paper, a three-way approximate attribute reduction method based on the positive region is proposed.More specifically, attri-bute reduction is considered as the process of determining attributes as positive, boundary, or negative ones according to their correlation to the decision attribute.The negative attributes are first removed by retaining the measure of the positive region.Then, some of the boundary attributes are iteratively excluded by relaxing the positive region measure.Finally, an approximate reduction is formed by the remaining attributes.Extensive experiments on UCI data sets demonstrate that the proposed method can achieve much smaller reducts with the same or even better performance in comparison with other representative methods, showing the effectiveness in attribute reduction.

Key words: Approximate reduction, Attributes reduction, Positive region, Rough set, Three-way decision

CLC Number: 

  • TP391
[1] LI Y,LI T,LIU H.Recent advances in feature selection and its applications[J].Knowledge and Information Systems,2017,53(3):551-577.
[2] BISHOP C M.Pattern recognition and machine learning[M].New York:Springer,2006.
[3] ARMANFARD N,REILLY J P,KOMEILI M.Local feature selection for data classification[J].IEEE Transactions on Pattern Analysis and Machine Intelligence,2015,38(6):1217-1227.
[4] MIAO D Q,ZHAO Y,YAO Y Y,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] LI F,MIAO D Q,PEDRYCZ W.Granular multi-label feature selection based on mutual information[J].Pattern Recognition,2017,67:410-423.
[6] YAO Y Y,ZHAO Y.Discernibility matrix simplification forconstructing attribute reducts[J].Information Sciences,2009,179(7):867-882.
[7] LAI Z H,YONG X,JIAN Y,et al.Rotational invariant dimensionality reduction algorithms[J].IEEE Transactions on Cybernetics,2016,47(11):3733-3746.
[8] WANG X,PENG Z H,LI J Y,et al.Method of Concept Reduction Based on Concept Discernibility Matrix[J].Computer Science,2021,48(1):125-130.
[9] ZENG H K,MI J S,LI Z L.Dynamic Updating Method of Concepts and Reduction in Formal Context[J].Computer Science,2021,48(1):131-135.
[10] PAWLAK Z.Rough sets[J].International Journal of Computer &Information Sciences,1982,11(5):341-356.
[11] YAO Y Y.Three-way decisions with probabilistic rough sets[J].Information Sciences,2010,180(3):341-353.
[12] YAO Y Y.Three-way decision and granular computing[J].International Journal of Approximate Reasoning,2018,103:107-123.
[13] YAO Y Y.Three-way granular computing,rough sets,and formal concept analysis[J].International Journal of Approximate Reasoning,2020,116:106-125.
[14] YAO Y Y,ZHAO Y.Attribute reduction in decision-theoreticrough set models[J].Information Sciences,2008,178(17):3356-3373.
[15] YAO Y Y.Three-way conflict analysis:Reformulations and extensions of the Pawlak model[J].Knowledge-Based Systems,2019,180:26-37.
[16] YAO Y Y.Three-way decisions and cognitive computing[J].Cognitive Computation,2016,8(4):543-554.
[17] ZHAO Y,WONG S K M,YAO Y Y.A note on attribute reduction in the decision-theoretic rough set model[C]//Transactions on Rough Sets XIII.Berlin:Springer,2011:260-275.
[18] LI H X,ZHOU X Z,ZHAO J B,et al.Non-monotonic attribute reduction in decision-theoretic rough sets[J].Fundamenta Informaticae,2013,126(4):415-432.
[19] MA X A,WANG G Y,YU H.Heuristic method to attribute reduction for decision region distribution preservation[J].Ruan Jian Xue Bao/Journal of Software,2014,25(8):1761-1780.
[20] MA X A,WANG G Y,YU H,et al.Decision region distribution preservation reduction in decision-theoretic rough set model[J].Information Sciences,2014,278:614-640.
[21] GAO C,LAI Z H,ZHOU J,et al.Maximum decision entropy-based attribute reduction in decision-theoretic rough set model[J].Knowledge-Based Systems,2018,143:179-191.
[22] ZHANG X Y,MIAO D Q.Region-based quantitative and hierarchical attribute reduction in the two-category decision theoretic rough set model[J].Knowledge-Based Systems,2014,71:146-161.
[23] ZHANG X Y,MIAO D Q.Reduction target structure-based hie-rarchical attribute reduction for two-category decision-theoretic rough sets[J].Information Sciences,2014,277:755-776.
[24] JIA X Y,LIAO W H,TANG Z M,et al.Minimum cost attribute reduction in decision-theoretic rough set models[J].Information Sciences,2013,219:151-167.
[25] JIA X Y,TANG Z M,LIAO W H,et al.On an optimization representation of decision-theoretic rough set model[J].International Journal of Approximate Reasoning,2014,55(1):156-166.
[26] LIAO S J,ZHU Q X,FAN M.Cost-sensitive attribute reduction in decision-theoretic rough set models[J].Mathematical Problems in Engineering,2014,35(1):1-9.
[27] SLEZAK D.Approximate reducts in decision tables[C]//Proceedings of IPMU’ 96.Granada:Spain,1996:1159-1164.
[28] SLEZAK D.Approximate entropy reducts[J].FundamentalInformaticae,2002,53(3/4):365-390.
[29] YANG M.Approximate reduction based on conditional information entropy in decision tables[J].Acta Electronica Sinica,2007,35(11):2156-2160.
[30] YANG X,LI T R,LIU D,et al.A unified framework of dynamic three-way probabilistic rough sets[J].Information Sciences,2017,420:126-147.
[31] ZHANG Q H,XIE Q,WANG G Y.A survey on rough set theory and its applications[J].CAAI Transactions on Intelligence Technology,2016,1(4):323-333.
[32] YAO Y Y,WONG S K M.A decision theoretic framework for approximating concepts[J].International Journal of Man-machine Studies,1992,37(6):793-809.
[33] LICHMAN M.UCI machine learning repository [DB/OL].University of California,Irvine,CA,USA,2013.http://archive.ics.uci.edu/ml.
[34] PEDREGOSA F,VAROQUAUX G,GRAMFORT A,et al.Scikit-learn:Machine learning in Python[J].Journal of Machine Learning Research,2011,12:2825-2830.
[1] CHENG Fu-hao, XU Tai-hua, CHEN Jian-jun, SONG Jing-jing, YANG Xi-bei. Strongly Connected Components Mining Algorithm Based on k-step Search of Vertex Granule and Rough Set Theory [J]. Computer Science, 2022, 49(8): 97-107.
[2] XU Si-yu, QIN Ke-yun. Topological Properties of Fuzzy Rough Sets Based on Residuated Lattices [J]. Computer Science, 2022, 49(6A): 140-143.
[3] FANG Lian-hua, LIN Yu-mei, WU Wei-zhi. Optimal Scale Selection in Random Multi-scale Ordered Decision Systems [J]. Computer Science, 2022, 49(6): 172-179.
[4] CHEN Yu-si, AI Zhi-hua, ZHANG Qing-hua. Efficient Neighborhood Covering Model Based on Triangle Inequality Checkand Local Strategy [J]. Computer Science, 2022, 49(5): 152-158.
[5] SUN Lin, HUANG Miao-miao, XU Jiu-cheng. Weak Label Feature Selection Method Based on Neighborhood Rough Sets and Relief [J]. Computer Science, 2022, 49(4): 152-160.
[6] WANG Zi-yin, LI Lei-jun, MI Ju-sheng, LI Mei-zheng, XIE Bin. Attribute Reduction of Variable Precision Fuzzy Rough Set Based on Misclassification Cost [J]. Computer Science, 2022, 49(4): 161-167.
[7] XUE Zhan-ao, HOU Hao-dong, SUN Bing-xin, YAO Shou-qian. Label-based Approach for Dynamic Updating Approximations in Incomplete Fuzzy Probabilistic Rough Sets over Two Universes [J]. Computer Science, 2022, 49(3): 255-262.
[8] ZHANG Shi-peng, LI Yong-zhong. Intrusion Detection Method Based on Denoising Autoencoder and Three-way Decisions [J]. Computer Science, 2021, 48(9): 345-351.
[9] LI Yan, FAN Bin, GUO Jie, LIN Zi-yuan, ZHAO Zhao. Attribute Reduction Method Based on k-prototypes Clustering and Rough Sets [J]. Computer Science, 2021, 48(6A): 342-348.
[10] WANG Zheng, JIANG Chun-mao. Cloud Task Scheduling Algorithm Based on Three-way Decisions [J]. Computer Science, 2021, 48(6A): 420-426.
[11] XIN Xian-wei, SHI Chun-lei, HAN Yu-qi, XUE Zhan-ao, SONG Ji-hua. Incremental Tag Propagation Algorithm Based on Three-way Decision [J]. Computer Science, 2021, 48(11A): 102-105.
[12] XUE Zhan-ao, SUN Bing-xin, HOU Hao-dong, JING Meng-meng. Optimal Granulation Selection Method Based on Multi-granulation Rough Intuitionistic Hesitant Fuzzy Sets [J]. Computer Science, 2021, 48(10): 98-106.
[13] LIANG Wei, DUAN Xiao-dong, XU Jian-feng. Three-way Filtering Algorithm of Basic Clustering Based on Differential Measurement [J]. Computer Science, 2021, 48(1): 136-144.
[14] XUE Zhan-ao, ZHANG Min, ZHAO Li-ping, LI Yong-xiang. Variable Three-way Decision Model of Multi-granulation Decision Rough Sets Under Set-pair Dominance Relation [J]. Computer Science, 2021, 48(1): 157-166.
[15] SANG Bin-bin, YANG Liu-zhong, CHEN Hong-mei, WANG Sheng-wu. Incremental Attribute Reduction Algorithm in Dominance-based Rough Set [J]. Computer Science, 2020, 47(8): 137-143.
Viewed
Full text


Abstract

Cited
  Shared   
  Discussed   
No Suggested Reading articles found!
渝ICP备16013121号-4
Add:18# Honghu West Rd., Yubei ,Chongqing,China    Post Code: 401121
Tel: 023-63500828/023-67039612/023-67039623
E-mail: jsjkx12@163.com
Powered by Beijing Magtech Co., Ltd.