Abstract
Flow Graphs proposed by Z. Pawlak are a very useful tool for reasoning from data. In this paper, an application of flow graphs is presented. We use them to mine rules describing component changes in the consecutive time windows which a given temporal information system is split into. Such rules can be helpful for predicting future changes of components in the system and what follows, predicting the future behavior of the analyzed system.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Butz, C.J., Yan, W., Yang, B.: The Computational Complexity of Inference Using Rough Set Flow Graphs. In: Ślęzak, D., et al. (eds.) RSFDGrC 2005. LNCS (LNAI), vol. 3641, pp. 335–344. Springer, Heidelberg (2005)
Greco, S., Pawlak, Z., Słowiński, R.: Generalized Decision Algorithms, Rough Inference Rules, and Flow Graphs. In: Alpigini, J.J., et al. (eds.) RSCTC 2002. LNCS (LNAI), vol. 2475, pp. 93–104. Springer, Heidelberg (2002)
Pancerz, K., Suraj, Z.: An Application of Rough Set Methods to Concurrent Systems Design. In: Grzegorzewski, P., Krawczak, M., Zadrożny, S. (eds.) Soft Computing. Tools, Techniques and Applications, pp. 229–244. EXIT, Warsaw (2004)
Pawlak, Z.: In Pursuit of Patterns in Data Reasoning from Data - The Rough Set Way. In: Alpigini, J.J., et al. (eds.) RSCTC 2002. LNCS (LNAI), vol. 2475, pp. 1–9. Springer, Heidelberg (2002)
Pawlak, Z.: Flow Graphs and Data Mining. In: Peters, J.F., Skowron, A. (eds.) Transactions on Rough Sets III. LNCS, vol. 3400, pp. 1–36. Springer, Heidelberg (2005)
Suraj, Z.: Rough Set Methods for the Synthesis and Analysis of Concurrent Processes. In: Polkowski, L., Tsumoto, S., Lin, T.Y. (eds.) Rough Set Methods and Applications, pp. 379–488. Physica-Verlag, Berlin (2000)
Suraj, Z., Pancerz, K., Świniarski, R.W.: Prediction of Model Changes of Concurrent Systems Described by Temporal Information Systems. In: Arabnia, H.R., et al. (eds.) Proc. of the DMIN’2005, Las Vegas, USA, pp. 51–57. CSREA Press (2005)
Suraj, Z., Pancerz, K.: Reconstruction of Concurrent System Models Described by Decomposed Data Tables. Fundamenta Informaticae 71(1), 121–137 (2006)
Suraj, Z., Pancerz, K.: The ROSECON System - a Computer Tool for Modelling and Analysing of Processes. In: Mohammadian, M. (ed.) Proc. of the CIMCA’2005, vol. 2, Vienna, Austria, pp. 829–834. IEEE Computer Society Press, Los Alamitos (2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Suraj, Z., Pancerz, K. (2007). Flow Graphs as a Tool for Mining Prediction Rules of Changes of Components in Temporal Information Systems. In: Yao, J., Lingras, P., Wu, WZ., Szczuka, M., Cercone, N.J., Ślȩzak, D. (eds) Rough Sets and Knowledge Technology. RSKT 2007. Lecture Notes in Computer Science(), vol 4481. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72458-2_58
Download citation
DOI: https://doi.org/10.1007/978-3-540-72458-2_58
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72457-5
Online ISBN: 978-3-540-72458-2
eBook Packages: Computer ScienceComputer Science (R0)