Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

The MineSP Operator for Mining Sequential Patterns in Inductive Databases

  • Conference paper
MICAI 2006: Advances in Artificial Intelligence (MICAI 2006)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4293))

Included in the following conference series:

  • 1002 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or Ebook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 189.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 239.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. 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)

    Chapter  Google Scholar 

  2. 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)

    Chapter  Google Scholar 

  3. 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)

    Google Scholar 

  4. Imielinski, T., Mannila, H.: A Database Perspective on Knowledge Discovery. Communications Of The ACM 39, 58–64 (1996)

    Article  Google Scholar 

  5. De-Raedt, L.: A Perspective on Inductive Databases. SIGKDD Explorations 4(2), 69–77 (2002)

    Article  MathSciNet  Google Scholar 

  6. 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)

    Google Scholar 

  7. 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)

    Google Scholar 

  8. 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)

    Chapter  Google Scholar 

  9. 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)

    Chapter  Google Scholar 

  10. Garofalakis, M.N., Rastogi, R., Shim, K.: SPIRIT: Sequential Pattern Mining with Regular Expression Constraints. The VLDB Journal, 223–234 (1999)

    Google Scholar 

  11. Zaki, M.J.: SPADE: An Efficient Algorithm for Mining Frequent Sequences. Machine Learning 42(1/2), 31–60 (2001)

    Article  MATH  Google Scholar 

  12. 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)

    Google Scholar 

  13. 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)

    Google Scholar 

  14. 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)

    Google Scholar 

  15. 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)

    Chapter  Google Scholar 

  16. 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)

    Google Scholar 

  17. Tumasonis, R., Dzemyda, G.: The Probabilistic Algorithm for Mining Frequent Sequences. In: ADBIS (Local Proceedings) (2004)

    Google Scholar 

  18. 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)

    Chapter  Google Scholar 

  19. 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)

    Google Scholar 

  20. 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)

    Google Scholar 

  21. 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)

    Chapter  Google Scholar 

  22. 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)

    Chapter  Google Scholar 

  23. 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)

    Google Scholar 

  24. Gopalan, R., Nuruddin, T., Sucahyo, Y.G.: Building a Data Mining Query Optimizer. In: Proceedings of the Australasian Data Mining Workshop (2002)

    Google Scholar 

  25. 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)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics