Skip to main content

Exploration of Continuous Sequential Patterns Using the CPGrowth Algorithm

  • Chapter
Advances in Multimedia and Network Information System Technologies

Part of the book series: Advances in Intelligent and Soft Computing ((AINSC,volume 80))

Abstract

In the following paper we present the UCP-Tree and a new algorithm called CPGrowth for continuous pattern mining. The UCP-Tree is an aggregation tree that stores common subsequences of input sequences in the same nodes. The characteristic feature of the CPGrowth algorithm is that it does not require transitional trees at the next recursion levels. Moreover, new sequences can be inserted into the UPC-Tree without rebuilding, which is a considerable advantage considering that Trajectory Data Warehouses store massive amounts of data. In this paper we compared the efficiency of the proposed index with one of the fastest continuous pattern mining algorithms.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.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

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. Brinkhoff, T.A.: A Framework for Generating Network-Based Moving Objects. Geoinformatica, 153–180 (2002)

    Google Scholar 

  2. Gorawski, M., Jureczek, P.: A Proposal of Spatio-Temporal Pattern Queries. In: The 4th Int. Conf. on Complex, Intelligent and Software Intensive Systems, pp. 587–593 (2010)

    Google Scholar 

  3. Han, J., Pei, J., Yin, Y.: Mining Frequent Patterns without Candidate Generation. In: Proc. of the 2000 ACM SIGMOD Int. Conf. on Management of Data, pp. 1–12 (2000)

    Google Scholar 

  4. Pei, J., Han, J., Mortazavi-Asl, B., Zhu, H.: Mining Access Patterns Efficiently from Web Logs. In: Proc. of Pacific-Asia Conf. on Knowledge Discovery and Data Mining, pp. 396–407 (2000)

    Google Scholar 

  5. Spiliopoulou, M., Faulstich, L.C.: WUM: A tool for web utilization analysis. In: Atzeni, P., Mendelzon, A.O., Mecca, G. (eds.) WebDB 1998. LNCS, vol. 1590, pp. 184–203. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  6. Tang, P., Turkia, M.P., Gallivan, K.A.: Mining web access patterns with first-occurrence linked WAP-trees. In: Proc. of the 16th Int. Conf. on Software Engineering and Data Engineering, pp. 247–252 (2007)

    Google Scholar 

  7. Tseng, S., Chan, W.C.: Mining complete user moving paths in a mobile environment. In: Proc. of the Int. Workshop on Databases and Software Engineering (2002)

    Google Scholar 

  8. Tseng, S., Lin, K.W.: Efficient mining and prediction of user behavior patterns in mobile web systems. Information and Software Technology, 357–369 (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Gorawski, M., Jureczek, P., Gorawski, M. (2010). Exploration of Continuous Sequential Patterns Using the CPGrowth Algorithm. In: Nguyen, N.T., Zgrzywa, A., Czyżewski, A. (eds) Advances in Multimedia and Network Information System Technologies. Advances in Intelligent and Soft Computing, vol 80. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14989-4_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-14989-4_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-14988-7

  • Online ISBN: 978-3-642-14989-4

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics