Skip to main content
Log in

Matroidal approaches to generalized rough sets based on relations

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

Abstract

Rough set theory is a useful tool for dealing with the vagueness, granularity and uncertainty in information systems. This paper connects generalized rough sets based on relations with matroid theory. We define the upper approximation number to induce a matroid from a relation. Therefore, many matroidal approaches can be used to study generalized rough sets based on relations. Specifically, with the rank function of the matroid induced by a relation, we construct a pair of approximation operators, namely, matroid approximation operators. The matroid approximation operators present some unique properties which do not exist in the existing approximation operators. On the other hand, we present an approach to induce a relation from a matroid. Moreover, the relationship between two inductions is studied.

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

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

    Article  MathSciNet  MATH  Google Scholar 

  2. Zadeh LA (1965) Fuzzy sets. Inf Control 8:338–353

    Article  MathSciNet  MATH  Google Scholar 

  3. Wang F (2005) On the abstraction of conventional dynamic systems: from numerical analysis to linguistic analysis. Inf Sci 171:233–259

    Article  MATH  Google Scholar 

  4. Wang F (1998) Outline of a computational theory for linguistic dynamic systems: toward computing with words. Int J Intell Control Syst 2:211–224

    Google Scholar 

  5. Zadeh L (1996) Fuzzy logic = computing with words. IEEE Trans Fuzzy Syst 4:103–111

    Article  Google Scholar 

  6. Biggio B, Fumera G, Roli F (2011) Multiple classifier systems for robust classifier design in adversarial environments. Int J Mach Learn Cybern 1:27–41

    Article  Google Scholar 

  7. Hu Q, Pan W, An S, Ma P, Wei J (2011) An efficient gene selection technique for cancer recognition based on neighborhood mutual information. Int J Mach Learn Cybern 1:63–74

    Article  Google Scholar 

  8. Yi W, lu M, Liu Z (2011) Multi-valued attribute and multi-labeled data decision tree algorithm. Int J Mach Learn Cybern 2:67–74

    Article  Google Scholar 

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

    Article  MATH  Google Scholar 

  10. Zhu W (2007) Generalized rough sets based on relations. Inf Sci 177:4997–5011

    Article  MATH  Google Scholar 

  11. Dai J, Chen W, Pan Y (2004) A minimal axiom group for rough set based on quasi-ordering. J Zhejiang Univ Sci 5:810–815

    Article  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  13. Slowinski R, Vanderpooten D (2000) A generalized definition of rough approximations based on similarity. IEEE Trans Knowl Data Eng 12:331–336

    Article  Google Scholar 

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

    Article  MATH  Google Scholar 

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

    Article  Google Scholar 

  16. Liu G, Zhu W (2008) The algebraic structures of generalized rough set theory. Inf Sci 178:4105–4113

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

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

    Article  Google Scholar 

  19. Zhu W, Wang F (2007) Topological properties in covering-based rough sets. In: Fuzzy Systems and Knowledge Discovery, vol 1. pp 289–293

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

    Article  MATH  Google Scholar 

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

  22. Yao Y (2007) Neighborhood systems and approximate retrieval. Inf Sci 176:3431–3452

    Article  Google Scholar 

  23. Dubois D, Prade H (1990) Rough fuzzy sets and fuzzy rough sets. Int J Gen Syst 17:191–209

    Article  MATH  Google Scholar 

  24. Qin K, Pei Z (2005) On the topological properties of fuzzy rough sets. Fuzzy Sets Syst 151:601–613

    Article  MathSciNet  MATH  Google Scholar 

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

Download references

Acknowledgements

This work is in part supported by National Nature Science Foundation of China under grant No.60873077/F020107.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Shiping Wang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhu, W., Wang, S. Matroidal approaches to generalized rough sets based on relations. Int. J. Mach. Learn. & Cyber. 2, 273–279 (2011). https://doi.org/10.1007/s13042-011-0027-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s13042-011-0027-y

Keywords

Navigation