Abstract
Observing a binary feature over a period of time yields a sequence of observation intervals. To ease the access to continuous features (like time series), they are often broken down into attributed intervals, such that the attribute describes the series’ behaviour within the segment (e.g. increasing, high-value, highly convex, etc.). In both cases, we obtain a sequence of interval data, in which temporal patterns and rules can be identified. A temporal pattern is defined as a set of labeled intervals together with their interval relationships described in terms of Allen’s interval logic. In this paper, we consider the evaluation of such rules in order to find the most informative rules. We discuss rule semantics and outline deficiencies of the previously used rule evaluation. We apply the J-measure to rules with a modified semantics in order to better cope with different lengths of the temporal patterns. We also consider the problem of specializing temporal rules by additional attributes of the state intervals.
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, C. Faloutsos, and A. Swami. Efficient similarity search in sequence databases. In Proc. of the 4th Int. Conf. on Foundations of Data Organizations and Algorithms, pages 69–84, Chicago, 1993.
R. Agrawal, H. Mannila, R. Srikant, H. Toivonen, and A. I. Verkamo. Fast discovery of association rules. In [7], chapter 12, pages 307–328. MIT Press, 1996.
J. F. Allen. Maintaing knowledge about temporal intervals. Comm. ACM, 26(11):832–843, 1983.
D. J. Berndt and J. Clifford. Finding patterns in time series: A dynamic programming approach. In [7], chapter 9, pages 229–248. MIT Press, 1996.
M. Berthold and D. J. Hand, editors. Intelligent Data Analysis. Springer, 1999.
C. Faloutsos, M. Ranganathan, and Y. Manolopoulos. Fast subsequence matching in time-series databases. In Proc. of ACM SIGMOD Int. Conf. on Data Management, May 1994.
U. M. Fayyad, G. Piatetsky-Shapiro, P. Smyth, and R. Uthurusamy, editors. Advances in Knowledge Discovery and Data Mining. MIT Press, 1996.
F. Höppner. Discovery of temporal patterns-learning rules about the qualitative behaviour of time series. In Proc. of the 5th Europ. Conf. on Princ. and Pract. of Knowl. Discovery in Databases, Freiburg, Germany, Sept. 2001. Springer.
K. B. Konstantinov and T. Yoshida. Real-time qualitative analysis of the temporal shapes of (bio)process variables. Artificial Intelligence in Chemistry, 38(11):1703–1715, Nov. 1992.
H. Mannila, H. Toivonen, and A. I. Verkamo. Discovery of frequent episodes in event sequences. Technical Report 15, University of Helsinki, Finland, Feb. 1997.
P. Smyth and R. M. Goodman. Rule induction using information theory. In Knowledge Discovery in Databases, chapter 9, pages 159–176. MIT Press, 1991.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Höppner, F., Klawonn, F. (2001). Finding Informative Rules in Interval Sequences. In: Hoffmann, F., Hand, D.J., Adams, N., Fisher, D., Guimaraes, G. (eds) Advances in Intelligent Data Analysis. IDA 2001. Lecture Notes in Computer Science, vol 2189. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44816-0_13
Download citation
DOI: https://doi.org/10.1007/3-540-44816-0_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42581-6
Online ISBN: 978-3-540-44816-7
eBook Packages: Springer Book Archive