Skip to main content
SpringerLink
Log in

Rough Matroids Based on Dual Approximation Operators

  • Conference paper
  • First Online:
Rough Sets (IJCRS 2019)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 11499))

Included in the following conference series:

Abstract

This paper presents the concept of lower and upper rough matroids based on approximation operators for covering-based rough sets. This concept is a generalization of lower and upper rough matroids based on coverings. A new definition of lower and upper definable sets related with an approximation operator is presented and these definable sets are used for defining rough matroids based on an approximation operator. Finally, an order relation for a special type of rough matroids is established from the order relation among approximation operators.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Bonikowski, Z., Brynarski, E.: Extensions and intentions in rough set theory. Inf. Sci. 107, 149–167 (1998)

    Article  MathSciNet  Google Scholar 

  2. D’Eer, L., Restrepo, M., Cornelis, C., Gómez, J.: Neighborhood operators for covering-based rough sets. Inf. Sci. 336, 21–44 (2016)

    Article  Google Scholar 

  3. Järvinen, J.: Lattice theory for rough sets. In: Peters, J.F., Skowron, A., Düntsch, I., Grzymała-Busse, J., Orłowska, E., Polkowski, L. (eds.) Transactions on Rough Sets VI, Part I. LNCS, vol. 4374, pp. 400–498. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-71200-8_22

    Chapter  MATH  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  5. Li, Y., Wang, Z.: The relationships between degree rough sets and matroids. An. Fuzzy Math. Inform. 12(1), 139–153 (2012)

    MathSciNet  MATH  Google Scholar 

  6. Liu, Y., Zhu, W.: Relation matroid and its relationship with generalized rough set based on relations. CoRR, abs 1209.5456 (2012)

    Google Scholar 

  7. Liu, Y., Zhu, W., Zhang, Y.: Relationship between partition matroids and rough sets through \(k\)-rank matroids. J. Inf. Comput. Sci. 9, 2151–2163 (2012)

    Google Scholar 

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

    Article  Google Scholar 

  9. Pomykala, J.A.: Approximation operations in approximation space. Bull. Acad. Pol. Sci. 35(9–10), 653–662 (1987)

    MathSciNet  MATH  Google Scholar 

  10. Restrepo, M., Cornelis, C., Gómez, J.: Duality, conjugacy and adjointness of approximation operators in covering-based rough sets. Int. J. Approx. Reason. 55, 469–485 (2014)

    Article  MathSciNet  Google Scholar 

  11. Restrepo, M., Cornelis, C., Gómez, J.: Partial order relation for approximation operators in covering-based rough sets. Inf. Sci. 284, 44–59 (2014)

    Article  MathSciNet  Google Scholar 

  12. Tsang, E., Chen, D., Lee J., Yeung, D.S.: On the upper approximations of covering generalized rough sets. In: Proceedings of the 3rd International Conference on Machine Learning and Cybernetics, pp. 4200–4203 (2004)

    Google Scholar 

  13. Wang, S., Zhu, W., Min, F.: Transversal and function matroidal structures of covering-based rough sets. In: Yao, J.T., Ramanna, S., Wang, G., Suraj, Z. (eds.) RSKT 2011. LNCS (LNAI), vol. 6954, pp. 146–155. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-24425-4_21

    Chapter  Google Scholar 

  14. Wybraniec-Skardowska, U.: On a generalization of approximation space. Bull. Pol. Acad. Sci. Math. 37, 51–61 (1989)

    MathSciNet  MATH  Google Scholar 

  15. Wu, M., Wu, X., Shen, T.: A new type of covering approximation operators. In: IEEE International Conference on Electronic Computer Technology, pp. 334–338 (2009)

    Google Scholar 

  16. Wang, S., Zhu, Q., Zhu, W., Min, F.: Matroidal structure of rough sets and its characterization to attribute reduction. Knowl. Based Syst. 54, 155–161 (2012)

    Article  Google Scholar 

  17. Xu, Z., Wang, Q.: On the properties of covering rough sets model. J. Henan Normal Univ. (Nat. Sci.) 33(1), 130–132 (2005)

    MathSciNet  MATH  Google Scholar 

  18. Yang, T., Li, Q.: Reduction about approximation spaces of covering generalized rough sets. Int. J. Approx. Reason. 51, 335–345 (2010)

    Article  MathSciNet  Google Scholar 

  19. Yang, B., Zhao, H., Zhu, W.: Rough matroids based on covering. In: Proceedings of Sixth IEEE International Conference on Data Mining - Workshops, pp. 407–411 (2013)

    Google Scholar 

  20. Yao, Y.Y.: Constructive and algebraic methods of the theory of rough sets. Inf. Sci. 109, 21–47 (1998)

    Article  MathSciNet  Google Scholar 

  21. Yao, Y., Yao, B.: Covering based rough sets approximations. Inf. Sci. 200, 91–107 (2012)

    Article  MathSciNet  Google Scholar 

  22. Zakowski, W.: Approximations in the space \((u,\pi )\). Demonstr. Math. 16, 761–769 (1983)

    MathSciNet  MATH  Google Scholar 

  23. Zhu, W.: Properties of the first type of covering-based rough sets. In: Proceedings of Sixth IEEE International Conference on Data Mining - Workshops, pp. 407–411 (2006)

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

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

    Article  Google Scholar 

  26. Zhu, W., Wang, F.: A new type of covering rough set. In: Proceedings of Third International IEEE Conference on Intelligence Systems, pp. 444–449 (2006)

    Google Scholar 

  27. Zhu, W., Wang, S.: Rough matroids. In: IEEE International Conference on Granular Computing, pp. 817–8221 (2011)

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgement

This work was supported by Universidad Militar Nueva Granada’s Special Research Fund, under project CIAS 2948-2019 and by the Odysseus program of the Research Foundation-Flanders.

Author information

Authors and Affiliations

  1. Universidad Militar Nueva Granada, Bogotá, Colombia

    Mauricio Restrepo

  2. Ghent University, Ghent, Belgium

    Chris Cornelis

Authors
  1. Mauricio Restrepo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chris Cornelis
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mauricio Restrepo .

Editor information

Editors and Affiliations

  1. University of Debrecen, Debrecen, Hungary

    Tamás Mihálydeák

  2. Southwest Petroleum University, Chengdu, China

    Fan Min

  3. Chongqing University of Posts and Telecommunications, Chongqing, China

    Guoyin Wang

  4. Indian Institute of Technology Kanpur, Kanpur, India

    Mohua Banerjee

  5. Fujian Normal University, Fuzhou, China

    Ivo Düntsch

  6. University of Rzeszów, Rzeszow, Poland

    Zbigniew Suraj

  7. University of Milano-Bicocca, Milan, Italy

    Davide Ciucci

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Restrepo, M., Cornelis, C. (2019). Rough Matroids Based on Dual Approximation Operators. In: Mihálydeák, T., et al. Rough Sets. IJCRS 2019. Lecture Notes in Computer Science(), vol 11499. Springer, Cham. https://doi.org/10.1007/978-3-030-22815-6_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-22815-6_10

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-22814-9

  • Online ISBN: 978-3-030-22815-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation