Abstract
In knowledge discovery, Pawlak’s flow graph is a new mathematical model and has some distinct advantages. However, the flow graph can not effectively deal with some situations, such as estimating consistence and removing redundant attributes. A primary reason is that it is a quantitative graph and requires the network to be steady. Therefore, we propose an extension of the flow graph which takes objects flowing in network as its basis to study the relations among the information in this paper. It not only has the capabilities of the flow graph, but also can implement some functions as well as decision table.
This work is supported by the National NSF of China(60473003),Ministry of Education Program for New Century Excellent Talents in University(NECT) and Doctor Point Founds of Educational Department(20050183065). The 3rd author was supported by the Science Foundation for Young Teachers of Northeast Normal University(20051003).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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)
Pawlak, Z.: Decision Networks. In: [15], pp. 1–7 (2004)
Pawlak, Z.: Flow graphs and decision algorithms. In: Wang, G.Y., et al. (eds.) Rough Sets,Fuzzy Sets,Data Mining and Granular Computing, pp. 1–11 (2003)
Pawlak, Z.: Rough Sets and Flow Graphs. In: [16], pp. 1–11 (2005)
Pawlak, Z.: Some Issues on Rough Sets. In: [17], pp. 1–58 (2004)
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)
Butz, C.J., Yan, W., Yang, B.: The Computational Complexity of Inference Using Rough Set Flow Graphs. In: [16], pp. 335–344 (2005)
Czyzewski, A., Szczerba, M., Kostek, B.: Musical Metadata Retrieval with Flow Graphs. In: [15], pp. 691–698 (2004)
Kostek, B., Czyzewski, A.: Processing of Musical Metadata Employing Pawlak’s Flow Graphs. In: [17], pp. 279–298 (2004)
Mollestad, T., Skowron, A.: A Rough Set Framework for Data Mining of Propositional Default Rules. In: Proceedings of the 9th international Symposium on Foundations of Intelligent Systems, pp. 148–157 (1996)
Wang, G.Y. (ed.): The theory of Rough Sets and Knowledge Acquisition (in Chinese). Xi’an Jiaotong University Press, Xi’an (2001)
Guan, J.W., Bell, D.A.: Rough computational methods for information systems. Artificial Intelligences 1/2, 77–103 (1998)
Miao, D.Q., Hu, G.R.: A heuristic arithmetic in Reduction (in Chinese). Journal of Computer Research and Development 6, 681–684 (1999)
Skowron, A., Rauszer, C.: The discernibility matrices and functions in information system. In: Słowiński, R. (ed.) Intelligent Decision Support Handbook of Applications and Advances of the Rough Sets Theory, pp. 331–362 (1992)
Tsumoto, S., Słowiński, R., Komorowski, J., Grzymała-Busse, J.W. (eds.): RSCTC 2004. LNCS (LNAI), vol. 3066. Springer, Heidelberg (2004)
Ślęzak, D., Wang, G., Szczuka, M., Düntsch, I., Yao, Y., et al. (eds.): RSFDGrC 2005. LNCS (LNAI), vol. 3641. Springer, Heidelberg (2005)
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. Springer, Heidelberg (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sun, J., Liu, H., Zhang, H. (2006). An Extension of Pawlak’s Flow Graphs. In: Wang, GY., Peters, J.F., Skowron, A., Yao, Y. (eds) Rough Sets and Knowledge Technology. RSKT 2006. Lecture Notes in Computer Science(), vol 4062. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11795131_28
Download citation
DOI: https://doi.org/10.1007/11795131_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-36297-5
Online ISBN: 978-3-540-36299-9
eBook Packages: Computer ScienceComputer Science (R0)