This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Mining Sequential Patterns from Multidimensional Sequence Data
January 2005 (vol. 17 no. 1)
pp. 136-140
The problem addressed in this paper is to discover the frequently occurred sequential patterns from databases. Although much work has been devoted to this subject, to the best of our knowledge, no previous research was able to find sequential patterns from d-dimensional sequence data, where d>2. Without such a capability, many practical data would be impossible to mine. For example, an online stock-trading site may have a customer database, where each customer may visit a Web site in a series of days; each day takes a series of sessions and each session visits a series of Web pages. Then, the data for each customer forms a 3-dimensional list, where the first dimension is days, the second is sessions, and the third is visited pages. To mine sequential patterns from this kind of sequence data, two efficient algorithms have been developed in this paper.

[1] R. Agrawal and R. Srikant, “Fast Algorithms for Mining Association Rules,” Proc. Int'l Conf. Very Large Data Bases, pp. 487-499, Sept. 1994.
[2] R. Agrawal and R. Srikant, “Mining Sequential Patterns,” Proc. 1995 Int'l Conf. Data Eng. (ICDE '95), pp. 3-14, Mar. 1995.
[3] Y.L. Chen, S.S. Chen, and P.Y. Hsu, “Mining Hybrid Sequential Patterns and Sequential Rules,” Information Systems, vol. 27, no. 5, pp. 345-362, 2002.
[4] J. Han, J. Pei, B. Mortazavi-Asl, Q. Chen, U. Dayal, and M.-C. Hsu, “FreeSpan: Requent Pattern-Projected Sequential Pattern Mining,” Proc. 2000 Int'l Conf. Knowledge Discovery and Data Mining (KDD '00), pp. 355-359, Aug. 2000.
[5] J. Pei, J. Han, B. Mortazavi-Asl, and H. Zhu, “Mining Access Pattern Efficiently from Web Logs,” Proc. Pacific-Asia Conf. Knowledge Discovery and Data Mining, pp. 396-407, 2000.
[6] J. Pei, J. Han, H. Pinto, Q. Chen, U. Dayal, and M.-C. Hsu, “PrefixSpan: Mining Sequential Patterns Efficiently by Prefix-Projected Pattern Growth,” Proc. 17th Int'l Conf. Data Eng., pp. 215-224, 2001.
[7] H. Pinto, J. Han, J. Pei, K. Wang, Q. Chen, and U. Dayal, “Multi-Dimensional Sequential Pattern Mining,” Proc. 2001 Int'l Conf. Information and Knowledge Management (CIKM '01), Nov. 2001.
[8] R. Srikant and R. Agrawal, “Mining Sequential Patterns: Generalizations and Performance Improvements,” Proc. Fifth Int'l Conf. Extending Database Technology (EDBT '96), pp. 3-17, Mar. 1996.
[9] C.C. Yu, “Algorithms for Mining Sequential Patterns from Multi-Dimensional Sequence Data,” MSc thesis, Information Management, Nat'l Central Univ., Taiwan, 2002.
[10] M.J. Zaki, “SPADE: An Efficient Algorithm for Mining Frequent Sequences,” Proc. Machine Learning J., special issue on unsupervised learning, vol. 42, pp. 31-60, Jan./Feb. 2001.

Index Terms:
Frequent pattern, sequential patterns, sequence data, data mining.
Citation:
Chung-Ching Yu, Yen-Liang Chen, "Mining Sequential Patterns from Multidimensional Sequence Data," IEEE Transactions on Knowledge and Data Engineering, vol. 17, no. 1, pp. 136-140, Jan. 2005, doi:10.1109/TKDE.2005.13
Usage of this product signifies your acceptance of the Terms of Use.