Computer Science ›› 2021, Vol. 48 ›› Issue (4): 49-53.doi: 10.11896/jsjkx.200900089

• Computer Science Theory • Previous Articles     Next Articles

Relationship Among Three Types of Rough Approximation Pairs

LU Xun, LI Yan-yan, QIN Ke-yun   

  1. College of Mathematic,Southwest Jiaotong University,Chengdu 611756,China
  • Received:2020-06-24 Revised:2020-11-09 Online:2021-04-15 Published:2021-04-09
  • About author:LU XUN,born in 1995,postgraduate.His main research interests include rough set theory,formal concept analysis and so on.(2900501866@qq.com)
    QIN Ke-yun,born in 1962,Ph.D,professor,Ph.D supervisor.His main research interests include rough set theory,formal concept analysis and so on.
  • Supported by:
    National Natural Science Foundation of China(61976130,61473239).

Abstract: In generalized approximation spaces,approximation operators can be constructed based on elements,knowledge gra-nules and subsystems.This paper is devoted to discussion of basic properties and relationships among these three types of approximation operators.Some necessary and sufficient conditions for approximation operators coincide with each other are provi-ded.In addition,different approximation spaces may generate same granule based or subsystem based rough approximation operators.Some necessary and sufficient conditions for different approximation spaces generating same approximate operators are surveyed.

Key words: Approximation operator, Generalized approximation space, Left and right relative sets

CLC Number: 

  • TP182
