Abstract
One of the main issues in the rule/pattern mining is of measuring the interestingness of a pattern. The interestingness has been evaluated previously in literature using several approaches for association as well as for sequential mining. These approaches generally view a sequence as another form of association for computations and understanding. But, by doing so, a sequence might not be fully understood for its statistical significance such as dependence and applicability. This paper proposes a new framework to study sequences’ interestingness. It suggests two kinds of Markov processes, namely Bayesian networks, to represent the sequential patterns. The patterns are studied for statistical dependencies in order to rank the sequential patterns interestingness. This procedure is very shown when the domain knowledge is not easily accessible.
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
Agrawal, R., Imielinski, T., Swami, A.: Mining association rules between sets of items in large databases. In: Proceedings of the ACM SIGMOD Conference on Management of Data, Washington D.C, pp. 207–216 (1993)
Agrawal, R., Srikant, R.: Mining sequential patterns. In: Proceedings of the 20th Int’l Conference on Very Large Datbases, Santiago, Chile (1994)
Srikant, R., Agrawal, R.: Mining sequential patterns:generalisations and performance improvements. IBM Research Report RJ9994 (1995)
Joshi, M., Karypis, G., Kumar, V.: A universal formulation of sequential patterns. In: Proceedings of the KDD 2001 Workshop on Temporal Data Mining, San Fransisco (August 2001)
Spiliopoulou, M.: Managing Interesting Rules in Sequence Mining. In: Żytkow, J.M., Rauch, J. (eds.) PKDD 1999. LNCS (LNAI), vol. 1704, Springer, Heidelberg (1999)
Jensen, S.: Mining medical data for predictive and sequential patterns. In: PKDD 2001, Freiburg, Germany (2001)
Xiangji, H., An, A., Cercone, N.: Comparison of Interestingness Functions for Learning Web Usage Patterns. In: CIKM 2002, McLean, Virginia, USA, November 4-9 (2002)
Huynh, X.-H., Guillet, F., Briand, H.: An exploratory analysis tool for interestingness measures. In: International Conference on Applied Stochastic Models and Data Analysis. ASMDA, Brest, France (2005)
Garofalakis, M., Rastogi, R., Shim, K.: Spirit: Sequential pattern mining with regular expression constraints. IEEE Transactions on knowledge and data engineering 14, 530–552 (2002)
Ahola, J.: Mining sequential patterns. Research Report TTE1-2001-10, VTT Information Technology, Finland (2001)
Yen, S.-J., Lee, Y.-S.: An efficient data mining technique for discovering interesting sequential patterns. In: Proceedings of the 2001 IEEE International Conference on Data Mining (ICDM 2001), San Jose, USA, pp. 663–664 (2001)
Alex, A.F.: On rule interestingness measures. Knowledge-Based Systems 12, 309–315 (1999)
Huang, X., An, A., Cercone, N.: Comparison of interestingness functions for learning web usage patterns, CIKM, McLean, Virginia, USA (2002)
Casas-Garriga, G.: Statistical strategies for pruning all the uninteresting association rules. In: European Conference on Artificial Intelligence, Valencia, Spain (2004)
Bayardo Jr., R.J., Agraqwal, R.: Mining the most interesting rules. In: Proc. Of the fifth ACM SIGKDD Int’l Conf. on Knowledge Discovery and Data Mining, pp. 145–154 (1999)
Chen, Y.-L., Chen, S.-S., Hsu, P.-Y.: Mining hybrid sequential patterns and sequential rules. Information Systems 27, 345–362 (2002)
Baumgarten, M., Buchner, A.G., Hughes, J.G.: User-driven ranking for measuring the interestingness of knowledge patterns. In: IKE 2003, pp. 122–128 (2003)
Hilderman, R.J., Hamilton, H.J.: Measuring the interestingness of discovered knowledge: a principled approach. Intelligent Data Analysis 7, 347–381 (2003)
Jensen, F.V.: Bayesian networks and decision graphs. Springer, Heidelberg (2001)
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
Vellaisamy, K., Li, J. (2006). Bayesian Approaches to Ranking Sequential Patterns Interestingness. In: Yang, Q., Webb, G. (eds) PRICAI 2006: Trends in Artificial Intelligence. PRICAI 2006. Lecture Notes in Computer Science(), vol 4099. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-36668-3_27
Download citation
DOI: https://doi.org/10.1007/978-3-540-36668-3_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-36667-6
Online ISBN: 978-3-540-36668-3
eBook Packages: Computer ScienceComputer Science (R0)