Abstract
We consider the problem of knowledge induction from sequential or temporal data. Patterns and rules in such data can be detected using methods adopted from association rule mining. The resulting set of rules is usually too large to be inspected manually. We show that (amongst other reasons) the inadequacy of the pattern space is often responsible for many of these patterns: If the true relationship in the data is fragmented by the pattern space, it cannot show up as a peak of high pattern density, but the data is divided among many different patterns, often difficult to distinguish from incidental patterns. To overcome this fragmentation, we identify core patterns that are shared among specialized patterns. The core patterns are then generalized by selecting a subset of specialized patterns and combining them disjunctively. The generalized patterns can be used to reduce the size of the set of patterns. We show some experiments for the case of labeled interval sequences, where patterns consist of a set of labeled intervals and their temporal relationships expressed via Allen’s interval logic.
This work has been supported by the Deutsche Forschungsgemeinschaft (DFG) under grant no. Kl 648/1.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R. Agrawal, H. Mannila, R. Srikant, H. Toivonen, and A. I. Verkamo. Fast discovery of association rules. In [4], chapter 12, pages 307–328. MIT Press, 1996.
H. Ahonen-Myka. Finding all maximal frequent sequences in text. In D. Mladenic and M. Grobelnik, eds., Proc. of the ICML99 Workshop on Machine Learning in Text Data Analysis, pages 11–17, 1999.
P. R. Cohen and N. Adams. An algorithm for segmenting categorical time series into meaningful episodes. In Proc. of the 4th Int. Symp. on Intelligent Data Analysis, number 2189 in LNAI, pages 197–205. Springer, 2001.
U. M. Fayyad, G. Piatetsky-Shapiro, P. Smyth, and R. Uthurusamy, eds.. Advances in Knowledge Discovery and Data Mining. MIT Press, 1996.
J. Han and Y. Fu. Discovery of multiple-level association rules from large databases. In Proc. of the 21st Int. Conf. on Very Large Databases, pages 420–431, 1995.
F. Höppner. Discovery of temporal patterns-learning rules about the qualitative behaviour of time series. In Proc. of the 5th Europ. Conf. on Principles of Data Mining andKnowl. Discovery, number 2168 in LNAI, pages 192–203, Freiburg, Germany, Sept. 2001. Springer.
F. Höppner. Learning dependencies in multivariate time series. In Proc. of the ECAI’02 Workshop on Knowledge Discovery from (Spatio-) Temporal Data, pages 25–31, Lyon, France, July 2002.
F. Höppner and F. Klawonn. Finding informative rules in interval sequences. In Proc. of the 4th Int. Symp. on Intelligent Data Analysis, volume 2189 of LNCS, pages 123–132, Lissabon, Portugal, Sept. 2001. Springer.
F. Höppner and F. Klawonn. Learning rules about the development of variables over time. In C. T. Leondes, ed., Intelligent Systems: Technology andApplic ations, volume IV, chapter 9, pages 201–228. CRC Press, 2003. To appear.
M. Klemettinen, H. Mannila, P. Ronkainen, H. Toivonen, and A. I. Verkamo. Finding interesting rules from large sets of discovered association rules. In Proc. of the 3rdInt. Conf. on Inform. And Knowl. Management, pages 401–407, 1994.
Y. Li, S. Wang, and S. Jajodia. Discovering temporal patterns in multiple granularities. In J. Roddick and K. Hornsby, eds., Proc. of the 1st Int. Workshop on Temporal, Spatial, and Spatio-Temporal Data Mining, number 2007 in LNAI, pages 5–19, Lyon, France, Sept. 2000. Springer.
H. Mannila, H. Toivonen, and A. I. Verkamo. Discovering frequent episodes in sequences. In Proc. of the 1st Int. Conf. on Knowl. Discovery and Data Mining, pages 210–215, Menlo Park, Calif., 1995.
N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal. Discovering frequent closed itemsets for association rules. In Proc. of Int. Conf. on Database Theory, number 1540 in LNCS, pages 398–416. Springer, 1999.
P. Smyth and R. M. Goodman. An information theoretic approach to rule induction from databases. IEEE Trans. on Knowledge and Data Engineering, 4(4):301–316, Aug. 1992.
R. Srikant and R. Agrawal. Mining generalized association rules. In Proc. of the 21st Int. Conf. on Very Large Databases, pages 407–419, 1995.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Höppner, F. (2002). Discovery of Core Episodes from Sequences. In: Hand, D.J., Adams, N.M., Bolton, R.J. (eds) Pattern Detection and Discovery. Lecture Notes in Computer Science(), vol 2447. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45728-3_16
Download citation
DOI: https://doi.org/10.1007/3-540-45728-3_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44148-9
Online ISBN: 978-3-540-45728-2
eBook Packages: Springer Book Archive