This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Discovering Frequent Event Patterns with Multiple Granularities in Time Sequences
March/April 1998 (vol. 10 no. 2)
pp. 222-237

Abstract—An important usage of time sequences is to discover temporal patterns. The discovery process usually starts with a user-specified skeleton, called an event structure, which consists of a number of variables representing events and temporal constraints among these variables; the goal of the discovery is to find temporal patterns, i.e., instantiations of the variables in the structure that appear frequently in the time sequence. This paper introduces event structures that have temporal constraints with multiple granularities, defines the pattern-discovery problem with these structures, and studies effective algorithms to solve it. The basic components of the algorithms include timed automata with granularities (TAGs) and a number of heuristics. The TAGs are for testing whether a specific temporal pattern, called a candidate complex event type, appears frequently in a time sequence. Since there are often a huge number of candidate event types for a usual event structure, heuristics are presented aiming at reducing the number of candidate event types and reducing the time spent by the TAGs testing whether a candidate type does appear frequently in the sequence. These heuristics exploit the information provided by explicit and implicit temporal constraints with granularity in the given event structure. The paper also gives the results of an experiment to show the effectiveness of the heuristics on a real data set.

[1] R. Agrawal, T. Imielinski, and A. Swami, Database Mining: A Performance Perspective IEEE Trans. Knowledge and Data Eng., vol. 5, no. 6, Dec. 1993.
[2] R. Agrawal and R. Srikant, “Mining Sequential Patterns,” Proc. 1995 Int'l Conf. Data Eng., pp. 3-14, Mar. 1995.
[3] A.V. Aho,J.E. Hopcroft, and J.D. Ullman,The Design and Analysis of Computer Algorithms.Reading, Mass.: Addison-Wesley, 1974.
[4] R. Alur and D. Dill, “A Theory of Timed Automata,” Theoretical Computer Science, vol. 126, pp. 183-235, 1994.
[5] C. Bettini, X.S. Wang, and S. Jajodia, “Testing Complex Temporal Relationships Involving Multiple Granularities and Its Application to Data Mining,” Proc. 15th ACM Symp. Principles of Database Systems, June 1996.
[6] C. Bettini, X. Wang, and S. Jajodia, "A General Framework for Time Granularity and Its Application to Temporal Reasoning," Annals of Math. and Artificial Intelligence, vol. 22, nos. 1-2, pp. 29-58, 1998.
[7] R. Chandra, A. Segev, and M. Stonebraker, “Implementing Calendars and Temporal Rules in Next Generation Databases,” Proc. Int'l Conf. Data Eng., pp. 264-273, 1994.
[8] R. Dechter, I. Meiri, and J. Pearl, “Temporal Constraint Networks,” Artificial Intelligence, vol. 49, pp. 61–95, 1991.
[9] T.G. Dietterich and R.S. Michalski, “Discovering Patterns in Sequences of Events,” Artificial Intelligence, vol. 25, pp. 187-232, 1985.
[10] W. Dreyer, A.K. Dittrich, and D. Schmidt, "Research Perspectives for Time Series Management Systems," SIGMOD Record, vol. 23, no. 1, pp. 10-15, Mar. 1994.
[11] P. Laird, "Identifying and Using Patterns in Sequential Data," Proc. Fourth Int'l Workshop Algorithmic Learning Theory, pp. 1-18, Springer-Verlag, 1993.
[12] B. Leban, D. Mcdonald, and D. Foster, "A Representation for Collections of Temporal Intervals," Proc. AAAI, Nat'l Conf. Artificial Intelligence, pp. 367-371, Morgan Kaufmann, Los Altos, Calif., 1986.
[13] H. Mannila, H. Toivonen, and A.I. Verkamo, "Discovering Frequent Episodes in Sequences," extended abstract, Proc. First Conf. Knowledge Discovery and Data Mining, AAAI Press, Menlo Park, Calif., pp. 210-215, 1995.
[14] R. Marceca, "Temporal Reasoning with Multiple Granularity Constraint Networks," master's thesis, in Italian, DSI, Univ. of Milan, Italy, 1996.
[15] M. Niezette and J. Stevenne, "An Efficient Symbolic Representation of Periodic Time," Proc. CIKM,Baltimore, Md., Nov. 1992.
[16] M.D. Soo, "Multiple Calendar Support for Conventional Database Management Systems," R.T. Snodgrass, ed., Proc. Workshop Infrastructure for Temporal Databases, pp. FF1-FF17, June 1993.
[17] X. Wang, C. Bettini, A. Brodsky, and S. Jajodia, "Logical Design for Temporal Databases with Multiple Granularities," ACM Trans. Database Systems, to appear, 1997.
[18] 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, Minneapolis, pp. 115-125, May 1994.
[19] K. Wang and J. Tan, "Incremental Discovery of Sequential Patterns," Proc. Workshop Research Issues on Data Mining and Knowledge Discovery, in cooperation with ACM-SIGMOD '96 and IRIS/Precarn, Montreal, Quebec, Canada, June 1996.

Index Terms:
Data mining, knowledge discovery, time sequences, temporal databases, time granularity, temporal constraints, temporal patterns.
Citation:
Claudio Bettini, X. Sean Wang, Sushil Jajodia, Jia-Ling Lin, "Discovering Frequent Event Patterns with Multiple Granularities in Time Sequences," IEEE Transactions on Knowledge and Data Engineering, vol. 10, no. 2, pp. 222-237, March-April 1998, doi:10.1109/69.683754
Usage of this product signifies your acceptance of the Terms of Use.