This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Mining Sequential Patterns with Regular Expression Constraints
May/June 2002 (vol. 14 no. 3)
pp. 530-552

Abstract—Discovering sequential patterns is an important problem in data mining with a host of application domains including medicine, telecommunications, and the World Wide Web. Conventional sequential pattern mining systems provide users with only a very restricted mechanism (based on minimum support) for specifying patterns of interest. As a consequence, the pattern mining process is typically characterized by lack of focus and users often end up paying inordinate computational costs just to be inundated with an overwhelming number of useless results. In this paper, we propose the use of Regular Expressions (REs) as a flexible constraint specification tool that enables user-controlled focus to be incorporated into the pattern mining process. We develop a family of novel algorithms (termed SPIRIT—Sequential Pattern mIning with Regular expressIon consTraints) for mining frequent sequential patterns that also satisfy user-specified RE constraints. The main distinguishing factor among the proposed schemes is the degree to which the RE constraints are enforced to prune the search space of patterns during computation. Our solutions provide valuable insights into the trade-offs that arise when constraints that do not subscribe to nice properties (like antimonotonicity) are integrated into the mining process. A quantitative exploration of these trade-offs is conducted through an extensive experimental study on synthetic and real-life data sets. The experimental results clearly validate the effectiveness of our approach, showing that speedups of more than an order of magnitude are possible when RE constraints are pushed deep inside the mining process. Our experimentation with real-life data also illustrates the versatility of REs as a user-level tool for focusing on interesting patterns.

[1] R. Agrawal, G. Psaila, E.L. Wimmers, and M. Zait, “Querying Shapes of Histories,” Proc. Very Large Data Bases (VLDB) Conf., pp. 502-514, 1995.
[2] R. Agrawal and R. Srikant, “Fast Algorithms for Mining Association Rules,” Proc. 1994 Int'l Conf. Very Large Data Bases, pp. 487-499, Sept. 1994.
[3] R. Agrawal and R. Srikant, “Mining Sequential Patterns,” Proc. 1995 Int'l Conf. Data Eng., pp. 3-14, Mar. 1995.
[4] S. Chakrabarti, B. Dom, R. Agrawal, and P. Raghavan, “Using Taxonomy, Discriminants, and Signatures for Navigating in Text Databases,” Proc. 23rd Int'l Conf. Very Large Data Bases, Aug. 1997.
[5] M.-S. Chen, J.-S. Park, and P.S. Yu, “Efficient Data Mining for Path Traversal Patterns,” IEEE Trans. Knowledge and Data Eng., vol. 10, no. 2, pp. 209-221, Apr. 1998.
[6] K. Hätönen, M. Klemettinen, P. Mannila, H. Ronkainen, and H. Toivonen, “Knowledge Discovery from Telecommunication Network Alarm Databases,” Proc. 12th Int'l Conf. Data Eng., pp. 115-122, Feb. 1996.
[7] H.R. Lewis and C. Papadimitriou, Elements of the Theory of Computation. Prentice-Hall, 1981.
[8] H. Mannila and H. Toivonen, “Discovering Generalized Episodes Using Minimal Occurrences,” Proc. Second Int'l Conf. Knowledge Discovery and Data Mining, Aug. 1996.
[9] H. Mannila, H. Toivonen, and A.I. Verkamo, “Discovering Frequent Episodes in Sequences,” Proc. First Int'l Conf. Knowledge Discovery and Data Mining, pp. 210-215, Aug. 1995.
[10] R. Ng, L.V.S. Lakshmanan, J. Han, and A. Pang, “Exploratory Mining and Pruning Optimizations of Constrained Associations Rules,” Proc. 1998 ACM-SIGMOD Int'l Conf. Management of Data, pp. 13-24, June 1998.
[11] R. Srikant, Q. Vu, and R. Agrawal, “Mining Association Rules with Item Constraints,” Proc. Third Int'l Conf. Knowledge Discovery and Data Mining, Aug. 1997.
[12] R. Srikant and R. Agrawal, “Mining Sequential Patterns: Generalizations and Performance Improvements,” Proc. Fifth Int'l Conf. Extending Database Technology (EDBT), pp. 3-17, 1996.
[13] D. Tsur, J.R. Ullman, S. Abiteboul, C. Clifton, R. Motwani, S. Nestorov, and A. Rosenthal, “Query Flocks: A Generalization of Association-Rule Mining,” Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 1-12, May 1998.
[14] 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.

Index Terms:
Data mining, constraints, sequential patterns, regular expressions, finite automata
Citation:
M. Garofalakis, R. Rastogi, K. Shim, "Mining Sequential Patterns with Regular Expression Constraints," IEEE Transactions on Knowledge and Data Engineering, vol. 14, no. 3, pp. 530-552, May-June 2002, doi:10.1109/TKDE.2002.1000341
Usage of this product signifies your acceptance of the Terms of Use.