Abstract
This paper introduces MineSP, a relational-like operator to mine sequential patterns from databases. It also shows how an inductive query can be translated into a traditional query tree augmented with MineSP nodes. This query tree is then optimized, choosing the mining algorithm that best suits the constraints specified by the user and the execution environment conditions. The SPMiner prototype system supporting our approach is also presented.
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
Agrawal, R., Srikant, R.: Mining Sequential Patterns. In: Eleventh International Conference on Data Engineering, Taipei, Taiwan, pp. 3–14. IEEE Computer Society Press, Los Alamitos (1995)
Srikant, R., Agrawal, R.: Mining Sequential Patterns: Generalizations and Performance Improvements. In: Apers, P.M.G., Bouzeghoub, M., Gardarin, G. (eds.) EDBT 1996. LNCS, vol. 1057, pp. 3–17. Springer, Heidelberg (1996)
Pei, J., Han, J., Mortazavi-Asl, B., Pinto, H.: PrefixSpan: Mining Sequential Patterns Efficiently by Prefix Projected Pattern Growth. In: Proc. 2001 Int. Conf. Data Engineering (ICDE 2001), Heidelberg, Germany, pp. 215–224 (2001)
Imielinski, T., Mannila, H.: A Database Perspective on Knowledge Discovery. Communications Of The ACM 39, 58–64 (1996)
De-Raedt, L.: A Perspective on Inductive Databases. SIGKDD Explorations 4(2), 69–77 (2002)
Wojciechowski, M.: Mining Various Patterns in Sequential Data in an SQL-like Manner. In: Eder, J., Rozman, I., Welzer, T. (eds.) ADBIS 1999. LNCS, vol. 1691, pp. 131–138. Springer, Heidelberg (1999)
Li, H., Liu, C., Orlowska, M.: A Query System for Object-Relational Databases. In: Proceedings of ADC 1998, Perth, Australia, pp. 39–50. Springer, Heidelberg (1998)
Shintani, T., Kitsuregawa, M.: Mining Algorithms for Sequential Patterns in Parallel: Hash Based Approach. In: Wu, X., Kotagiri, R., Korb, K.B. (eds.) PAKDD 1998. LNCS, vol. 1394, pp. 283–294. Springer, Heidelberg (1998)
Bayardo, R.: Efficiently Mining Long Patterns from Databases. In: Proc. ACM SIGMOD Int. Conf. on Management of Data, SIGMOD 1998, Seattle, Washington, pp. 85–93. ACM Press, New York (1998)
Garofalakis, M.N., Rastogi, R., Shim, K.: SPIRIT: Sequential Pattern Mining with Regular Expression Constraints. The VLDB Journal, 223–234 (1999)
Zaki, M.J.: SPADE: An Efficient Algorithm for Mining Frequent Sequences. Machine Learning 42(1/2), 31–60 (2001)
Morzy, T., Wojciechowski, M., Zakrzewicz, M.: Efficient Constraint-Based Sequential Pattern Mining Using Dataset Filtering Techniques. In: Databases and Information Systems II, Selected Papers from the Fifth International Baltic Conference, pp. 297–310. Kluwer Academic Publishers, Dordrecht (2002)
Seno, M., Karypis, G.: Slpminer: An Algorithm for Finding Frequent Sequential Patterns Using Length Decreasing Support Constraint. Technical Report 02-023, Department of Computer Science, University of Minnesota (2002)
Zheng, Q., Xu, K., Ma, S., Lv, W.: The Algorithms of Updating Sequential Patterns. In: Proc. of 5th Int. Workshop on High Performance Data Mining, in conjunction with 2nd SIAM Conference on Data Mining, Washington (2002)
Cheung, W., Zaïane, O.R.: Incremental Mining of Frequent Patterns without Candidate Generation or Support Constraint. In: 7th Int. Database Engineering and Applications Symposium (IDEAS 2003), Hong Kong, China, pp. 111–116. IEEE Computer Society Press, Los Alamitos (2003)
Kum, H.C., Pei, J., Wang, W., Duncan, D.: ApproxMAP: Approximate Mining of Consensus Sequential Patterns. In: Proc. 3rd SIAM Int. Conf. on Data Mining, San Francisco, USA (2003)
Tumasonis, R., Dzemyda, G.: The Probabilistic Algorithm for Mining Frequent Sequences. In: ADBIS (Local Proceedings) (2004)
Chiu, D.Y., Wu, Y.H., Chen, A.L.P.: An Efficient Algorithm for Mining Frequent Sequences by a New Strategy without Support Counting. In: Proc. 20th Int. Conf. on Data Engineering, ICDE 2004, Boston, USA, pp. 375–386. IEEE Computer Society, Los Alamitos (2004)
Lin, M.Y., Lee, S.Y.: Fast Discovery of Sequential Patterns through Memory Indexing and Database Partitioning. J. Inf. Sci. Eng. 21(1), 109–128 (2005)
Pinto, H., Han, J., Pei, J., Wang, K., Chen, Q., Dayal, U.: Multi-Dimensional Sequential Pattern Mining. In: Proc. 10th Int. Conf. on Information and Knowledge Management, Atlanta, Georgia, USA, pp. 81–88. ACM Press, New York (2001)
Antunes, C., Oliveira, A.L.: Generalization of Pattern-Growth Methods for Sequential Pattern Mining with Gap Constraints. In: Perner, P., Rosenfeld, A. (eds.) MLDM 2003. LNCS, vol. 2734, pp. 239–251. Springer, Heidelberg (2003)
Leleu, M., Rigotti, C., Boulicaut, J.F., Euvrard, G.: Constraint-Based Mining of Sequential Patterns over Datasets with Consecutive Repetitions. In: Lavrač, N., Gamberger, D., Todorovski, L., Blockeel, H. (eds.) PKDD 2003. LNCS (LNAI), vol. 2838, pp. 303–314. Springer, Heidelberg (2003)
Meo, R., Psaila, G., Ceri, S.: A New SQL-like Operator for Mining Association Rules. In: Vijayaraman, T.M., Buchmann, A.P., Mohan, C., Sarda, N.L. (eds.) VLDB 1996, Proceedings of 22th International Conference on Very Large Data Bases, Mumbai (Bombay), India, pp. 122–133. Morgan Kaufmann, San Francisco (1996)
Gopalan, R., Nuruddin, T., Sucahyo, Y.G.: Building a Data Mining Query Optimizer. In: Proceedings of the Australasian Data Mining Workshop (2002)
Morzy, M., Wojciechowski, M., Zakrzewicz, M.: Cost-based Sequential Pattern Query Optimization in Presence of Materialized Results of Previous Queries. In: Proceedings of the Intelligent Information Systems Symposium (IIS 2002), Sopot, Poland, pp. 435–444. Physica-Verlag (2002)
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
Benítez-Guerrero, E., Hernández-López, AR. (2006). The MineSP Operator for Mining Sequential Patterns in Inductive Databases. In: Gelbukh, A., Reyes-Garcia, C.A. (eds) MICAI 2006: Advances in Artificial Intelligence. MICAI 2006. Lecture Notes in Computer Science(), vol 4293. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11925231_65
Download citation
DOI: https://doi.org/10.1007/11925231_65
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-49026-5
Online ISBN: 978-3-540-49058-6
eBook Packages: Computer ScienceComputer Science (R0)