[1]PAWLAK Z.Rough sets[J].International Journal of Computer &Information Sciences,1982,11(5):341-356.
[2]DAI J,XU Q.Approximations and uncertainty measures in incomplete information systems[J].Information Sciences,2012,198(1):62-80.
[3]KANEIWA K,KUDO Y.A sequential pattern mining algorithm using rough set theory [J].International Journal of Approximate Reasoning,2011,52(6):881-893.
[4]YAO Y Y,ZHOU B.Two Bayesian approaches to rough sets [J].European Journal of Operational Research,2016,251:904-917.
[5]YAO Y Y.Three-way decision with probabilistic rough sets[J].Information Sciences,2010,180(3):341-353.
[6]YAO Y Y.Relational interpretations of neighbor-hood operators and rough set approximation operators[J].Information Scie-nces,1998,111(1):239-259.
[7]YAO Y Y.Constructive and algebraic methods of rough sets[J].Information Sciences,1998,109(1):21-47.
[8]SLOWINSKI R,VANDERPOOTEN D.A generalized definition of rough approximations based on similarity [J].IEEE Transactions on Knowledge and Data Engineering,2000,12:331-336.
[9]DUBOIS D,PRADE H.Rough fuzzy sets and fuzzy rough sets [J].International Journal of General Systems,1990,17:191-209.
[10]RADZIKOWSKA A M,KERRE E E.A comparative study offuzzy rough sets [J].Fuzzy Sets and Systems,2002,126:137-155.
[11]MI J S,LEUNG Y,ZHAO H Y,et al.Generalized fuzzy rough sets determined by a triangular norm [J].Information Sciences,2008,178:3203-3213.
[12]BONIKOWSKI Z,BRYNIARSKI E,WYBRANIEC-SKARDO-WSKA U.Extensions and intentions in the rough set theory [J].Information Sciences,1998,107:149-167.
[13]ZHU W,WANG F Y.On three types of covering based rough sets [J].IEEE Transactions on Knowledge and Data Enginee-ring,2007,19(8):1131-1144.
[14]KONDO M.On the structure of generalized rough sets [J].Information Sciences,2006,176(5):589-600.
[15]QIN K Y,YANG J L,PEI Z.Generalized rough sets based on reflexive and transitive relations [J].Information Sciences,2008,178(21):4138-4141.
[16]QIN K Y,PEI Z.On the topological properties of fuzzy rough sets [J].Fuzzy Sets and Systems,2005,151:601-613.
[17]LASHIN E F,KOZAE A M,MEDHHAT T,et al.Rough set theory for topological spaces [J].International Journal of Approximate Reasoning,2005,49(1/2):35-43.
[18]ZHU W.Topological approaches to covering rough sets [J].Information Sciences,2007,177:1499-1508.
[19]ZHANG Y L,LI C Q.Topological structures of a type of gra-nule based covering rough sets [J].Filomat,2018,32(9):3129-3141.
[20]WU H S,LIU G L.The relationships between topologies andgeneralized rough sets[J].International Journal of Approximate Reasoning,2020,119:313-324.
[21]ZHANG W X,WU W Z,LIANG J Y,et al.Rough set theory and method[M].Beijing:Science Press,2001.
[22]LIU G L.A comparison of two types of generalized rough sets[C]//IEEE International Conference on Granular Computing.IEEE Computer Society,2012:423-426.
[23]LIU G L,ZHU K.The relationship among three types of rough approximation pairs [J].Knowledge-Based Systems,2014,60:28-34.
[24]ZHANG Y L,LI C Q.Topological properties of a pair of relation based approximation operators [J].Filomat,2017,31(19):6175-6183.
[25]AKOWSKI W.Approximations in the space (u,π)[J].Demonstration Mathematics,1983,16(3):761-769.
[26]ZHU W.Relationship between generalized rough sets based on binary relation and covering [J].Information Sciences,2009,179(1):210-225.
[27]BOUZAYANE S,SAAD L.A multicriteria approach based on rough set theory for the incremental Periodic prediction [J].European Journal of Operational Research,2020,286(1):282-298.
[1] XU Si-yu, QIN Ke-yun. Topological Properties of Fuzzy Rough Sets Based on Residuated Lattices [J]. Computer Science, 2022, 49(6A): 140-143.
[2] LI Yan-yan, QIN Ke-yun. On Topological Properties of Generalized Rough Approximation Operators [J]. Computer Science, 2022, 49(3): 263-268.
[3] KONG Qing-zhao and WEI Zeng-xin. Fuzzy Rough Set Algebra of Multi-granulation [J]. Computer Science, 2016, 43(4): 206-209.
[4] KONG Qing-zhao and WEI Zeng-xin. Rough Set Algebra of Multi-granulation [J]. Computer Science, 2016, 43(2): 68-71.
[5] LI Chang-qing and ZHANG Yan-lan. Updating Approximations for a Type of Covering-based Rough Sets [J]. Computer Science, 2016, 43(1): 73-76.
[6] QIN Ke-yun and LUO Jun-fang. Rough Set Model Based on Grade Indiscernibility Relation [J]. Computer Science, 2015, 42(8): 240-243.
[7] SUN Feng and WANG Jing-qian. Graph Representation and 2-part Matrix of Covering-based Rough Sets [J]. Computer Science, 2014, 41(3): 85-87.
[8] XUE Zhan-ao,CHENG Hui-ru,HUANG Hai-song and XIAO Yun-hua. Rough Approximations of Intuitions Fuzzy Sets in Fuzzy Approximation Space [J]. Computer Science, 2013, 40(4): 221-226.
[9] . Generalization of Rough Set Model Based on Molecular Lattices [J]. Computer Science, 2012, 39(2): 258-261.
[10] LIANG Jun-qi, YAN Shu-xia. Note of Covering Rough Set Model Nature [J]. Computer Science, 2011, 38(9): 234-236.
[11] LIANG Jun-qi,ZHANG Wen-jun. Relations between for Variable Precision Covering Approximation Operators and Covering Approximation Operators [J]. Computer Science, 2011, 38(3): 222-223.
[12] QIAO Quan-xi,QIN Ke-yun. Topological Structure of Rou沙 Sets in Infinite Universes [J]. Computer Science, 2011, 38(10): 228-230.
[13] XU You-hong (School of Mathematics,Physics,and Information Science,Zhejiang Ocean University,Zhoushan 316004,China). [J]. Computer Science, 2009, 36(2): 194-198.
[14] . [J]. Computer Science, 2009, 36(1): 158-161.
[15] . [J]. Computer Science, 2008, 35(3): 222-224.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!