Skip to main content
SpringerLink
Log in
Book cover

Pacific-Asia Conference on Knowledge Discovery and Data Mining

PAKDD 2008: Advances in Knowledge Discovery and Data Mining pp 600–607Cite as

A Simple Characterization on Serially Constructible Episodes

  • Conference paper

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

Abstract

In this paper, we introduce a parallel-free episode that always has an arc between vertices with the same label and a serially constructible episode that is embedded into every parallel-free episode containing all of the serial episodes occurring in it. Then, we show that an episode is parallel-free if and only if it is serially constructible.

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

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Katoh, T., Hirata, K.: Mining frequent elliptic episodes from event sequences. In: Proc. 5th LLLL, pp. 46–52 (2007)

    Google Scholar 

  2. Katoh, T., Hirata, K., Harao, M.: Mining sectorial episodes from event sequences. In: Todorovski, L., Lavrač, N., Jantke, K.P. (eds.) DS 2006. LNCS (LNAI), vol. 4265, pp. 137–145. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  3. Katoh, T., Hirata, K., Harao, M.: Mining frequent diamond episodes from event sequences. In: Torra, V., Narukawa, Y., Yoshida, Y. (eds.) MDAI 2007. LNCS (LNAI), vol. 4617, pp. 477–488. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  4. Mannila, H., Toivonen, H., Verkamo, A.I.: Discovery of frequent episodes in event sequences. Data Mining and Knowledge Discovery 1, 259–289 (1997)

    Article  Google Scholar 

  5. Pei, J., Han, J., Mortazavi-Asi, B., Wang, J., Pinto, H., Chen, Q., Dayal, U., Hsu, M.-C.: Mining sequential patterns by pattern-growth: The PrefixSpan approach. IEEE Trans. Knowledge and Data Engineering 16, 1–17 (2004)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Graduate School of Computer Science and Systems Engineering,  

    Takashi Katoh

  2. Department of Artificial Intelligence, Kyushu Institute of Technology, Kawazu 680-4, Iizuka, 820-8502, Japan

    Kouichi Hirata

Authors
  1. Takashi Katoh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kouichi Hirata
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Takashi Washio Einoshin Suzuki Kai Ming Ting Akihiro Inokuchi

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Katoh, T., Hirata, K. (2008). A Simple Characterization on Serially Constructible Episodes. In: Washio, T., Suzuki, E., Ting, K.M., Inokuchi, A. (eds) Advances in Knowledge Discovery and Data Mining. PAKDD 2008. Lecture Notes in Computer Science(), vol 5012. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-68125-0_55

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-68125-0_55

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-68124-3

  • Online ISBN: 978-3-540-68125-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation