Skip to main content
SpringerLink
Log in

Closed-set lattice and modular matroid induced by covering-based rough sets

  • Original Article
  • Published:
International Journal of Machine Learning and Cybernetics Aims and scope Submit manuscript

Abstract

Covering is a common form of data representation, and covering-based rough sets, a technique of granular computing, provide an effective tool to deal with this type of data. However, many important problems of covering-based rough sets, such as covering reduction, are NP-hard so that most algorithms to solve them are greedy ones. Matroid theory, based on linear algebra and graph theory, provides well-established platforms for greedy algorithms. Lattice has been widely used in diverse fields, especially algorithm design, which plays an important role in covering reduction. Therefore, it is necessary to integrate covering-based rough sets with matroid and lattice. In this paper, we construct three types of matroids through covering-based rough sets and investigate their modularity. Moreover, we investigate some characteristics of these types of closed-set lattices induced by these three types of matroids and the relationships among these closed-set lattices. First, based on covering-based rough sets, three families of sets are constructed and proved to satisfy independent set axiom of matroids. So three types of matroids are induced by covering-based rough sets in this way. Second, some characteristics of these matroids, such as rank function, closure operator and closed set, are presented. Moreover, we investigate the characteristics of these closed-set lattices induced by these three types of matroids, such as modular pair, modular element. Finally, the relationships among these closed-set lattices induced by these three types of matroids are investigated. Especially, we prove that these three types of matroids induced by covering-based rough sets are all modular matroids.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1

Similar content being viewed by others

References

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

    Article  MathSciNet  MATH  Google Scholar 

  2. Birhoff G (1995) Lattice Theory. American Mathematical Society, Rhode Island

    Google Scholar 

  3. 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:3500–3518

    Article  MathSciNet  MATH  Google Scholar 

  4. 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

    Article  MathSciNet  MATH  Google Scholar 

  5. Davvaz B (2006) Roughness based on fuzzy ideals. Inf Sci 176:2417–2437

    Article  MathSciNet  MATH  Google Scholar 

  6. Du Y, Hu Q (2011) Rule learning for classication based on neighborhood covering reduction. Inf Sci 181:5457–5467

    Article  Google Scholar 

  7. Edmonds J (1971) Matroids and the greedy algorithm. Math Program 1:127–136

    Article  MathSciNet  MATH  Google Scholar 

  8. Estaji A, Hooshmandasl M, Davva B (2012) Rough set theory applied to lattice theory. Inf Sci 200:108–122

    Article  MathSciNet  MATH  Google Scholar 

  9. Fan M, Zhu W (2012) Attribute reduction of data with errorranges and test costs. Inf Sci 211:48–67

    Article  MATH  Google Scholar 

  10. Hall M, Holmes G (2003) Benchmarking attribute selection techniques for discrete class data mining. IEEE Trans Knowl Data Eng 15:1437–1447

    Article  Google Scholar 

  11. Hu Q, Liu J, Yu D (2007) Mixed feature selection based on granulation and approximation. Knowl Based Syst 21:294–304

    Article  Google Scholar 

  12. Hu Q, Yu D, Liu J, Wu C (2008) Neighborhood rough set based heterogeneous feature subset selection. Inf Sci 178:3577–3594

    Article  MathSciNet  MATH  Google Scholar 

  13. Hu Q, Zhang L, Zhang D, Pan W, An S, Pedrycz W (2011) Measuring relevance between discrete and continuous features based on neighborhood mutual information. Expert Syst Appl 38:10737–10750

    Article  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  15. Kryszkiewicz M (1998) Rules in incomplete information systems. Inf Sci 113:271–292

    Article  MathSciNet  MATH  Google Scholar 

  16. Huang A, Zhu W (2012) Geometric lattice structure of covering-based rough sets through matroids. J Appl Math 2012:1–25

    MathSciNet  MATH  Google Scholar 

  17. Huang A, Lin Z, Zhu W (2014) Matrix approaches to rough sets through vector matroids over fields. Int J Granul Comput Rough Sets Intell Syst 3:179–194

    Article  Google Scholar 

  18. Li F, Yin Y (2009) Approaches to knowledge reduction of covering decision systems based on information theory. Inf Sci 179:1694–1704

    Article  MathSciNet  MATH  Google Scholar 

  19. Li H, Zhang W, Wang H (2006) Classification and reduction of attributes in concept lattices. In: Granular Computing, pp 142–147

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

    Article  MathSciNet  MATH  Google Scholar 

  21. Liu G, Sai Y (2010) Invertible approximation operators of generalized rough sets and fuzzy rough sets. Inf Sci 180:2221–2229

    Article  MathSciNet  MATH  Google Scholar 

  22. Lai H (2001) Matroid theory. Higher Education Press, Beijing

    Google Scholar 

  23. Li T (2006) Rough approximation operators in covering approximation spaces. In: Rough Sets and Current Trends in Computing of LNAI, vol 4259, pp 174–182

  24. Li X, Liu S (2012) Matroidal approaches to rough set theory via closure operators. Int J Approx Reason 53:513–527

    Article  MATH  Google Scholar 

  25. Liu Y, Zhu W (2012) Characteristic of partition-circuit matroid through approximation number. In: Granular Computing, pp 314–319

  26. Li Q, Zhu W (2014) Closed-set lattice of regular sets based on a serial and transitive relation through matroids. Int J Mach Learn Cybern 5:395–401

    Article  Google Scholar 

  27. Lawler E (2001) Combinatorial optimization: networks and matroids. Dover Publications

  28. Meng Z, Shi Z (2009) A fast approach to attribute reduction in incomplete decision systems with tolerance relation-based rough sets. Inf Sci 179:2774–2793

    Article  MathSciNet  MATH  Google Scholar 

  29. Min F, Zhu W (2011) Attribute reduction with test cost constraint. J Electron Sci Technol China 9:97–102

    Google Scholar 

  30. Mao H (2006) The relation between matroid and concept lattice. Adv Math 35:361–365

    MathSciNet  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  32. 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–161

    Article  Google Scholar 

  33. Wang X, Tsang E, Chen D (2007) Learning fuzzy rules from fuzzys amples based on rough set technique. Inf Sci 177:4493–4514

    Article  MATH  Google Scholar 

  34. Wang S, Zhu P, Zhu W (2010) Structure of covering-based rough sets. Int J Math Comput Sci 6:147–150

    Google Scholar 

  35. 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

    Article  MathSciNet  MATH  Google Scholar 

  36. Wang S, Zhu W, Fan M (2011) The vectorially matroidal structure of generalized rough sets based on relations. In: Granular Computing, pp 708–711

  37. Tang J, She K, Zhu W (2012) Matroidal structure of rough sets from the view point of graph theory. J Appl Math 2012:1–27

    Article  Google Scholar 

  38. Zhong N, Dong JZ, Ohsuga S (2001) Using rough sets with heuristics to feature selection. J Intell Inf Syst 16:199–214

    Article  MATH  Google Scholar 

  39. Zhu W, Wang F (2006) Covering based granular computing for conflict analysis. In: Intelligence and Security Informatics of LNCS, vol 3975, pp 566–571

  40. Zhu W, Wang F (2006) Binary relation based rough set. In: Fuzzy Systems and Knowledge Discovery of LNAI, vol 4223, pp 276–285

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  43. Zhu W (2009) Relationship among basic concepts in covering-based rough sets. Inf Sci 179:2478–2486

    Article  MathSciNet  MATH  Google Scholar 

  44. Zhang W, Yao Y, Liang Y (2006) Rough set and concept lattice. Xi’an Jiaotong University Press

  45. Zhu W, Wang S (2011) Matroidal approaches to generalized rough sets based on relations. Int J Mach Learn Cybern 2:273–279

    Article  Google Scholar 

  46. Zhu W, Wang F (2006) Relationships among three types of covering rough sets. In: Granular Computing, pp 43–48

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

    Article  Google Scholar 

Download references

Acknowledgments

This work is in part supported by the National Science Foundation of China under Grant Nos. 61170128, 61379049, and 61379089, the Science and Technology Key Project of Fujian Province, China under Grant no. 2012H0043, the Fujian Province Foundation of Higher Education under Grant No. JK2012028, and the Project of Education Department of Fujian Province under Grant No. JA14194.

Author information

Authors and Affiliations

  1. Lab of Granular Computing, Minnan Normal University, Zhangzhou, 363000, China

    Lirun Su & William Zhu

Authors
  1. Lirun Su
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. William Zhu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to William Zhu.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Su, L., Zhu, W. Closed-set lattice and modular matroid induced by covering-based rough sets. Int. J. Mach. Learn. & Cyber. 8, 191–201 (2017). https://doi.org/10.1007/s13042-014-0314-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s13042-014-0314-5

Keywords

Search

Navigation