Skip to main content
Top
Published in: Soft Computing 16/2019

08-11-2018 | Foundations

The structures and the connections on four types of covering rough sets

Authors: Zhaohao Wang, Hong Wang, Qinrong Feng

Published in: Soft Computing | Issue 16/2019

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

Covering rough set model is an important extension of Pawlak rough set model, and its structure is the foundation of covering rough set theory. This paper considers four covering approximations and studies the structures of the families of their covering upper (or lower) definable sets by means of lattice theory. We provide some conditions under which the families of covering upper (or lower) definable sets with respect to these covering approximations are lattices of sets, or distributive lattices, or geometric lattices, or Boolean lattices. Furthermore, based on these results, we give the relationship among the four covering approximations and establish the connection between matroids and covering rough sets from the viewpoint of lattice theory.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Literature
go back to reference Bonikowski Z, Bryniarski E, Wybraniec-Skardowska U (1998) Extensions and intentions in the rough set theory. Inf Sci 107(1):149–167MathSciNetCrossRefMATH Bonikowski Z, Bryniarski E, Wybraniec-Skardowska U (1998) Extensions and intentions in the rough set theory. Inf Sci 107(1):149–167MathSciNetCrossRefMATH
go back to reference Chen D, Zhang W, Yeung D, Tsang E (2006) Rough approximations on a complete completely distributive lattice with applications to generalized rough sets. Inf Sci 176:1829–1848MathSciNetCrossRefMATH Chen D, Zhang W, Yeung D, Tsang E (2006) Rough approximations on a complete completely distributive lattice with applications to generalized rough sets. Inf Sci 176:1829–1848MathSciNetCrossRefMATH
go back to reference Chen D, Wang C, Hu Q (2007) A new approach to attribute reduction of consistent and inconsistent covering decision systems with covering rough sets. Inf Sci 177(17):3500–3518MathSciNetCrossRefMATH Chen D, Wang C, Hu Q (2007) A new approach to attribute reduction of consistent and inconsistent covering decision systems with covering rough sets. Inf Sci 177(17):3500–3518MathSciNetCrossRefMATH
go back to reference Davey BA, Priestley HA (1990) Introduction to lattices and order. Cambridge University Press, CambridgeMATH Davey BA, Priestley HA (1990) Introduction to lattices and order. Cambridge University Press, CambridgeMATH
go back to reference D’eer L, Cornelis C (2015) New neighborhood based rough sets. In: Proceedings of 10th International Conference on Rough Sets and Knowledge Technology (RSKT2015), LNAI 9436, pp 191–201 D’eer L, Cornelis C (2015) New neighborhood based rough sets. In: Proceedings of 10th International Conference on Rough Sets and Knowledge Technology (RSKT2015), LNAI 9436, pp 191–201
go back to reference D’eer L, Restrepo M, Cornelis C, Gómez J (2016) Neighborhood operators for covering-based rough sets. Inf Sci 336:21–44CrossRefMATH D’eer L, Restrepo M, Cornelis C, Gómez J (2016) Neighborhood operators for covering-based rough sets. Inf Sci 336:21–44CrossRefMATH
go back to reference D’eer L, Cornelis C, Yao Y (2016) A semantically sound approach to Pawlak rough sets and covering-based rough sets. Int J Approx Reason 78:62–72MathSciNetCrossRefMATH D’eer L, Cornelis C, Yao Y (2016) A semantically sound approach to Pawlak rough sets and covering-based rough sets. Int J Approx Reason 78:62–72MathSciNetCrossRefMATH
go back to reference Ge X, Wang P, Yun Z (2017) The rough membership functions on four types of covering-based rough sets and their applications. Inf Sci 390:1–14MathSciNetCrossRef Ge X, Wang P, Yun Z (2017) The rough membership functions on four types of covering-based rough sets and their applications. Inf Sci 390:1–14MathSciNetCrossRef
go back to reference Huang A, Zhao H, Zhu W (2014) Nullity-based matroid of rough sets and its application to attribute reduction. Inf Sci 263:153–165MathSciNetCrossRefMATH Huang A, Zhao H, Zhu W (2014) Nullity-based matroid of rough sets and its application to attribute reduction. Inf Sci 263:153–165MathSciNetCrossRefMATH
go back to reference Liu G, Zhu K (2014) The relationship among three types of rough approximation pairs. Knowl-Based Syst 60:28–34CrossRef Liu G, Zhu K (2014) The relationship among three types of rough approximation pairs. Knowl-Based Syst 60:28–34CrossRef
go back to reference Li T, Wu W (2011) Attribute reduction in formal contexts: a covering rough set approach. Fund Inf 111:15–32MathSciNetMATH Li T, Wu W (2011) Attribute reduction in formal contexts: a covering rough set approach. Fund Inf 111:15–32MathSciNetMATH
go back to reference Liang J, Wang F, Dang C, Qian Y (2012) An efficient rough feature selection algorithm with a multi-granulation view. Int J Approx Reason 53:912–926MathSciNetCrossRef Liang J, Wang F, Dang C, Qian Y (2012) An efficient rough feature selection algorithm with a multi-granulation view. Int J Approx Reason 53:912–926MathSciNetCrossRef
go back to reference Oxley JG (1992) Matroid theory. Oxford University Press, New YorkMATH Oxley JG (1992) Matroid theory. Oxford University Press, New YorkMATH
go back to reference Pomykala J (1987) Approximation operators in approximation space. Bull Polish Acad Sci Math 35:653–662MathSciNetMATH Pomykala J (1987) Approximation operators in approximation space. Bull Polish Acad Sci Math 35:653–662MathSciNetMATH
go back to reference Pomykala J (1988) On definability in the nondeterministic information system. Bull Pol Acad Sci Math 36(3–4):193–210MathSciNetMATH Pomykala J (1988) On definability in the nondeterministic information system. Bull Pol Acad Sci Math 36(3–4):193–210MathSciNetMATH
go back to reference Qin K, Gao Y, Pei Z (2007) On covering rough sets. In: Rough sets and knowledge technology. Springer, Berlin, 34–41 Qin K, Gao Y, Pei Z (2007) On covering rough sets. In: Rough sets and knowledge technology. Springer, Berlin, 34–41
go back to reference She Y, He X (2012) On the structure of the multigranulation rough set model. Knowl-Based Syst 36:81–92CrossRef She Y, He X (2012) On the structure of the multigranulation rough set model. Knowl-Based Syst 36:81–92CrossRef
go back to reference Su L, Zhu W (2017) Closed-set lattice and modular matroid induced by covering-based rough sets. Int J Mach Learn Cybern 8:191–201CrossRef Su L, Zhu W (2017) Closed-set lattice and modular matroid induced by covering-based rough sets. Int J Mach Learn Cybern 8:191–201CrossRef
go back to reference Tsumoto S, Tanaka A (1993) Rough sets and matroid theory. In: Ziarko W (ed) Rough sets, fuzzy sets and knowledge discovery. Springer, London, pp 290–297 Tsumoto S, Tanaka A (1993) Rough sets and matroid theory. In: Ziarko W (ed) Rough sets, fuzzy sets and knowledge discovery. Springer, London, pp 290–297
go back to reference Tsumoto S, Tanaka H (1995) Algebraic specification of empirical inductive learning methods based on rough sets and matroid theory. LNCS 985:224–243MathSciNet Tsumoto S, Tanaka H (1995) Algebraic specification of empirical inductive learning methods based on rough sets and matroid theory. LNCS 985:224–243MathSciNet
go back to reference Wang S, Zhu Q, Zhu W, Min F (2013) Quantitative analysis for covering-based rough sets through the upper approximation number. Inf Sci 220:483–491MathSciNetCrossRefMATH Wang S, Zhu Q, Zhu W, Min F (2013) Quantitative analysis for covering-based rough sets through the upper approximation number. Inf Sci 220:483–491MathSciNetCrossRefMATH
go back to reference Wang S, Zhu Q, Zhu W, Min F (2012) Matroidal structure of rough sets and its characterization to attribute reduction. Knowl-Based Syst 36:155–161CrossRef Wang S, Zhu Q, Zhu W, Min F (2012) Matroidal structure of rough sets and its characterization to attribute reduction. Knowl-Based Syst 36:155–161CrossRef
go back to reference Wang Z, Shu L, Ding X (2013) Minimal description and maximal description in covering-based rough sets. Fund Inf 128:503–526MathSciNetMATH Wang Z, Shu L, Ding X (2013) Minimal description and maximal description in covering-based rough sets. Fund Inf 128:503–526MathSciNetMATH
go back to reference Wang Z, Wang H, Feng Q, Shu L (2015) The approximation number function and the characterization of covering approximation space. Inf Sci 305:196–207MathSciNetCrossRefMATH Wang Z, Wang H, Feng Q, Shu L (2015) The approximation number function and the characterization of covering approximation space. Inf Sci 305:196–207MathSciNetCrossRefMATH
go back to reference Xu Z, Wang Q (2005) On the properties of covering rough sets model (in Chinese). J Henan Norm Univ 33(1):130–132MathSciNetMATH Xu Z, Wang Q (2005) On the properties of covering rough sets model (in Chinese). J Henan Norm Univ 33(1):130–132MathSciNetMATH
go back to reference Yang X, Qi Y, Song X, Yang J (2013) Test cost sensitive multigranulation rough set: model and minimal cost selection. Inf Sci 250:184–199MathSciNetCrossRefMATH Yang X, Qi Y, Song X, Yang J (2013) Test cost sensitive multigranulation rough set: model and minimal cost selection. Inf Sci 250:184–199MathSciNetCrossRefMATH
go back to reference Żakowski W (1983) Axiomatization in the space (U, \(\varPi \)). Demonstr Math XVI: 761–769 Żakowski W (1983) Axiomatization in the space (U, \(\varPi \)). Demonstr Math XVI: 761–769
go back to reference Zhu W, Wang F (2003) Reduction and axiomatization of covering generalized rough sets. Inf Sci 152:217–230CrossRefMATH Zhu W, Wang F (2003) Reduction and axiomatization of covering generalized rough sets. Inf Sci 152:217–230CrossRefMATH
go back to reference Zhu W, Wang F (2006) Properties of the first type of covering-based rough sets. In: Proceedings of the Sixth IEEE International Conference on Data Mining-Workshops (ICDMW’06), pp 407–411 Zhu W, Wang F (2006) Properties of the first type of covering-based rough sets. In: Proceedings of the Sixth IEEE International Conference on Data Mining-Workshops (ICDMW’06), pp 407–411
go back to reference Zhu W, Wang F (2007) On three types of covering based rough sets. IEEE Trans Knowl Data Eng 19(8):1131–1144CrossRef Zhu W, Wang F (2007) On three types of covering based rough sets. IEEE Trans Knowl Data Eng 19(8):1131–1144CrossRef
go back to reference Zhang X, Miao D, Liu C, Le M (2016) Constructive methods of rough approximation operators and multigranulation rough sets. Knowl-Based Syst 91:114–125CrossRef Zhang X, Miao D, Liu C, Le M (2016) Constructive methods of rough approximation operators and multigranulation rough sets. Knowl-Based Syst 91:114–125CrossRef
Metadata
Title
The structures and the connections on four types of covering rough sets
Authors
Zhaohao Wang
Hong Wang
Qinrong Feng
Publication date
08-11-2018
Publisher
Springer Berlin Heidelberg
Published in
Soft Computing / Issue 16/2019
Print ISSN: 1432-7643
Electronic ISSN: 1433-7479
DOI
https://doi.org/10.1007/s00500-018-3616-9

Other articles of this Issue 16/2019

Soft Computing 16/2019 Go to the issue

Premium Partner