Skip to main content
Springer Nature Link
Log in

On Covering Based Approximations of Classifications of Sets

  • Conference paper
Next-Generation Applied Intelligence (IEA/AIE 2009)

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

Abstract

Approximations of classifications, introduced and studied by Grzymala Busse [4], and approximations of sets are two different issues (Pawlak [9]) and the equivalence classes of approximate classifications can not be arbitrary sets. Busse [4] had established properties of approximations of classifications which were recently extended to necessary and sufficient type theorems by Tripathy et al. [12]. Recently, basic rough sets have been extended to introduce covering based rough sets. In this paper we introduce the notion of covering based approximations of classifications and study their properties.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

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

    Article  MATH  Google Scholar 

  2. Degang, C., Changzhong, W., Qinghua, H.: A new approach to attribute reduction of consistent and inconsistent covering decision systems with covering rough sets. J. Information Sciences 177, 3500–3518 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  3. Degang, C., Wenxiu, Z., Yeung, D., Tsang, E.C.C.: Rough Approximations on a complete completely distributive lattice with applications to generalized rough sets. J. Information Sciences 176, 1829–1848 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  4. Grzymala-Busse, J.: Knowledge acquisition under uncertainty – a rough set approach. J. Intelligent and Robotics Systems 1, 3–16 (1988)

    Article  MathSciNet  Google Scholar 

  5. Novotny, M., Pawlak, Z.: Black Box Analysis and Rough Top Equality. Bull. Polish Acad. Sci. Math. 33, 105–113 (1985)

    MathSciNet  MATH  Google Scholar 

  6. Novotny, M., Pawlak, Z.: Characterization of Rough Top Equalities and Rough Bottom Equalities. Bulletin Polish Acad. Sci. Math. 33, 91–97 (1985)

    MathSciNet  MATH  Google Scholar 

  7. Novotny, M., Pawlak, Z.: On Rough Equalities. Polish Acad. Sci. Math. 33, 99–104 (1985)

    MathSciNet  MATH  Google Scholar 

  8. Pawlak, Z.: Rough Sets. J. Inf. Comp. Sc. II, 341–356 (1982)

    Google Scholar 

  9. Pawlak, Z.: Rough Sets-Theoretical Aspects of Reasoning about Data. Kluwer Acad. Publ., Dordrecht (1991)

    MATH  Google Scholar 

  10. Pawlak, Z., Skowron, A.: Rough sets some extensions. J. Information Sciences 177(1), 28–40 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  11. Tripathy, B.K., Mohanty, D., Ojha, J.: On Rough Definability and Types of Approximation of Classification. In: IEEE International Conference to be held in Thapper Engg. College, Patiala from March 5-7 (2009)

    Google Scholar 

  12. Tripathy, B.K., Mohanty, D., Ojha, J.: On Rough Approximations of Classifications and Representation of Knowledge. In: Communicated to 1st IIM International Conference on Advanced Data Analysis, Business Analytics and Intelligence, June 6-7 (2009)

    Google Scholar 

  13. Zakowski, W.: Approximation in space. J. Demonstratio Mathematica 16, 761–769 (1983)

    Google Scholar 

  14. Zhu, W., Wang, F.Y.: Reduction and Axiomization of Covering Generalized Rough sets. J. Information Sciences 152, 217–230 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  15. Zhu, W., Wang, F.Y.: Relationships among Three Types of Covering Rough Sets. In: IEEE GrC 2006, pp. 43–48. IEEE Press, Los Alamitos (2006)

    Google Scholar 

  16. Zhu, W.: Basic Concepts in Covering-based Rough Sets. In: 3rd IEEE International Conference on Natural Computation. IEEE Computer Society, Los Alamitos (2007)

    Google Scholar 

  17. Zhu, W.: Topological Approaches to Covering Rough Sets. J. Information Sciences 177, 1499–1508 (2007)

    Google Scholar 

  18. Zhu, W.: On Three Types of Covering-Based Rough Sets. IEEE Transactions on Knowledge and Data Engineering 19(8), 1131–1143 (2007)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Professor, SCS, VIT University, Vellore, 632014, Tamilnadu, India

    B. K. Tripathy

  2. Director, MITS School of Biotechnology, Bhubaneswar, 760024, Orissa, India

    G. K. Panda

Authors
  1. B. K. Tripathy
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. G. K. Panda
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Information Engineering, National University of Tainan, 700, Tainan, Taiwan

    Been-Chian Chien

  2. Department of Computer Science and Information Engineering, National University of Kaohsiung, Kaohsiung, Taiwan

    Tzung-Pei Hong

  3. Department of Computer Science and Information Engineering, National Taiwan University of Science and Technology, Taipei, Taiwan

    Shyi-Ming Chen

  4. Department of Computer Science, Texas State University-San Marcos, 601 University Drive, 78666-4616, San Marcos, TX, USA

    Moonis Ali

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tripathy, B.K., Panda, G.K. (2009). On Covering Based Approximations of Classifications of Sets. In: Chien, BC., Hong, TP., Chen, SM., Ali, M. (eds) Next-Generation Applied Intelligence. IEA/AIE 2009. Lecture Notes in Computer Science(), vol 5579. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02568-6_79

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-02568-6_79

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-02567-9

  • Online ISBN: 978-3-642-02568-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics