Skip to main content
SpringerLink
Log in

Introduction: What You Always Wanted to Know about Rough Sets

  • Chapter
Incomplete Information: Rough Set Analysis

Part of the book series: Studies in Fuzziness and Soft Computing ((STUDFUZZ,volume 13))

Abstract

In this chapter the major principles and the methodology of the rough set—style analysis of data are presented and discussed. A survey of various formalisms that provide the tools of this analysis is given. We discuss the aspects of incompleteness of information that can be handled in the presented formalisms. The formalisms are related to the methods and/or structures presented in this volume, in each case we point out a relevant link and we give the reference to the respective chapter.

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover 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. Balbiani, Ph. (1997) A modal logic for data analysis. Proceedings of the 21st International Symposium on Mathematical Foundations of Computer Science, Krakow, Poland, September 1996. Lecture Notes in Computer Science 1113, Springer, 167–179.

    Google Scholar 

  2. Baneerje, M. and Wasilewska, A. (1995) Rough sets and topological quasi—Boolean algebras. Proceedings of CSC’95 Workshop on Rough Sets and Database Mining, Nashville, Tennessee, USA, 54–59.

    Google Scholar 

  3. Bryniarski, E. and Wybraniec—Skardowska, U. (1997) Calculus of contextual rough sets in contextual spaces. Journal of Applied Non—Classical Logics, to appear.

    Google Scholar 

  4. Cattaneo, G. (1997) Generalized rough sets. Preclusivity fuzzy—intuitionistic ( BZ) lattices. Studia Logica 58, 47–77.

    Google Scholar 

  5. Cattaneo, G. and Nistico, G. (1989) Brouver—Zadeh posets and three—valued Lukasiewicz posets. Fuzzy Sets and Systems 33, 165–190.

    Article  MathSciNet  MATH  Google Scholar 

  6. Cattaneo, G., Dalla Chiara, M. L. and Giuntini, R. (1993) Fuzzy—intuitionistic quantum logics. Studia Logica 52, 1–24.

    Article  MathSciNet  Google Scholar 

  7. Corner, S. (1991) An algebraic approach to the approximation of information. Fundamenta Informaticae 14, 492–502.

    MathSciNet  Google Scholar 

  8. Czogala, E., Mrózek, A. and Pawlak, Z. (1995) The idea of rough-fuzzy controler. International Journal of Fuzzy Sets and Systems 72, 61–63.

    Article  Google Scholar 

  9. Czyzewski, A. (1997) Speaker—independent recognition of digits — experiments with neural networks, fuzzy logic and rough sets. Journal of the Intelligent Automation and Soft Computing, to appear.

    Google Scholar 

  10. Demri, S. (1996) Private communication.

    Google Scholar 

  11. Demri, S. (1996a) The validity problem for logic DALLA is decidable. Bulletin of the PAS, Mathematics, vol. 44, No 1, 79–86.

    MathSciNet  MATH  Google Scholar 

  12. Demri, S. (1996b) A class of information logics with a decidable validity problem. Proceedings of the 21st International Symposium on Mathematical Foundations of Computer Science, Krakow, Poland, September 1996. Lecture Notes in Computer Science 1113, Springer, 291–302

    Google Scholar 

  13. Demri, S. (1997) A completeness proof for a logic with an alternative necessity operator. Studia Logica 58, No 1, 99–112.

    Article  MathSciNet  MATH  Google Scholar 

  14. Demri, S. and Orlowska, E. (1996) Every finitely reducible logic has the finite model property with respect the class of —formulae. ICS Research Report 10/96, Warsaw University of Technology.

    Google Scholar 

  15. Demri, S. and Orlowska, E. (1996a) Logical analysis of indiscernibility. ICS Research Report 11/96, Warsaw University of Technology. Also in this volume.

    Google Scholar 

  16. Demri, S. and Orlowska, E. (1996b) Informational representability of models for information logics. ICS Research Report 9/96, Warsaw University of Technology. Extended abstract in: Proceedings of the First Online Workshop on Soft Computing, Nagoya, Japan, 1996, 139–144.

    Google Scholar 

  17. Demri, S. and Orlowska, E. (1996c) Informational representability of complementary relations. Manuscript.

    Google Scholar 

  18. Düntsch, I. (1994) Rough relation algebras. Fundamenta Informaticae 21, 321–331.

    MathSciNet  MATH  Google Scholar 

  19. Düntsch, I. (1997) A logic for rough sets. Theoretical Computer Science, to appear.

    Google Scholar 

  20. Düntsch, I. and Gediga, G. (1995) Rough set dependency analysis in evaluation studies: An application in the study of repeated heart attacks. Informatics Research Reports 10, University of Ulster, 25–30.

    Google Scholar 

  21. Düntsch, I. and Gediga, G. (1997) Algebraic aspects of attribute dependencies in information systems. Fundamenta Informaticae 29, 119–133.

    MathSciNet  MATH  Google Scholar 

  22. Düntsch, I. and Gediga, G. (1997a) Statistical evaluation of rough set dependency analysis. International Journal of Human—Computer Studies, to appear.

    Google Scholar 

  23. Farinas del Cerro, L. and Orlowska, E. (1985) DAL—a logic for data analysis. Theoretical Computer Science 36, 251–264. Corrigendum: ibidem 47, 1986, 345.

    Google Scholar 

  24. Gargov, G. (1986) Two completeness theorems in the logic for data analysis. ICS PAS Report 581, Warsaw.

    Google Scholar 

  25. Gargov, G., Passy, S. and Tinchev, T. (1987) Modal environment for Boolean speculations. In: Skordev, D. (ed) Mathematical Logic and Applications. Plenum Press, New York, 253–263.

    Chapter  Google Scholar 

  26. Goldblatt, R. (1993) Mathematics of Modality. CSLI Publications, Lecture Notes No. 43, Stanford, California, USA.

    Google Scholar 

  27. Grzymala—Busse, J. (1988) Knowledge acquisition under uncertainty — a rough set approach. Journal of Intelligent and Robotic Systems 1, 3–16.

    Article  MathSciNet  Google Scholar 

  28. Grzymala—Busse, J. (1992) LERS—a system for learning from examples based on rough sets. In [SI], 3–18.

    Google Scholar 

  29. Iwifski, T. (1987) Algebraic approach to rough sets. Bulletin of the PAS, Mathematics, vol 35, 673–683.

    Google Scholar 

  30. Jonsson, B. and Tarski, A. (1951) Boolean algebras with operators. Part I. American Journal of Mathematics 73, 891–939.

    Google Scholar 

  31. Jonsson, B. and Tarski, A. (1952) Boolean algebras with operators. Part II. American Journal of Mathematics 74, 127–162.

    Google Scholar 

  32. Katzberg, J. and Ziarko, W. (1996) Variable precision extension of rough sets. Fundamenta Informaticae 27, 155–168.

    MathSciNet  MATH  Google Scholar 

  33. Konikowska, B. (1987) A formal language for reasoning about indiscernibility. Bulletin of the PAS, Mathematics, vol 35, 239–249.

    Google Scholar 

  34. Konikowska, B. (1997a) A logic for reasoning about relative similarity. Studia Logica 58, 185–226.

    Article  MathSciNet  MATH  Google Scholar 

  35. Konrad, E., Orlowska, E. and Pawlak, Z. (1981) Knowledge representation systems. ICS PAS Report 433.

    Google Scholar 

  36. Kostek, B. (1997) Rough set and fuzzy set methods applied to acoustical analyses. Journal of the Intelligent Automation and Soft Computing, to appear.

    Google Scholar 

  37. Krysinski, J. (1995) Rough sets in the analysis of the structure—activity relationships of antifungal imidazolium compounds. Journal of Pharmaceutical Sciences 84, 243–247.

    Article  Google Scholar 

  38. Lin, T. Y. and Wildberger, A. M. (eds) (1994) Proceedings of the 3rd International Workshop on Rough Sets and Soft Computing, San Jose, USA, November 1994.

    Google Scholar 

  39. Nowicki, R., Slowinski, R. and Stefanowski, S. (1992) Rough set analysis of diagnostic capacity of vibroacoustic symptoms. Journal of Computers and Mathematics with Applications 24, 109–123.

    Article  MATH  Google Scholar 

  40. Orlowska, E. (1983) Semantics of vague concepts. In: Dorn, G. and Weingartner, P. (eds) Foundations of Logic and Linguistics. Problems and Solutions. Selected contributions to the 7th International Congress of Logic, Methodology, and Philosophy of Science, Salzburg 1983. London—New York, Plenum Press, 465–482.

    Google Scholar 

  41. Orlowska, E. (1984) Logic of indiscemibility relations. Lecture Notes in Computer Science 208, Springer, Berlin—Heidelberg—New York, 177–186.

    Google Scholar 

  42. Orlowska, E. (1985) Logic of nondeterministic information. Studia Logica XLIV, 93–102.

    Google Scholar 

  43. Orlowska, E. (1987) Logic for reasoning about knowledge. Bulletin of the Section of Logic 16, No 1, 26–38. Also in the Zeitschrift ftir Mathematische Logik und Grundlagen der Mathematik 35, 1989, 559–572.

    Google Scholar 

  44. Orlowska, E. (1988) Kripke models with relative accessibility and their application to inferences from incomplete information. In: Mirkowska, G. and Rasiowa, H. (eds) Mathematical Problems in Computation Theory. Banach Center Publications 21, 329–339.

    Google Scholar 

  45. Orlowska, E. (1988a) Logical aspects of learning concepts. Journal of Approximate Reasoning 2, 349–364.

    Article  MATH  Google Scholar 

  46. Orlowska, E. (1995) Information algebras. Proceedings of the AMAST’95, Montreal. Lecture Notes in Computer Science 639, Springer, Berlin—Heidelberg—New York, 50–65.

    Google Scholar 

  47. Orlowska, E. (1996) Studying incompleteness of information: A class of information logics. ICS Research Report 27/96, Warsaw University of Technology. To appear in: Kijania—Placek, K. and Wolenski, J. (eds) The Lvov—Warsaw School and Contemporary Philosophy. Kluwer.

    Google Scholar 

  48. Orlowska, E. (1997) Many—valuedness and uncertainty. Proceedings of the 27th International Symposium on Multiple—Valued Logic, Antigonish, Canada, May 1997.

    Google Scholar 

  49. Pawlak, Z. (1994) Rough Sets. Kluwer, Dordrecht.

    Google Scholar 

  50. Pawlak, Z. and Skowron, A. (1994) Rough membership functions. In: Yaeger, R. R., Fedrizzi, M. and Kacprzyk, J. (eds) Advances in the Dempster—Shaefer Theory of Evidence, John Wiley and Sons, New York, 251–271.

    Google Scholar 

  51. Pomykala, J. A. (1987) Approximation operations in approximation space. Bulletin of the PAS, Mathematics, vol 35, 653–662.

    Google Scholar 

  52. Pomykata, J. A. (1988) On definability in the nondeterministic information system. Bulletin of the PAS, Mathematics, vol 36, 193–210.

    Google Scholar 

  53. Pomykala, J. A. (1993) Approximation, similarity and rough constructions. ILLC Prepublication Series, University of Amsterdam, CT-93–07.

    Google Scholar 

  54. Pomykala, J. A. and Pomykala, J. M. (1988) The Stone algebra of rough sets. Bulletin of the PAS, Mathematics, vol 36, 495–508.

    Google Scholar 

  55. Rasiowa, H. (1988) Logic of approximation reasoning. Lecture Notes in Computer Science 239, Springer, Berlin—Heidelberg—New York, 188–210.

    Google Scholar 

  56. Rasiowa, H. (1991) On approximation logics, a survey. Jahrbuch 1990, Kurt Goedel Gesellschaft, Vienna 1990, 63–87.

    Google Scholar 

  57. Rasiowa, H. and Orlowska, E. (eds) (1997) Reasoning with Incomplete Information. Studia Logica 58, No 1. Special Issue.

    Google Scholar 

  58. Rasiowa, H. and Skowron, A. (1985) Approximation logic. In: Bibel, W. and Jantke, K. P. (eds) Mathematical Methods of Synthesis and Specification of Software Systems. Mathematical Research 31, Akademie Verlag, Berlin, 123–139.

    Google Scholar 

  59. Rauszer, C. and Skowron, A. (1992) The discernibility matrices and functions in information systems. In: [SI], 331–362.

    Google Scholar 

  60. Read, S. (1994) Thinking about Logic. Oxford University Press, Oxford, UK.

    Google Scholar 

  61. SanJuan, E. (1996) Information frames and algebras. Manuscript, Pierre Mendes France University, Grenoble.

    Google Scholar 

  62. Shepherdson, J. C. (1956) On the interpretation of Aristotelian syllogistic. Journal of Symbolic Logic 21, 137–147.

    Article  MathSciNet  MATH  Google Scholar 

  63. Skowron, A. and Grzymala—Busse, J. (1994) From rough set theory to evidence theory. In: Yaeger, R. R, Fedrizzi, M. and Kacprzyk, J. (eds) Advances in the Dempster—Shaefer Theory of Evidence, John Wiley and Sons, New York, 193–236.

    Google Scholar 

  64. Slowinski, R. (ed) (1992) Intelligent Decision Support. Handbook of Applications and Advances in the Rough Set Theory. Kluwer, Dordrecht.

    Google Scholar 

  65. Tsumoto, S., Kobayashi, S., Yokomori, T., Tanaka, H. and Nakamura, A. (eds) (1996) Proceedings of the 4th International Workshop on Rough Sets, Fuzzy Sets and Machine Discovery, Tokyo, Japan, November 1996.

    Google Scholar 

  66. Vakarelov, D. (1987) Abstract characterization of some knowledge representation systems and the logic NIL of nondeterministic information. In: Jorrand, Ph. and Sgurev, V. (eds) Artificial Intelligence II, Methodology, Systems, Applications. North Holland, Amsterdam, 255–260.

    Google Scholar 

  67. Vakarelov, D. (1989) Modal logics for knowledge representation systems. Lecture Notes in Computer Science 363, Springer, Berlin—Heidelberg—New York, 257–277. Also in Theoretical Computer Science 90, 1991, 433–456.

    MathSciNet  MATH  Google Scholar 

  68. Vakarelov, D. (199la) Logical analysis of positive and negative similarity relations in property systems. Proceedings of the First World Conference on the Fundamentals of Artificial Intelligence, Paris, France, 1991, 491–500.

    Google Scholar 

  69. Vakarelov, D. (199 lb) A modal logic for similarity relations in Pawlak knowledge representation systems. Fundamenta Informaticae 15, 61–79.

    Google Scholar 

  70. Wasilewska, A. (1997) Topological rough algebras. In: Lin, T. Y. (ed) Rough Sets and Database Mining, Kluwer, Theory and Decision Library, Dordrecht. Chapter 21, 411–425.

    Google Scholar 

  71. Wasilewska, A. and Vigneron, L. (1995) Rough equality algebras. Proceedings of the Annual Joint Conference on Information Sciences, Wrightsville Beach, North Carolina, USA, 26–30.

    Google Scholar 

  72. Wasilewska, A. and Vigneron, L. (1996) Rough and modal algebras. Proceedings of CESA’96 IMACS Multiconference: Computational Engineering in Systems Applications, Lille, France. Vol. I, 123–130.

    Google Scholar 

  73. Wasilewska, A. and Vigneron, L. (1997) Rough R4 and R5 algebras. International Journal of Information Sciences, to appear.

    Google Scholar 

  74. Wedberg, A. (1948) The Aristotelian theory of classes. Ajatus, vol. 15, 299–314.

    Google Scholar 

  75. Woolery, L. K. and Grzymala—Busse, J. (1994) Machine learning for an expert system to predict preterm birth risk. Journal of the American Medical Informatics Association 1, 439–446.

    Article  Google Scholar 

  76. Ziarko, W. (1993) Variable—precision rough set model. Journal of Computer and System Sciences 40, 39–59.

    Article  MathSciNet  Google Scholar 

  77. Ziarko, W. (ed) (1993) Rough Sets, Fuzzy Sets and Knowledge Discovery. Proceedings of the 2nd International Workshop on Rough Sets and Knowledge Discovery, Banff, Canada, October 1993. Springer, Berlin.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Telecommunications, Szachowa 1, 04-894, Warsaw, Poland

    Ewa Orłowska

Authors
  1. Ewa Orłowska
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Telecommunications, ul. Szachowa 1, PL-04-894, Warsaw, Poland

    Ewa Orłowska

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Orłowska, E. (1998). Introduction: What You Always Wanted to Know about Rough Sets. In: Orłowska, E. (eds) Incomplete Information: Rough Set Analysis. Studies in Fuzziness and Soft Computing, vol 13. Physica, Heidelberg. https://doi.org/10.1007/978-3-7908-1888-8_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-7908-1888-8_1

  • Publisher Name: Physica, Heidelberg

  • Print ISBN: 978-3-7908-2457-5

  • Online ISBN: 978-3-7908-1888-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation