Abstract
Nowadays the software systems, including web portals, are developed from a priori assumptions about how the system will be used. However, frequently these assumptions hold only partly and are defined also partially. Therefore one must be capable to compare the a priori assumptions with the actual user behavior in order to decide how the system could be improved. To tackle this problem, we consider a promising approach to employ the same formalism to express the intended usage, the web portal model and the frequent real usage patterns, extracted from the experimental data by data mining algorithms. This allows to automate the verification whether the frequent real usage patterns satisfy the intended usage in the web portal model. We propose to use temporal logic and Kripke structure as such a common formalism.
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.
Similar content being viewed by others
References
Bockmayr, A., Courtois, A.: Using hybrid concurrent constraint programming to model dynamic biological systems. In: Stuckey, P.J. (ed.) ICLP 2002. LNCS, vol. 2401, pp. 85–99. Springer, Heidelberg (2002)
Regev, A., Silverman, W., Shapiro, E.: Representation and simulation of biochemical processes using the pi-calculus process algebra. In: Proceedings of the 6th Pacific Symposium on Biocomputing, pp. 459–470 (2001)
Bernot, G., Comet, J.-P., Richard, A., Guespin, J.: Application of formal methods to biological regulatory networks: extending Thomas’ asynchronous logical approach with temporal logic. Journal of theoretical biology 229(3), 339–347 (2004)
Emerson, E.A.: Temporal and Modal Logic. In: Formal Models and Semantics, pp. 995–1072. North-Holland Pub. Co./MIT Press, Cambridge (1990)
Pnueli, A.: System specification and refinement in temporal logic. In: Proceedings of Foundations of Software Technology and Theoretical Computer Science, pp. 1–38. Springer, Heidelberg (1992)
Dixon, C., Fisher, M., Konev, B., Lisitsa, A.: Efficient first-order temporal logic for infinite-state systems, Computing Research Repository, Cornell University (2007)
Méger, N., Rigotti, C.: Constraint-based mining of episode rules and optimal window sizes. In: Boulicaut, J.-F., Esposito, F., Giannotti, F., Pedreschi, D. (eds.) PKDD 2004. LNCS (LNAI), vol. 3202, pp. 313–324. Springer, Heidelberg (2004)
Agrawal, R., Srikant, R.: Mining Sequential Patterns. In: ICDE 1995: Proceedings of the Eleventh International Conference on Data Engineering, pp. 3–14. IEEE Computer Society, Los Alamitos (1995)
Dan Lee, S., De Raedt, L.: An efficient algorithm for mining string databases under constraints. In: Goethals, B., Siebes, A. (eds.) KDID 2004. LNCS, vol. 3377, pp. 108–129. Springer, Heidelberg (2005)
De Raedt, L., Jaeger, M., Dan Lee, S., Mannila, H.: A Theory of Inductive Query Answering. In: Proceedings IEEE ICDM 2002, pp. 123–130 (2002)
Mannila, H., Toivonen, H.: Levelwise search and borders of theories in knowledge discovery. In: Data Mining and Knowledge Discovery, vol. (1-3), pp. 241–258. Kluwer Academic Publishers, Dordrecht (1997)
Albert-Lorincz, H., Boulicaut, J.-F.: Mining frequent sequential patterns under regular expressions: a highly adaptative strategy for pushing constraints. In: Proceedings 3rd SIAM SDM 2003, pp. 316–320 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Besson, J., Mitašiūnaitė, I., Lupeikienė, A., Boulicaut, JF. (2010). Comparing Intended and Real Usage in Web Portal: Temporal Logic and Data Mining. In: Abramowicz, W., Tolksdorf, R. (eds) Business Information Systems. BIS 2010. Lecture Notes in Business Information Processing, vol 47. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12814-1_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-12814-1_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-12813-4
Online ISBN: 978-3-642-12814-1
eBook Packages: Computer ScienceComputer Science (R0)