Skip to main content

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

Abstract

This paper concerns the relationship between rough sets and flow graphs. It is shown that flow graph can be used both as formal language for computing approximations of sets in the sense of rough set theory, and as description tool for data structure. This description is employed next for finding patterns in data. To this end decision algorithm induced by the flow graph is defined and studied.

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

Access this chapter

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. Ford, L.R., Fulkerson, D.R.: Flows in Networks. Princeton University Press, Princeton (1962)

    MATH  Google Scholar 

  2. Greco, S., Pawlak, Z., Słowiński, R.: Generalized decision algorithms, rough inference rules and flow graphs. In: Alpigini, J.J., Peters, J.F., Skowron, A., Zhong, N. (eds.) RSCTC 2002. LNCS (LNAI), vol. 2475, pp. 93–104. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  3. Greco, S., Pawlak, Z., Słowiński, R.: Bayesian confirmation measures within rough set approach. In: Tsumoto, S., Słowiński, R., Komorowski, J., Grzymała-Busse, J.W. (eds.) RSCTC 2004. LNCS (LNAI), vol. 3066, pp. 261–270. Springer, Heidelberg (2004)

    Google Scholar 

  4. Łukasiewicz, J.: Grundlagen der Wahrscheinilchkeitsrechnung. Kraków (1913). In: Borkowski, L. (ed.) Jan Łukasiewicz – Selected Works, pp. 16–63. North Holland Publishing Company/Polish Scientific Publishers (1970)

    Google Scholar 

  5. Kloesgen, E., Żytkow, J. (eds.): Handbook of Knowledge Discovery and Data Mining. Oxford University Press, Oxford (2002)

    MATH  Google Scholar 

  6. Pawlak, Z.: Rough Sets: Theoretical Aspects of Reasoning about Data. System Theory, Knowledge Engineering and Problem Solving 9. Kluwer Academic Publishers, Dordrecht (1991)

    Google Scholar 

  7. Pawlak, Z.: Rough sets, decision algorithms and Bayes’ theorem. European Journal of Operational Research 136, 181–189 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  8. Pawlak, Z.: Flow graphs and decision algorithms. In: Wang, G., Liu, Q., Yao, Y., Skowron, A. (eds.) RSFDGrC 2003. LNCS (LNAI), vol. 2639, pp. 1–10. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  9. Polkowski, L., Skowron, A.: Rough mereology: A new paradigm for approximation reasoning. International Journal of Approximate Reasoning 15(4), 333–365 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  10. Bayes’s Theorem. In: Swinburne, R. (ed.) Proceedings of the British Academy, vol. 113, Oxford University Press, Oxford (2002)

    Google Scholar 

  11. Tsumoto, S.: Modelling medical diagnostic rules based on rough sets. In: Polkowski, L., Skowron, A. (eds.) RSCTC 1998. LNCS (LNAI), vol. 1424, pp. 475–482. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  12. Wong, S.K.M., Ziarko, W.: Algorithm for inductive learning. In: Bull, 34th edn., pp. 271–276. Polish Academy of Sciences, Warsaw (1986)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pawlak, Z. (2005). Rough Sets and Flow Graphs. In: Ślęzak, D., Wang, G., Szczuka, M., Düntsch, I., Yao, Y. (eds) Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing. RSFDGrC 2005. Lecture Notes in Computer Science(), vol 3641. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11548669_1

Download citation

  • DOI: https://doi.org/10.1007/11548669_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28653-0

  • Online ISBN: 978-3-540-31825-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics