Skip to main content
Log in

Axiomatization on generalized neighborhood system-based rough sets

  • Foundations
  • Published:
Soft Computing Aims and scope Submit manuscript

Abstract

Axiomatic characterization is the foundation of rough set theory: the axiom sets of approximation operators guarantee the existence of binary relations, coverings or (generalized) neighborhood systems that reproduce the approximation operators. Focusing on two pairs of generalized neighborhood system-based approximation operators (one pair is defined by Syau and Lin, the other pair is newly defined), we establish their axiomatic characterizations.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Bonikowski Z, Bryniarski E, Skardowska UW (1998) Extensions and intentions in the rough set theory. Inf Sci 107:149–167

    Article  MathSciNet  MATH  Google Scholar 

  • Guan LH, Wang GY (2012) Generalized approximations defined by non-equivalence relations. Inf Sci 193:163–179

    Article  MathSciNet  MATH  Google Scholar 

  • Gao NH, Li QG, Han HX, Li ZW (2017) Axiomatic approaches to rough approximation operators via ideal on a complete completely distributive lattice. Soft Comput. https://doi.org/10.1007/s00500-017-2495-9

  • Kang XP, Li DY, Wang SG, Qu KS (2013) Rough set model based on formal concept analysis. Inf Sci 222:611–625

    Article  MathSciNet  MATH  Google Scholar 

  • Kelley JL (1955) General topology. Van Nostrand, Princeton

    MATH  Google Scholar 

  • Kim YM, Enke D (2016) Developing a rule change trading system for the futures market using rough set analysis. Expert Syst Appl 59:165–173

    Article  Google Scholar 

  • Kryszkiewicz M (1998) Rough set approach to incomplete information systems. Inf Sci 112:39–49

    Article  MathSciNet  MATH  Google Scholar 

  • Li LQ, Jin Q, Hu K, Zhao FF (2017a) The axiomatic characterizations on L-fuzzy covering-based approximation operators. Int J Gen Syst 46(4):332–353. https://doi.org/10.1080/03081079.2017.1308360

  • Li ZW, Xie NX, Gao NH (2017b) Rough approximations based on soft binary relations and knowledge bases. Soft Comput 21:839–852

    Article  MATH  Google Scholar 

  • Lin TY (1992) Topological and fuzzy rough sets. Intell Decis Support 11:287–304

    Article  Google Scholar 

  • Lin TY (1997) Neighborhood systems: a qualitative theory for fuzzy and rough sets. In: Wang P (ed) Advances in machine intelligence and soft computing, vol 4. Duke University, Durham, NC, pp 132–155

  • Lin TY (1998) Granular computing on binary relations I: data mining and neighborhood systems. In: Skowron A, Polkowski L (eds) Rough sets and knowledge discovery. Physica-Verlag, Heidelberg, pp 107–121

    Google Scholar 

  • Lin TY (2009a) Granular computing I: the concept of granulation and its formal model. Int J Granul Comput Rough Sets Intell Syst 1:21–42

    Google Scholar 

  • Lin TY (2009b) Granular computing: practices, theories, and future directions. In: Meyers RA (ed) Computational complexity: theory, techniques, and applications. Springer, New York, pp 1404–1420

  • Lin TY, Liu Q (1994) Rough approximate operators: axiomatic rough set theory. In: Ziarko WP (ed) Rough Sets, fuzzy sets and knowledge discovery. Springer, London, pp 256–260

    Chapter  Google Scholar 

  • Lin TY, Yao YY (1996) Mining soft rules using rough sets and neighborhoods. In: Proceedings of the symposium on modelling, analysis and simulation, computational engineering in systems applications (CESA 96), IMASCS Multiconference, Lille, France

  • Lin TY, Syau YR (2011) Granular mathematics-foundation and current state. In: Proceedings of the 2011 IEEE international conference on granular computing, pp 4–12

  • Lin TY, Syau YR (2013) Unifying Variable Precision and Classical Rough Sets: Granular Approach. Rough Sets and Intelligent Systems-Professor Zdzislaw Pawlak in Memoriam (Vol. II). Intelligent Systems Reference Library 42:287–304

    Google Scholar 

  • Lin TY, Huang KJ, Liu Q, Chen W (1990) Rough sets, neighborhood systems and approximation. In: Proceedings of the fifth international symposium on methodologies of intelligent systems, Knoxville, Tennessee, pp 130–141

  • Liu GL (2013) The relationship among different covering approximations. Inf Sci 250:178–183

    Article  MathSciNet  MATH  Google Scholar 

  • Liu GL, Sai Y (2009) A comparison of two types of rough sets induced by coverings. Int J Approx Reason 50:521–528

    Article  MathSciNet  MATH  Google Scholar 

  • Ma ZM, Hu BQ (2013) Topological and lattice structures of L-fuzzy rough sets determined by lower and upper sets. Inf Sci 218:194–204

    Article  MathSciNet  MATH  Google Scholar 

  • Ma JM, Li JJ, Mi JS (2015) Some minimal axiom sets of rough sets. Inf Sci 312:40–54

    Article  MathSciNet  MATH  Google Scholar 

  • Michael JB, Lin TY (1997) Neighborhoods, rough sets, and query relaxation in cooperative answering. Rough sets and data mining: analysis of imprecise data. Kluwer Academic Publisher, Dordrecht, pp 229–238

    Google Scholar 

  • Pawlak Z (1982) Rough sets. Int J Comput Inf Sci 11:341–356

    Article  MATH  Google Scholar 

  • Pawlak Z (1991) Rough sets: theoretical aspects of reasoning about data. Kluwer Academic Publishers, Boston

    Book  MATH  Google Scholar 

  • Polkowski L, Skowron A (eds) (1998) Rough sets in knowledge discovery. Physic-Verlag, Heidelberg

    MATH  Google Scholar 

  • Sieroiński W (1956) General topology. University of Toronto, Toronto

    Google Scholar 

  • Syau YR, Jia LX (2012) Generalized rough sets based on reflexive relations. Commun Inf Syst 12:233–249

    MathSciNet  MATH  Google Scholar 

  • Syau YR, Lin EB (2014) Neighborhood systems and covering approximate spaces. Knowl-Based Syst 66:61–67

    Article  Google Scholar 

  • Teng S, Liao F, Ma Y, He M, Nian Y (2017) Uncertainty measures of rough sets based on discernibility capability in information systems. Soft Comput 21:1081–1096

  • Wang LJ, Yang XB, Yang JY, Wu C (2012) Relationships among generalized rough sets in six coverings and pure reflexive neighborhood system. Inf Sci 207:66–78

    Article  MathSciNet  MATH  Google Scholar 

  • Yao YY (1998a) Constructive and algebraic methods of the theory of rough sets. Inf Sci 109:21–47

    Article  MATH  Google Scholar 

  • Yao YY (1998b) Relational interpretations of neighborhood operators and rough set approximation operators. Inf Sci 111:239–259

    Article  MathSciNet  MATH  Google Scholar 

  • Yao YY (2006) Neighborhood systems and approximate retrieval. Inf Sci 176:3431–3452

    Article  MathSciNet  MATH  Google Scholar 

  • Yao YY (2016) Rough-set concept analysis: interpreting RS-definable concepts based on ideas from formal concept analysis. Inf Sci 346:442–462

    Article  MathSciNet  Google Scholar 

  • Yang XB, Zhang M, Dou HL, Yang JY (2011) Neighborhood systems-based rough sets in incomplete information system. Knowl Based Syst 24:858–867

    Article  Google Scholar 

  • Yao YY, Yao BX (2012) Covering based rough set approximations. Inf Sci 200:91–107

    Article  MathSciNet  MATH  Google Scholar 

  • Zhu W (2007) Topological approaches to covering rough sets. Inf Sci 177:1499–1508

    Article  MathSciNet  MATH  Google Scholar 

  • Zhu W (2009) Relationship between generalized rough sets based on binary relation and covering. Inf Sci 179:210–225

    Article  MathSciNet  MATH  Google Scholar 

  • Zhong N, Yao YY, Ohshima M (2003) Peculiarity oriented multidatabase mining. IEEE Trans Knowl Data Eng 15:952–960

    Article  Google Scholar 

  • Zhu W, Wang FY (2003) Reduction and axiomization of covering generalized rough sets. Inf Sci 152:217–230

    Article  MathSciNet  MATH  Google Scholar 

  • Zhu W, Wang FY (2006) Covering based granular computing for conflict analysis. In: Proceedings of the 4th IEEE international conference on intelligence and security informatics, vol 3975, pp 566–571

  • Zhu W, Wang FY (2007) On three types of covering-based rough sets. IEEE Trans Knowl Data Eng 19:1131–1144

    Article  Google Scholar 

  • Zhang YL, Luo MK (2011) On minimization of axiom sets characterizing covering-based approximation operators. Inf Sci 181:3032–3042

    Article  MathSciNet  MATH  Google Scholar 

  • Zhang YL, Li JJ, Wu WZ (2010) On axiomatic characterizations of three pairs of covering based approximation operators. Inf Sci 180:274–287

    Article  MathSciNet  MATH  Google Scholar 

  • Zhang YL, Li CQ, Lin ML, Lin YJ (2015) Relationships between generalized rough sets based on covering and reflexive neighborhood system. Inf Sci 319:56–67

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

The authors thank the reviewers and the area editor for their valuable comments and suggestions. This study was funded by National Natural Science Foundation of China (11501278) and Shandong Provincial Natural Science Foundation, China (ZR2013AQ011, ZR2014AQ011) and the Ke Yan Foundation of Liaocheng University (318011505).

Author information

Authors and Affiliations

Authors

Contributions

FZ: The first pair of approximation operators. LL: The second pair of approximation operators.

Corresponding author

Correspondence to Lingqiang Li.

Ethics declarations

Conflicts of interest

The authors declare that there is no conflict of interest.

Ethical approval

This article does not contain any studies with human participants or animals performed by any of the authors.

Additional information

Communicated by A. Di Nola.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhao, F., Li, L. Axiomatization on generalized neighborhood system-based rough sets. Soft Comput 22, 6099–6110 (2018). https://doi.org/10.1007/s00500-017-2957-0

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-017-2957-0

Keywords

Navigation