Abstract
This paper presents techniques for discovering and matching rules with elastic patterns. Elastic patterns are ordered lists of elements that can be stretched along the time axis. Elastic patterns are useful for discovering rules from data sequences with different sampling rates. For fast discovery of rules whose heads (left-hand sides) and bodies (right- hand sides) are elastic patterns, we construct a trimmed sufix tree from succinct forms of data sequences and keep the tree as a compact representation of rules. The trimmed sufix tree is also used as an index structure for finding rules matched to a target head sequence. When matched ru- les cannot be found, the concept of rule relaxation is introduced. Using a cluster hierarchy and relaxation error as a new distance function, we find the least relaxed rules that provide the most specific information on a target head sequence. Experiments on synthetic data sequences reveal the effectiveness of our proposed approach.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
R. Agrawal, and R. Srikant, “Mining Sequential Patterns”, Proc. IEEE ICDE, 1995.
D. J. Berndt, and J. Clifford, “Finding Patterns in Time Series: A Dynamic Programming Approach”, Advances in Knowledge Discovery and Data Mining, AAAI/MIT, 1996.
P. S. Bradley, U. M. Fayyad, and O. L. Mangasarian, “Data Mining: Overview and Optimization Opportunities”, Microsoft Research Report MSR-TR-98-04, 1998.
P. Bieganski, J. Riedl, and J. V. Carlis, “Generalized Sufix Trees for Biological Sequence Data: Applications and Implementation”, Proc. Hawaii Int’l Conf. on System Sciences, 1994.
W. W. Chu, and K. Chiang, “Abstraction of High Level Concepts from Numerical Values in Databases”, Proc. of AAAI Workshop on Knowledge Discovery in Databases, 1994.
G. Das, K. Lin, H. Mannila, G. Renganathan, and P. Smyth, “Rule Discovery from Time Series”, Proc. International Conference on Knowledge Discovery and Data Mining, 1998.
U. M. Fayyad, “Mining Databases: Toward Algorithms for Knowledge Discovery”, Data Engineering Bulletin 21(1), 1998.
E. M. McCreight, “A Space-Economical Sufix Tree Construction Algorithm”, Journal of the ACM, Vol. 23, No. 2, 1976
H. Mannila, H. Toivonen, and A. I. Verkamo, “Discovering Frequent Episodes in Sequences”, Proc. International Conference on Knowledge Discovery and Data Mining, 1995.
S. Park and W. W. Chu, “Discovering and Matching Elastic Rules from Sequence Databases”, UCLA Technical Report UCLA-CS-TR-200012, 2000.
S. Park, W. W. Chu, J. Yoon, and C. Hsu, “Efficient Searches for Similar Subsequences of Different Lengths in Sequence Databases”, Proc. IEEE ICDE, 2000.
L. Rabinar, and B. Juang. Fundamentals of Speech Recognition, Prentice Hall, 1993.
G. A. Stephen, String Searching Algorithms, World Scientific Publishing, 1994.
J. T.-L. Wang, G.-W. Chirn, T. G. Marr, B. Shapiro, D. Shasha, and K. Zhang, “Combinatorial Pattern Discovery for Scientific Data: Some Preliminary Results”, Proc. ACM SIGMOD, 1994.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Park, S., Chu, W.W. (2000). Discovering and Matching Elastic Rules from Sequence Databases. In: Raś, Z.W., Ohsuga, S. (eds) Foundations of Intelligent Systems. ISMIS 2000. Lecture Notes in Computer Science(), vol 1932. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-39963-1_42
Download citation
DOI: https://doi.org/10.1007/3-540-39963-1_42
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41094-2
Online ISBN: 978-3-540-39963-6
eBook Packages: Computer ScienceComputer Science (R0)