Skip to main content

Relaxing Time Granularity for Mining Frequent Sequences

  • Chapter
  • 833 Accesses

Part of the book series: Studies in Computational Intelligence ((SCI,volume 527))

Abstract

In an industrial context application aiming at performing aeronautic maintenance tasks scheduling, we propose a frequent Interval Time Sequences (ITS) extraction technique from discrete temporal sequences using a sliding window approach to relax time constraints. The extracted sequences offer an interesting overview of the original data by allowing a temporal leeway on the extraction process. We formalize the ITS extraction under classical time and support constraints and conduct some experiments on synthetic data to validate our proposal.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD   109.99
Price excludes VAT (USA)
  • Durable hardcover 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Agrawal, R., Srikant, R.: Mining sequential patterns. In: Proceeding of ICDE Conference, Taipei, Taiwan, pp. 3–15. IEEE Computer Society Press (1995)

    Google Scholar 

  2. Agrawal, R., Srikant, R.: Mining sequential patterns: Generalizations and performance improvements. In: Apers, P.M.G., Bouzeghoub, M., Gardarin, G. (eds.) EDBT 1996. LNCS, vol. 1057, pp. 1–17. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  3. Agrawal, R., Srikant, R., et al.: Fast algorithms for mining association rules. In: Proc. 20th Int. Conf. Very Large Data Bases, VLDB, vol. 1215, pp. 487–499 (1994)

    Google Scholar 

  4. Allen, J.F.: Maintaining knowledge about temporal intervals. Communications of ACM 26 (1983)

    Google Scholar 

  5. Ayres, J., Flannick, J., Gehrke, J., Yiu, T.: Sequential pattern mining using a bitmap representation. In: ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Edmonton, Alberta, Canada, pp. 429–435. ACM (2002)

    Google Scholar 

  6. Ceci, M., Loglisci, C., Salvemini, E., D’Elia, D., Malerba, D.: Mining spatial association rules for composite motif discovery. In: Mathematical Approaches to Polymer Sequence Analysis and Related Problems, pp. 87–109 (2011)

    Google Scholar 

  7. Fournier-Viger, P., Nkambou, R., Nguifo, E.M.: A knowledge discovery framework for learning task models from user interactions in intelligent tutoring systems. In: Gelbukh, A., Morales, E.F. (eds.) MICAI 2008. LNCS (LNAI), vol. 5317, pp. 765–778. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  8. Giannotti, F., Nanni, M., Pedreschi, D., Pinelli, F.: Mining sequences with temporal annotations. In: Proceedings of the 2006 ACM Symposium on Applied Computing (SAC), pp. 593–597. ACM (2006)

    Google Scholar 

  9. Guyet, T., Quiniou, R.: Mining temporal patterns with quantitative intervals. In: Workshops Proceedings of the 8th IEEE International Conference on Data Mining (ICDM), Pisa, Italy, pp. 218–227. IEEE Computer Society (2008)

    Google Scholar 

  10. Guyet, T., Quiniou, R.: Extracting temporal patterns from interval-based sequences. In: IJCAI, Barcelona, Catalonia, Spain, pp. 1306–1311 (2011)

    Google Scholar 

  11. Hirate, Y., Yamana, H.: Generalized sequential pattern mining with item intervals. JCP 1(3), 51–60 (2006)

    Article  Google Scholar 

  12. Li, C., Yang, Q., Wang, J., Li, M.: Efficient mining of gap-constrained subsequences and its various applications. ACM Trans. Knowl. Discov. Data 6(1), 2:1–2:39 (2012)

    Google Scholar 

  13. Pei, J., Han, J., Mortazavi-Asl, B., Pinto, H., Chen, Q., Dayal, U., Hsu, M.: Prefixspan: Mining sequential patterns by prefix-projected growth. In: Proceedings of the 17th International Conference on Data Engineering ICDE, pp. 215–224 (2001)

    Google Scholar 

  14. Pham, Q., Raschia, G., Mouaddib, N., Saint-Paul, R., Benatallah, B.: Time sequence summarization to scale up chronology-dependent applications. In: EDBT 2008, 11th International Conference on Extending Database Technology, Hong Kong, China, pp. 1137–1146 (2009)

    Google Scholar 

  15. Plantevit, M., Laurent, A., Teisseire, M., et al.: Extraction de motifs séquentiels multidimensionnels clos sans gestion d’ensemble de candidats. In: EGC 2007: Extraction et Gestion des Connaissances, p. 6 (2007)

    Google Scholar 

  16. Rabatel, J., Bringay, S., Poncelet, P.: So_mad: Sensor mining for anomaly detection in railway data. In: Perner, P. (ed.) ICDM 2009. LNCS (LNAI), vol. 5633, pp. 191–205. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  17. Srinivasulu, P., Rao, J.R., Babu, I.R.: Network intrusion detection using fp tree rules. CoRR, abs/1006.2689 (2010)

    Google Scholar 

  18. Wu, S., Chen, Y.: Mining nonambiguous temporal patterns for interval-based events. IEEE Trans. on Knowl. and Data Eng. 19, 742–758 (2007)

    Article  Google Scholar 

  19. Yi-Cheng, C., Ji-Chiang, J., Wen-Chih, P., Suh-Yin, L.: An efficient algorithm for mining time interval-based patterns in large database. In: ACM, Proceedings of CIKM Conference, Hong Kong, China, pp. 49–58 (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Ben Zakour, A., Maabout, S., Mosbah, M., Sistiaga, M. (2014). Relaxing Time Granularity for Mining Frequent Sequences. In: Guillet, F., Pinaud, B., Venturini, G., Zighed, D. (eds) Advances in Knowledge Discovery and Management. Studies in Computational Intelligence, vol 527. Springer, Cham. https://doi.org/10.1007/978-3-319-02999-3_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-02999-3_4

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-02998-6

  • Online ISBN: 978-3-319-02999-3

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics