Skip to main content

Local Approximations

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 5788))

Abstract

In this paper we analyze the basic concepts of rough set theory, lower and upper approximations, defined in an approximation space \((U,\textbf{L})\), where U is a nonempty and finite set and L is a fixed family of subsets of U. Some definitions of such lower and upper approximations are well known, some are presented in this paper for the first time. Our new definitions better accommodate applications to mining incomplete data, i.e., data with missing attribute values. An illustrative example is also presented in this paper.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Demri, S., Orlowska, E.: Incomplete Information: Structure, Inference, Complexity. Springer, Heidelberg (2002)

    Book  MATH  Google Scholar 

  2. Grzymala-Busse, J.W.: Characteristic relations for incomplete data: A generalization of the indiscernibility relation. In: Tsumoto, S., Słowiński, R., Komorowski, J., Grzymała-Busse, J.W. (eds.) RSCTC 2004. LNCS (LNAI), vol. 3066, pp. 244–253. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  3. Grzymala-Busse, J.W.: Incomplete data and generalization of indiscernibility relation, definability, and approximations. In: Ślęzak, D., Wang, G., Szczuka, M.S., Düntsch, I., Yao, Y. (eds.) RSFDGrC 2005. LNCS (LNAI), vol. 3641, pp. 244–253. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  4. Grzymala-Busse, J.W., Rzasa, W.: Definability of approximations for a generalization of the indiscernibility relation. In: Proceedings of the 2007 IEEE Symposium on Foundations of Computational Intelligence (FOCI 2007), pp. 65–72 (2007)

    Google Scholar 

  5. Grzymala-Busse, J.W., Rzasa, W.: Approximation space and LEM2-like algorithms for computing local coverings. Fundamenta Informaticae 10, 205–217 (2008)

    MathSciNet  MATH  Google Scholar 

  6. Grzymala-Busse, J.W., Rzasa, W.: Definability and other properties of approximations for generalized indiscernibility relations. The Transactions on Rough Sets 10 (accepted)

    Google Scholar 

  7. Kryszkiewicz, M.: Rough set approach to incomplete information systems. In: Proceedings of the Second Annual Joint Conference on Information Sciences, pp. 194–197 (1995)

    Google Scholar 

  8. Kryszkiewicz, M.: Rules in incomplete information systems. Information Sciences 113, 271–292 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  9. Lin, T.Y.: Neighborhood systems and approximation in database and knowledge base systems. In: Proceedings of the 4-th International Symposium on Methodologies of Intelligent Systems, Poster Session Program, pp. 75–86 (1989)

    Google Scholar 

  10. Pomykala, J.A.: Approximation operations in approximation space. Bulletin of the Polish Academy of Science Mathematics 35, 653–662 (1987)

    MathSciNet  MATH  Google Scholar 

  11. Pomykala, J.A.: On definability in the nondeterministic information system. Bulletin of the Polish Academy of Science Mathematics 36, 193–210 (1988)

    MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  13. Skowron, A., Stepaniuk, J.: Tolerance approximation space. Fundamenta Informaticae 27, 245–253 (1996)

    MathSciNet  MATH  Google Scholar 

  14. Slowinski, R., Vanderpooten, D.: A generalized definition of rough approximations based on similarity. IEEE Transactions on Knowledge and Data Engineering 12, 331–336 (2000)

    Article  Google Scholar 

  15. Stefanowski, J., Tsoukias, A.: On the extension of rough sets under incomplete information. In: Zhong, N., Skowron, A., Ohsuga, S. (eds.) RSFDGrC 1999. LNCS (LNAI), vol. 1711, pp. 73–82. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  16. Stefanowski, J., Tsoukias, A.: Incomplete information tables and rough classification. Computational Intelligence 17, 545–566 (2001)

    Article  MATH  Google Scholar 

  17. Wang, G.: Extension of rough set under incomplete information systems. In: Proceedings of the IEEE International Conference on Fuzzy Systems (FUZZ_IEEE 2002), pp. 1098–1103 (2002)

    Google Scholar 

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

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Grzymala-Busse, J.W., Rzasa, W. (2009). Local Approximations. In: Corchado, E., Yin, H. (eds) Intelligent Data Engineering and Automated Learning - IDEAL 2009. IDEAL 2009. Lecture Notes in Computer Science, vol 5788. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04394-9_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-04394-9_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-04393-2

  • Online ISBN: 978-3-642-04394-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics