Skip to main content

Interpretation of Extended Pawlak Flow Graphs Using Granular Computing

  • Chapter
Book cover Transactions on Rough Sets VIII

Part of the book series: Lecture Notes in Computer Science ((TRS,volume 5084))

Abstract

In this paper, we mainly discuss the relationship between the extended Pawlak flow graph (EFG) with granular computing (GrC), and develop a both simple and concrete model for EFG using GrC. The distinct advantage is that we can resort to merits of GrC to benefit us in analyzing and processing data using flow graph, for its structure is inherently consistent with GrC, which provides us with both structured thinking at the philosophical level and structured problem solving at the practical level. In pursuit of our purpose, at first, EFG will be mainly discussed in three aspects under GrC, namely, granulation of EFG, some relationships and operations of granules. Under the framework of GrC model, inference and reformation in EFG can be easily implemented in virtue of decomposition and composition of granules, respectively. Based on this scheme, two efficient reduction algorithms about EFG are also proposed.

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. Bazan, J., Nguyen, H.S., Nguyen, S.H., Synak, P., Wróblewski, J.: Rough set algorithms in classification problem. In: Połkowski, L., Tsumoto, S., Lin, T. (eds.) Rough Set Methods and Applications, pp. 49–88. Physica, Heidelberg (2000)

    Google Scholar 

  2. Blake, C.L., Merz, C.J.: UCI Repository of Machine Learning Databases, University of California (1998), http://www.ics.uci.edu/~mlearn/MLRepository.html

  3. Butz, C.J., Yan, W., Yang, B.: The Computational Complexity of Inference using Rough Set Flow Graphs. In: [31], pp. 335–344 (2005)

    Google Scholar 

  4. Butz, C.J., Yan, W., Yang, B.: An Efficient Algorithm for Inference in Rough Set Flow Graphs. Transaction on Rough Sets V, 102–122 (2006)

    Google Scholar 

  5. Butz, C.J., Yan, W.: Current Trends in Rough Set Flow Graphs. In: Hassanien, A.E., Suraj, Z., Ślȩzak, D., Lingras, P. (eds.) Rough Computing: Theories, Technologies and Applications, Idea Group Inc. (2007)

    Google Scholar 

  6. Chan, C.-C., Tsumoto, S.: On Learning Decision Rules From Flow Graphs. In: Proceedings of North American Fuzzy Information Processing Society (NAFIPS 2007), pp. 655–658 (2007)

    Google Scholar 

  7. Chitchareon, D., Pattaraintakorn, P.: Knowledge Discovery by Rough Sets mathematical Flow Graphs and Its Extension. In: Proceedings of the IASTED International Conference on Artificial Intelligence and Applications (AIA 2008), Innsbruck, Austria, pp. 340–345 (2008)

    Google Scholar 

  8. Greco, S., Hata, Y., Hirano, S., Inuiguchi, M., Miyamoto, S., Nguyen, H.S., Słowiński, R. (eds.): RSCTC 2006. LNCS (LNAI), vol. 4259. Springer, Heidelberg (2006)

    Google Scholar 

  9. Czyzewski, A., Szczerba, M., Kostek, B.: Musical Metadata Retrieval with Flow Graphs. In: [35], pp. 691–698 (2004)

    Google Scholar 

  10. Kostek, B., Czyzewski, A.: Processing of Musical Metadata Employing Pawlak’s Flow Graphs. In: Peters, J.F., Skowron, A. (eds.) Transactions on Rough Sets I, pp. 279–298. Springer, Heidelberg (2004)

    Google Scholar 

  11. Lin, T.Y.: Granular Computing on Binary Relations I: Data Mining and Neighborhood Systems. In: Skoworn, A., Polkowski, L. (eds.) Rough Sets In Knowledge Discovery, pp. 107–121. Springer, Heidelberg (1998)

    Google Scholar 

  12. Lin, T.Y., Yin, P.: Heuristically Fast Finding of the Shortest Reducts. In: [35], pp. 465–470 (2004)

    Google Scholar 

  13. Liu, H., Hussain, F., Tan, C.L., Dash, M.: Discretization: An Enabling Technique. Data Mining and Knowledge Discovery 6, 393–423 (2002)

    Article  MathSciNet  Google Scholar 

  14. Liu, H., Sun, J., Qi, C., Bai, X.: Inference and Reformation in Flow Graph using Granule Computing. In: Kryszkiewicz, M., Peters, J.F., Rybinski, H., Skowron, A. (eds.) RSEISP 2007. LNCS (LNAI), vol. 4585, pp. 261–270. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  15. Mieszkowicz-Rolka, A., Rolka, L.: Flow Graphs and Decision Tables with Fuzzy Attributes. In: Rutkowski, L., Tadeusiewicz, R., Zadeh, L.A., Żurada, J.M. (eds.) ICAISC 2006. LNCS (LNAI), vol. 4029, pp. 268–277. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  16. Nguyen, H.S., Skowron, A., Stepaniuk, J.: Granular Computing, A Rough Set approach. Computational Intelligence 17(3), 514–544 (2001)

    Article  MathSciNet  Google Scholar 

  17. Pattaraintakorn, P., Cercone, N., Naruedomkul, K.: Rule learning: Ordinal prediction based on rough sets and soft-computing. Applied Mathematics Letters 19(12), 1300–1307 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  18. Pawlak, Z.: Decision algorithms, Bayes’ Theorem and Flow Graphs. In: Proceeding of the 6th Conference on Neural Networks and Soft Computing (2002)

    Google Scholar 

  19. Pawlak, Z.: The Rough Set View on Bayes’ Theorem. In: Pal, N.R., Sugeno, M. (eds.) AFSS 2002. LNCS (LNAI), vol. 2275, pp. 106–116. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  20. Pawlak, Z.: Probability, truth and flow graphs. In: Proceedings of the Workshop on Rough Sets in Knowledge Discovery and Soft Computing at ETAPS, pp. 1–9 (2003)

    Google Scholar 

  21. Pawlak, Z.: Flow graphs and decision algorithms. In: [36], pp. 1–11 (2003)

    Google Scholar 

  22. Pawlak, Z.: Decision Networks. In: [35], pp. 1–7 (2004)

    Google Scholar 

  23. Pawlak, Z.: Some Issues on Rough Sets. In: Peters, J.F., Skowron, A., Grzymała-Busse, J.W., Kostek, B.z., Świniarski, R.W., Szczuka, M. (eds.) Transactions on Rough Sets I. LNCS, vol. 3100, pp. 1–58. Springer, Heidelberg (2004)

    Google Scholar 

  24. Pawlak, Z.: Decisions rules and flow networks. European Journal of Operational Research 154, 184–190 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  25. Pawlak, Z.: Rough Sets and Flow Graphs. In: [31], pp. 1–11 (2005)

    Google Scholar 

  26. Pawlak, Z.: Flow Graphs and Data Mining. In: Peters, J.F., Skowron, A. (eds.) Transactions on Rough Sets III. LNCS, vol. 3400, pp. 1–58. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  27. Pawlak, Z.: Decision Trees and Flow Graphs. In: [8], pp. 1–11 (2006)

    Google Scholar 

  28. Skowron, A., Bazan, J.G., Latkowski, R.: RSES 2.2 User’s Guide. Institute of Mathematics, Warsaw University (2002), http://logic.mimuw.edu.pl/~rses/

  29. Skowron, A., Synak, P.: Patterns in Information Maps. In: Alpigini, J.J., Peters, J.F., Skowron, A., Zhong, N. (eds.) RSCTC 2002. LNCS (LNAI), vol. 2475, pp. 453–460. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  30. Skowron, A., Synak, P.: Reasoning Based on Information Changes in Information Maps. In: [36], pp. 229–236 (2003)

    Google Scholar 

  31. Ślȩzak, D., et al. (eds.): Rough Sets, Fuzzy Sets, Data Mining and Granular Computing. Springer, Berlin (2005)

    Google Scholar 

  32. Suraj, Z., Pancerz, K.: Flow Graphs as a Tool for Mining Prediction Rules of Changes of Components in Temporal Information Systems. In: Yao, J., Lingras, P., Wu, W.-Z., Szczuka, M., Cercone, N.J., Ślȩzak, D. (eds.) RSKT 2007. LNCS (LNAI), vol. 4481, pp. 468–475. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  33. Sun, J., Liu, H., Zhang, H.: An Extension of Pawlak’s Flow Graphs. In: Proceedings of the 1st International Conference on Rough Sets and Knowledge Technology, Chongqing, pp. 191–199 (2006)

    Google Scholar 

  34. Sun, J., Liu, H., Qi, C., Zhang, H.: An Interpretation of Flow Graphs by Granular Computing. In: [8], pp. 448–457 (2006)

    Google Scholar 

  35. Tsumoto, S., Słowiński, R., Komorowski, J. (eds.): RSCTC 2004. LNCS (LNAI), vol. 3066. Springer, Heidelberg (2004)

    MATH  Google Scholar 

  36. Wang, G.Y., et al. (eds.): RSFDGrC 2003. LNCS (LNAI), vol. 2639. Springer, Heidelberg (2003)

    MATH  Google Scholar 

  37. Yao, Y.Y.: A partition model of granular computing. In: Peters, J.F., Skowron, A. (eds.) Transactions on Rough Sets I. LNCS, vol. 3100, pp. 232–253. Springer, Heidelberg (2004)

    Google Scholar 

  38. Yao, Y.Y.: Perspectives of Granular Computing. In: Proceedings of 2005 IEEE International Conference on Granular Computing, vol. 1, pp. 85–90 (2005)

    Google Scholar 

  39. Yao, Y.Y., Zhong, N.: Granular computing using information tables. In: Lin, T.Y., Yao, Y.Y., Zadeh, L.A. (eds.) Data Mining, Rough Sets and Granular Computing, pp. 102–124. Physica, Heidelberg (2002)

    Google Scholar 

  40. Zadeh, L.: Towards a theory of fuzzy in formation granulation and its centrality in human reasoning and fuzzy logic. Fuzzy Sets and Systems 90, 111–121 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  41. Zadeh, L.: Some reflections on soft computing, granular computing and their roles in the conception, design and utilization of information/intelligent systems. Soft Computing 2, 23–25 (1998)

    Google Scholar 

  42. Zhang, L., Zhang, B.: The quotient space theory of problem solving, In: [36], pp. 11–15 (2003)

    Google Scholar 

  43. Zhang, C., Zhang, S. (eds.): Association Rule Mining: models and algorithms. LNCS (LNAI), vol. 2307. Springer, Heidelberg (2002)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

James F. Peters Andrzej Skowron

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Liu, H., Sun, J., Zhang, H. (2008). Interpretation of Extended Pawlak Flow Graphs Using Granular Computing. In: Peters, J.F., Skowron, A. (eds) Transactions on Rough Sets VIII. Lecture Notes in Computer Science, vol 5084. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85064-9_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-85064-9_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-85063-2

  • Online ISBN: 978-3-540-85064-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics