Abstract
Covering of neighborhoods is an important concept in covering-based rough sets. There are many unsolved issues related to coverings of neighborhoods. The concept of repeat degree is proposed to study under what condition a covering of neighborhoods is a partition. It enables us to deal with many issues related to coverings of neighborhoods when coverings are incomplete. This paper applies repeat degree to solve some fundamental issues in coverings of neighborhoods. First, we investigate under what condition a covering of neighborhoods is equal to the reduct of the covering which induces the covering of neighborhoods. Then we study under what condition two coverings induce the same relation and the same covering of neighborhoods. Finally, we propose an approach to calculate coverings through repeat degree.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Bonikowski Z, Bryniarski E, Wybraniec-Skardowska U (1998) Extensions and intentions in the rough set theory. Inf Sci 107:149–167
Bryniarski E (1989) A calculus of rough sets of the first order. Bull Polish Acad Sci 37:71–78
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–1848
Chen J, Li J, Lin Y (2013) On the structure of definable sets in covering approximation spaces. Int J Mach Learn Cybernet 4:195–206
Dai J (2005) Logic for rough sets with rough double stone algebraic semantics. In: Rough sets, fuzzy sets, data mining, and granular computing, vol 3641 of LNCS, pp 141–148
Diker M, Ugur AA (2012) Textures and covering based rough sets. Inf Sci 184:44–63
Du Y, Hu Q, Zhu P, Ma P (2011) Rule learning for classification based on neighborhood covering reduction. Inf Sci 181:5457–5467
Estaji AA, Hooshmandasl MR, Davvaz B (2012) Rough set theory applied to lattice theory. Inf Sci 200:108–122
Fan N, Hu G, Xiao X, Zhang W (2012) Study on conditions of neighborhoods forming a partition. In: International Conference on fuzzy systems and knowledge discovery, 256–259
Huang A, Zhu W (2012) Geometric lattice structure of covering-based rough sets through matroids. J Appl Math. doi:10.1155/2012/236307
Kazanci O, Yamak S, Davvaz B (2008) The lower and upper approximations in a quotient hypermodule with respect to fuzzy sets. Inf Sci 178:2349–2359
Kondo M (2005) On the structure of generalized rough sets. Inf Sci 176:589–600
Lashin E, Kozae A, Khadra AA, Medhat T (2005) Rough set theory for topological spaces. Int J Approx Reason 40:35–43
Li Q, Zhu W (2013) Closed-set lattice of regular sets based on a serial and transitive relation through matroids. Int J Mach Learn Cybernet. doi:10.1007/s13042-013-0176-2
Lin TY (1988) Neighborhood systems and relational databases. In: ACM sixteenth annual conference on computer science, p 725
Liu G (2008) Generalized rough sets over fuzzy lattices. Inf Sci 178:1651–1662
Liu G, Sai Y (2009) A comparison of two types of rough sets induced by coverings. Int J Approx Reason 50:521–528
Liu Y, Zhu W (2012) Matroidal structure of rough sets based on serial and transitive relations. J Appl Math. doi:10.1155/2012/429737
Ma L (2012) On some types of neighborhood-related covering rough sets. Int J Approx Reason 53:901–911
Pawlak Z (1982) Rough sets. Int J Computer Inf Sci 11:341–356
Pawlak Z (1991) Rough sets: theoretical aspects of reasoning about data. Kluwer Academic Publishers, Boston
Pomykala JA (1987) Approximation operations in approximation space. Bull Polish Acad Sci Math 35:653–662
Pomykala JA (1988) On definability in the nondeterministic information system. Bull Polish Acad Sci Math 36:193–210
Qin K, Gao Y, Pei Z (2007) On covering rough sets. in: Rough set and knowledge technology, vol 4481 of LNAI, pp 34–41
Samanta P, Chakraborty MK (2009) Covering based approaches to rough sets and implication lattices. In: Rough sets, fuzzy sets, data mining and granular computing, vol 5908 of LNAI, pp 127–134
Shi Z, Gong Z (2010) The further investigation of covering-based rough sets: uncertainty characterization, similarity measure and generalized models. Inf Sci 180:3745–3763
Tang J, She K, Zhu W (2012) Matroidal structure of rough sets from the viewpoint of graph theory. J Appl Math. doi:10.1155/2012/973920
Wang C, Chen D, Sun B, Hu Q (2012) Communication between information systems with covering based rough sets. Inf Sci 216:17–33
Wang J, Zhu W, Wang F, Liu G (2014) Conditions for coverings to induce matroids. Int J Mach Learn Cybernet. doi:10.1007/s13042-014-0236-2
Wang S, Zhu Q, Zhu W, Min F (2012) Matroidal structure of rough sets and its characterization to attribute reduction. Knowl Based Syst 35:155–161
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–491
Wu W, Leung Y, Mi J (2005) On characterizations of (I, T)-fuzzy rough approximation operators. Fuzzy Sets Syst 154:76–102
Xu W, Zhang W (2007) Measuring roughness of generalized rough sets induced by a covering. Fuzzy Sets Syst 158:2443–2455
Xu Z, Wang Q (2005) On the properties of covering rough sets model. J Henan Normal Univ (Nat Sci) 33:130–132
Yamak S, Kazanci O, Davvaz B (2011) Soft hyperstructure. Computers Math Appl 62:797–803
Yang T, Li Q, Zhou B (2013) Related family: a new method for attribute reduction of covering information systems. Inf Sci 228:175–191
Yao H, Zhu W, Wang F (2014) Secondary basis unique augmentation matroids and union minimal matroids. Int J Mach Learn Cybernet. doi:10.1007/s13042-014-0237-1
Yao YY (1998) Relational interpretations of neighborhood operators and rough set approximation operators. Inf Sci 111:239–259
Yao YY, Yao B (2012) Covering based rough set approximations. Inf Sci 200:91–107
Yun Z, Ge X, Bai X (2011) Axiomatization and conditions for neighborhoods in a covering to form a partition. Inf Sci 181:1735–1740
Zakowski W (1983) Approximations in the space \((u, \pi )\). Demonstratio Math 16:761–769
Zhang Y, Luo M (2013) Relationships between covering-based rough sets and relation-based rough sets. Inf Sci 225:55–71
Zhu P (2011) Covering rough sets based on neighborhoods: an approach without using neighborhoods. Int J Approx Reason 52:461–472
Zhu W (2007) Topological approaches to covering rough sets. Inf Sci 177:1499–1508
Zhu W (2009) Relationship between generalized rough sets based on binary relation and covering. Inf Sci 179:210–225
Zhu W, Wang F (2003) Reduction and axiomization of covering generalized rough sets. Inf Sci 152:217–230
Zhu W, Wang S (2011) Matroidal approaches to generalized rough sets based on relations. Int J Mach Learn Cybernet 2(4):273–279
Acknowledgments
This work is in part supported by the National Natural Science Foundation of China under Grant Nos. 61170128, 61379049, and 61379089, the Natural Science Foundation of Fujian Province, China under Grant No. 2012J01294, the Fujian Province Foundation of Higher Education under Grant No. JK2012028, the Key Project of Education Department of Fujian Province under Grant No. JA13192, and the Zhangzhou Municipal Natural Science Foundation under Grant No. ZZ2013J03.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Yao, H., Zhu, W. Applications of repeat degree to coverings of neighborhoods. Int. J. Mach. Learn. & Cyber. 7, 931–941 (2016). https://doi.org/10.1007/s13042-014-0287-4
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s13042-014-0287-4