Skip to main content
SpringerLink
Log in

Extension of Covering Approximation Space and Its Application in Attribute Reduction

  • Conference paper
Rough Set and Knowledge Technology (RSKT 2010)

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

Included in the following conference series:

  • 934 Accesses

Abstract

The concept of the complement of a covering is introduced firstly, and then the complement space and extended space of a covering approximation space is defined based on it. It is proved that a covering approximation space will generate the same covering lower and upper approximations as its complement space and extended space if the covering is degenerated to a partition. Moreover, the extended space of a covering approximation space often generate a bigger covering lower approximation or smaller covering upper approximation than itself. Through extending each covering in a covering decision system, the classification ability of each covering is improved. Thus, a heuristic reduction algorithm is developed to eliminate some coverings in a covering decision system without decreasing the classification ability of the system for decision. Theoretic analysis and example illustration indicate that this algorithm can get shorter reduction than other algorithms.

This paper is supported by the National Natural Science Foundation of P. R. China (No.60773113), the Science & Technology Research Program of Chongqing Education Committee of P. R. China (No.KJ090512), the Natural Science Foundation of Chongqing of P. R. China (No.2008BA2017), the Science Fund for Distinguished Young Scholars of Chongqing of P. R. China (No.2008BA2041).

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Pawlak, Z.: Rough set. International Journal of Computer and Information Sciences 11, 341–356 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  2. Kryszkiewicz, M.: Rough set approach to incomplete information systems. Information Science 112, 39–49 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  3. Slowinski, R., Vsnderpooten, D.: A generalized definition of rough approximations based on similarity. IEEE Tansactions on Knowledge and Data Engineering 12, 331–326 (2000)

    Google Scholar 

  4. Wang, G.Y.: Extension of rough set under incomplete information systems. Journal of Computer Research and Development 39, 1238–1243 (2002)

    Google Scholar 

  5. Zhu, W.: Generalized rough sets based on relations. Information Sciences 177, 4997–5011 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  6. Zakowski, W.: Approximation in the space (U, Π). Demonstratio Mathematica 16, 761–769 (1983)

    MATH  MathSciNet  Google Scholar 

  7. Bonikowski, Z., Bryniarski, E., Wybraniec, U.: Extensions and intentions in the rough set theory. Information Sciences 107, 149–167 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  8. Tsang, E.C.C., Chen, D.G., Lee, J.W.T., Yeung, D.S.: On the upper approximations of covering generalized rough sets. In: 3rd International Conference Machine Learning and Cybermetics, Shanghai, China, pp. 4200–4203 (2004)

    Google Scholar 

  9. Zhu, W., Wang, F.Y.: A new type of covering rough set. In: 3rd International IEEE Conference Intelligent Systems, London, pp. 444–449 (2006)

    Google Scholar 

  10. Zhu, W.: Topological approaches to covering rough sets. Information Sciences 177, 1499–1508 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  11. Zhu, W., Wang, F.Y.: On Three Types of Covering-Based Rough Sets. IEEE Transactions on Knowledge and Data Engineering 19, 1131–1144 (2007)

    Article  Google Scholar 

  12. Zhu, W., Wang, F.Y.: Reduction and axiomization of covering generalized rough sets. Information Sciences 152, 217–230 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  13. Hu, J., Wang, G.Y.: knowledge reduction of covering approximation space. Transction on Computer Science 5540, 69–80 (2009)

    Article  Google Scholar 

  14. Huang, B., He, X., Zhou, X.Z.: Rough entropy based on generalized rough sets covering reduction. Journal of Software 15, 215–220 (2004)

    MATH  MathSciNet  Google Scholar 

  15. Xu, W.H., Zhang, W.X.: Measuring roughness of generalized rough sets induced by a covering. Fuzzy sets and systems 158, 2443–2455 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  16. Wang, G.Y.: Rough set theory and knowledge acquisition. Xi’an Jiaotong University Press, Xi’an (2001)

    Google Scholar 

  17. Chen, D.G., Wang, C.Z., Hu, Q.H.: A new approach to attribute reduction of consistent and inconsistent covering decision systems with covering rough sets. Information Sciences 177, 3500–3518 (2007)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  19. Zhu, W.: Relationship between generalized rough sets based on binary relation and covering. Information Sciences 179, 210–225 (2009)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Science and Technology, Chongqing University of Posts and Telecommunications, Chongqing, 400065, P.R. China

    Guoyin Wang & Jun Hu

  2. School of Electronic Engineering, XiDian University, Xi’an, Shaanxi, 710071, P.R. China

    Jun Hu

Authors
  1. Guoyin Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jun Hu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computer and Information Technology, Beijing Jiaotong University, 100044, Beijing, China

    Jian Yu

  2. Faculty of Economics, University of Catania, Corso Italia, 55, 95129, Catania, Italy

    Salvatore Greco

  3. Department of Mathematics and Computing Science, Saint Mary’s University, B3H 3C3, Halifax, Nova Scotia, Canada

    Pawan Lingras

  4. Institute of Computer Science and Technology, Chongqing University of Posts and Telecommunications, 400065, Chongqing, China

    Guoyin Wang

  5. Institute of Mathematics, Warsaw University, Banacha 2, 02-097, Warsaw, Poland

    Andrzej Skowron

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wang, G., Hu, J. (2010). Extension of Covering Approximation Space and Its Application in Attribute Reduction. In: Yu, J., Greco, S., Lingras, P., Wang, G., Skowron, A. (eds) Rough Set and Knowledge Technology. RSKT 2010. Lecture Notes in Computer Science(), vol 6401. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16248-0_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-16248-0_27

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-16247-3

  • Online ISBN: 978-3-642-16248-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation