Skip to main content
Log in

On the matroidal structure of generalized rough set based on relation via definable sets

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

Abstract

Recently, an interesting and natural research topic is to study rough set theory via matroid theory. We can introduce matroidal approaches to rough set theory and rough set methods to matroid theory which have deepened theoretical and practical significance of these two theories. In this paper, we present a systematical study on some matroidal structures of generalized rough sets based on relations. Main results are: (1) any serial relation can induce a matroid, and the upper approximation operator of the relation is not equal to the matroidal closure operator; (2) similarly, any reflexive relation can induce a matroid, and it is proved that the matroidal structure induced by any reflexive relation is equal to one induced by the symmetric (transitive, symmetric and transitive, transitive and symmetric, or equivalence) closure of the relation; (3) when a relation is reflexive, the upper approximation operator of its equivalence closure is the closure operator of the matroid induced by the relation; (4) based on the above conclusions, we prove there is a one-to-one correspondence between the upper approximation operator induced by any equivalence relation and the closure operator of any 2-circuit matroid.

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. Diker M (2012) Definability and textures. Int J Approx Reason 53(4):558–572

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  3. Kondo M (2006) On the structure of generalized rough sets. Inf Sci 176(5):589–600

    Article  MathSciNet  MATH  Google Scholar 

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

    Google Scholar 

  5. Li X, Liu S (2010) A new approach to the axiomatization of rough sets. In: seventh international conference on fuzzy systems and knowledge discovery, vol. 4, pp 1936–1939

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

  7. Lin TY, Liu Q (1994) Rough approximate operators: axiomatic rough set theory. In: Ziarko W (ed) Rough sets, fuzzy sets and knowledge discovery. Springer, New York, pp 256–260

    Chapter  Google Scholar 

  8. Liu Y, Zhu W (2012) Matroidal structure of rough sets based on serial and transitive relations. J Appl Math. Article ID 429737

  9. Liu Y, Zhu W (2015) Parametric matroid of rough set. Int J Uncertain Fuzziness Knowl Based Syst (to appear)

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

    Article  MathSciNet  MATH  Google Scholar 

  11. Marek VW, Skowron A (2014) Rough sets and matroids, transactions on rough sets XVII. Springer, Heidelberg

    MATH  Google Scholar 

  12. Min F, He H, Qian Y, Zhu W (2011) Test-cost-sensitive attribute reduction. Inf Sci 181(22):4928–4942

    Article  Google Scholar 

  13. Min F, Zhu W (2012) Attribute reduction of data with error ranges and test costs. Inf Sci 211:48–67

    Article  MathSciNet  MATH  Google Scholar 

  14. Oxley JG (2006) Matroid theory. Oxford University Press, Oxford

    MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Book  MATH  Google Scholar 

  17. Rajagopal P, Masone J (1992) Discrete mathematics for computer science. Saunders College, Toronto

    Google Scholar 

  18. Tang J, She K, Min F, Zhu W (2013) A matroidal approach to rough set theory. Theor Comput Sci 471:1–11

    Article  MathSciNet  MATH  Google Scholar 

  19. Tsang E, Chen D, Yeung D, Wang X, Lee J (2008) Attributes reduction using fuzzy rough sets. IEEE Trans Fuzzy Syst 16(5):1130–1141

    Article  Google Scholar 

  20. Tsumoto S (2002) Rule and matroid theory, In: Computer software and applications conference, pp 1176–1181

  21. Tsumoto S, Tanaka H (1993) AQ, rough sets, and matroid theory. In: Rough sets, fuzzy sets and knowledge discovery, Springer, pp. 290–297

  22. Tsumoto S, Tanaka H (1996) A common algebraic framework of empirical learning methods based on rough sets and matroid theory. Fundam Inform 27(2):273–288

    MathSciNet  MATH  Google Scholar 

  23. Wang X, Tsang E, Zhao S, Chen D, Yeung D (2007) Learning fuzzy rules from fuzzy samples based on rough set technique. Inf Sci 177(20):4493–4514

    Article  MathSciNet  MATH  Google Scholar 

  24. Wang X, Zhai J, Lu S (2008) Induction of multiple fuzzy decision trees based on rough set technique. Inf Sci 178(16):3188–3202

    Article  MathSciNet  MATH  Google Scholar 

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

  26. Wang J, Zhu W (2013) Applications of matrices to a matroidal structure of rough sets. J Appl Math. Article ID 493201

  27. Wang S, Zhu W, Zhu Q, Min F (2012) Characteristics of 2-circuit matroids through rough sets. In: IEEE international conference on granular computing (GrC), 2012, pp 771–774

  28. Yang L, Xu L (2009) Algebraic aspects of generalized approximation spaces. Int J Approx Reason 51(1):151–161

    Article  MathSciNet  MATH  Google Scholar 

  29. Yang L, Xu L (2011) Topological properties of generalized approximation spaces. Inf Sci 181(17):3570–3580

    Article  MathSciNet  MATH  Google Scholar 

  30. Yao YY (1996) Two views of the theory of rough sets in finite universes. Int J Approx Reason 15:291–317

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  32. Yu H, Zhan W (2014) On the topological properties of generalized rough sets. Inf Sci 263:141–152

    Article  MathSciNet  MATH  Google Scholar 

  33. Zhang S, Wang X, Feng T, Feng L (2011) Reduction of rough approximation space based on matroid. Int Conf Mach Learn Cybern 2:267–272

    Google Scholar 

  34. Zhang X, Dai J, Yu Y (2015) On the union and intersection operations of rough sets based on various approximation spaces. Inf Sci 292:214–229

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  37. Zhu W, Wang S (2013) Rough matroids based on relations. Inf Sci 232:241–252

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgments

This work is in part supported by the National Science Foundation of China under Grant Nos. 61170128, 61379049, 61379089 and 61440047.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yanfang Liu.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Liu, Y., Zhu, W. On the matroidal structure of generalized rough set based on relation via definable sets. Int. J. Mach. Learn. & Cyber. 7, 135–144 (2016). https://doi.org/10.1007/s13042-015-0422-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s13042-015-0422-x

Keywords

Navigation