Computer Science ›› 2020, Vol. 47 ›› Issue (3): 87-91.doi: 10.11896/jsjkx.190500162

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

Attribute Reduction Based on Local Adjustable Multi-granulation Rough Set

HOU Cheng-jun 1,MI Ju-sheng1,LIANG Mei-she1,2   

  1. (College of Mathematics and Information Science, Hebei Normal University, Shijiazhuang 050024, China)1;
    (Department of Scientific Development and Technology and School-Business Cooperation, Shijiazhuang University of Applied Technology, Shijiazhuang 050081, China)2
  • Received:2019-05-30 Online:2020-03-15 Published:2020-03-30
  • About author:HOU Cheng-jun,postgraduate.His research interests include rough set and granular computing. MI Ju-sheng,Ph.D,professor.His research interests include granular computing and approximate reasoning.
  • Supported by:
    This work was supported by the National Natural Science Foundation of China (61573127), Natural Science Foundation of Hebei province (A2018210120), Graduate Innovation Project Foundation of Hebei Normal University (CXZZSS2017046).

Abstract: In classical multi-granulation rough set models,multiple equivalent relations (multiple granular structures) are used to approximate a target set.According to optimistic and pessimistic strategies,there are two types of common multi-granulation called optimistic multi-granulation and pessimistic multi-granulation respectively.The two combination rules seem to lack of practicability since one is too restrictive and the other too relaxed.In addition,multi-granulation rough set model is highly time-consuming because it is necessary to scan all the objects when approximating a concept.To overcome this disadvantage and enlarge the using range of multi-granulation rough set model,this paper firstly introduced the adjustable multi-granulation rough set model in incomplete information system and defined the local adjustable multi-granulation rough set model.Secondly,this paper proved that local adjustable multi-granulation rough set and adjustable multi-granulation rough set have the same upper and lower approximations.By defining the concepts of lower approximation cosistent set,lower approximation reduction,lower approximation quality,lower approximation quality reduction,and importance of internal and external,a local adjustable multi-granulation rough set model for attribute reduction was proposed.Furthermore,a heuristic algorithm of attribute reduction was constructed based on granular significance.Finally,the effectiveness of the method was illustrated through examples.The experimental results show that local adjustable size rough set model can accurately process the data of incomplete information system,and it can reduce the complexity of the algorithm.

Key words: Approximate quality, Attribute reduction, Incomplete information system, Multi-granulation, Rough set

CLC Number: 

  • TP18
[1]PAWLAK Z.Rough sets[J].International Journal of Computer and Information Sciences,1982,11(5):341-356.
[2]PAWLAK Z.Rough sets:some extensions[J].Information Sciences,2007,177(1):3-27.
[3]PAWLAK Z.Rough sets:Theoretical aspects of reasoning about data[M].Kluwer Academic Publishers,Dordrecht,1991.
[4]QIAN Y H,LIANG J Y,PEDRYCZ W.Positive approximation: an accelerator for attribute reduction in rough set theory[J].Artificial Intellegence.2010,174 (9):597-618.
[5]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.
[6]YAO Y Y,ZHAO Y.Attribute reduction in decision-theoretic rough set models[J].Information Sciences,2008,178(17):3356-3373.
[7]DU Y,HU Q H,ZHU P F,et al.Rule learning for classification based on neighborhood covering reduction[J].Information Sciences,2011,181 (24):5457-5467.
[8]LI J H,MEI C L,LV Y J.Incomplete decision contexts:Ap- proximate concept construction,rule acquisition and knowledge reduction[J].International Journal of Approximate Reasoning,2013,54(1):149-165.
[9]POLKOWSKI L,SKOWRON A.Rough mereology:A new paradigm for approximate reasoning[J].International Journal of Approximate Reasoning,1996,15(4):333-365.
[10]SHE Y H,HE X L.On the structure of the multigranulation rough set model[J].Knowledge-Based System,2012,36:81-92.
[11]QIAN Y H,LIANG J Y,WU W Z,et al.Information Granularity in Fuzzy Binary GrC Model[J].IEEE Transactions on Fuzzy Systems,2011,19(2):253-264.
[12]SWINIARSKI R,SKOWRON A.Rough set methods in feature selection and recognition[J].Pattern Recognition Letters,2003,24(6):833-849.
[13]WEI J M,WANG S Q,YUAN X J.Ensemble Rough Hypercuboid Approach for Classifying Cancers[J].IEEE Transactions on Knowledge and Data Engineering,2010,22(3):381-391.
[14]LIU Z G,YU H,WANG G Y.An automatic method to determine the number of clusters using decision-theoretic rough set[J].International Journal of Approximate Reasoning,2014,55(1):101-115.
[15]CHEN H M,LI T R,LUO C,et al.A decision-theoretic rough set approach for dynamic data mining[J].IEEE Transactions on Fuzzy Systems,2015,23(6):1-14.
[16]LIU D,LI T R,LIANG D C.Incorporating logistic regression to decision-theoretic rough sets for classifications[J].International Journal of Approximate Reasoning,2014,55(1):197-210.
[17]QIAN Y H,LIANG J Y,YAO Y Y,et al.A multigranulation rough set[J].Information Sciences,2010,180:949-970.
[18]XU W H,SUN W X,ZHANG X Y,et al.Multiple granulation rough set approach to ordered information systems[J].International Journal of General Systems,2012,41(5):475-501.
[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] WANG Zhi-cheng, GAO Can, XING Jin-ming. Three-way Approximate Reduction Based on Positive Region [J]. Computer Science, 2022, 49(4): 168-173.
[8] 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.
[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] 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.
[11] ZENG Hui-kun, MI Ju-sheng, LI Zhong-ling. Dynamic Updating Method of Concepts and Reduction in Formal Context [J]. Computer Science, 2021, 48(1): 131-135.
[12] 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.
[13] 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.
[14] CHEN Yu-jin, XU Ji-hui, SHI Jia-hui, LIU Yu. Three-way Decision Models Based on Intuitionistic Hesitant Fuzzy Sets and Its Applications [J]. Computer Science, 2020, 47(8): 144-150.
[15] YUE Xiao-wei, PENG Sha and QIN Ke-yun. Attribute Reduction Methods of Formal Context Based on ObJect (Attribute) Oriented Concept Lattice [J]. Computer Science, 2020, 47(6A): 436-439.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!