Published In : IJCAT Journal Volume 1, Issue 10

Date of Publication : 30 November 2014

Pages : 512 - 518

Figures :02

Tables : --

Publication Link : A Birds Eye View on Mining Sequential Patterns from Traditional Databases

 

 

 

Gurram Sunitha : has completed B.E. in Electronics & Communications Engineering from Gulbarga University in 1999 and M.Tech in Computer Sciences from JNT University, Anantapur in 2005. Currently she is pursuing Ph.D. in Computer Science and Engineering at S.V.University, Tirupati. Her research interests include Data Mining, Automata Theory and Database Systems.

Dr. A. Rama Mohan Reddy : received his B.Tech. degree from JNT University, Anantapur in 1986, M. Tech degree in Computer Science from NIT, Warangal in 2000 and Ph.D. in Computer Science and Engineering in 2008 from S. V. University, Tirupathi. He is presently working as Professor in Department of Computer Science and Engineering, S. V. University College of Engineering, Tirupathi, A.P. India. His research interests include Software Architecture, Software Engineering and Data Mining. He is life member of ISTE and IE.

 

 

 

 

 

 

 

Data Mining

Frequent Patterns

Sequential Patterns

Transactional Databases

Sequence Databases

In this paper, the problem of sequential pattern mining is underlined. Algorithms and techniques for the purpose of extracting knowledge in the form of sequential patterns have been discussed. An effort is made to debrief the process of focused mining and incremental mining.

 

 

 

 

 

 

 

 

 

[1] Agrawal R. and Srikant R., “Mining Sequential Patterns,” In Proceedings International Conference on Data Engineering (ICDE'95), pp. 3-14, 1995. [2] Srikant R. and Agrawal R., “Mining Sequential Patterns: Generalizations and Performance Improvements,” In Advances in Database Technology (EDBT’96), 1996, pp.1-17. [3] Han J., Pei J., Mortazavi-Asl B., Chen Q., Dayal U., and Hsu M. C., “FreeSpan: Frequent Pattern-Projected Sequential Pattern Mining,” In Proceedings of the sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 355-359, Aug. 2000. [4] Pei J., Han J., Mortazavi-Asl B., Wang J., Pinto H., and Chen Q., “Mining Sequential Patterns by Pattern- Growth: The PrefixSpan Approach,” IEEE Transactions on Knowledge and Data Engineering, vol. 16, no. 11, pp. 1424-1440, 2004. [5] Zaki M., “SPADE: An Efficient Algorithm for Mining Frequent Sequences,” Machine Learning, vol. 42, no. (1/2), pp. 31-60, 2001. [6] Leleu M., Rigotti C., Boulicaut J. F., and Euvrard G., “GO-SPADE: Mining Sequential Patterns over Datasets with Consecutive Repetitions,” In Machine Learning and Data Mining in Pattern Recognition, Springer Berlin Heidelberg, pp. 293-306, 2003. [7] Ayres J., Flannick J., Gehrke J., and Yiu T., “Sequential Pattern Mining Using Bitmap Representation,” In Proceedings of the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining(KDD’02), pp. 429-435, 2002. [8] Kum H.C., Pei J., Wang W., and Duncan D., “ApproxMAP: Approximate Mining of Consensus Sequential Patterns,” In Proceedings of the 3rd SIAM International Conference on Data Mining(SDM ’03), pp. 311-315, 2003. [9] Kempe S. and Hipp J., “Mining sequences of temporal intervals,” In Knowledge Discovery in Databases: PKDD 2006, pp. 569-576, 2006. [10] Allen J. F., “Maintaining knowledge about temporal intervals,” Communications of the ACM, vol. 26, no. 11, pp. 832-843, 1983. [11] Agrawal R. and Srikant R., “Fast algorithms for mining association rules,” In Proc. 1994 International Conference on Very Large Data Bases (VLDB’94), pp. 487–499, Sept. 1994. [12] Hirate Y. and Yamana H., “Sequential Pattern Mining with Time Intervals,” In Advances in Knowledge Discovery and Data Mining, Springer Berlin Heidelberg, pp. 775-779, 2006. [13] Giannotti F., Nanni M., and Pedreschi D., “Efficient Mining of Temporally Annotated Sequences,” In Proceedings of the 6th SIAM International Conference on Data Mining, pp. 346-357, Apr. 2006. [14] Kim C., Lim J. H., Ng R. T., and Shim K., “SQUIRE: Sequential pattern mining with quantities,” Journal of Systems and Software, vol. 80, no. 10, pp. 1726-1745, 2007. [15] Lin C. X., Ji M., Danilevsky M., and Han J., “Efficient mining of correlated sequential patterns based on null hypothesis,” In Proceedings of the 2012 international workshop on Web-scale knowledge representation, retrieval and reasoning, pp. 17-24, Oct. 2012. [16] Yan X., Han J., and Afshar R., “CloSpan: Mining Closed Sequential Patterns in Large Datasets,” In Proceedings of the 3rd SIAM International Conference on Data Mining(SDM ’03), pp. 166-177, May 2003. [17] Tzvetkov P., Yan X., and Han J., “TSP: Mining Top-K Closed Sequential Patterns,” Knowledge and Information Systems, vol. 7, no. 4, pp. 438-457, 2005. [18] Zaki M. J., Lesh N., Ogihara M., “PLANMINE: Sequence mining for plan failures,” Artificial Intelligence Review, vol. 14, no. 6, pp. 421–446, 2000. [19] Wu P. H., Peng W. C., and Chen, M. S., “Mining sequential alarm patterns in a telecommunication database,” In Databases in Telecommunications II, Springer Berlin Heidelberg, pp. 37-51, 2001. [20] Garofalakis M. N., Rastogi R., and Shim K., “SPIRIT: Sequential Pattern Mining with Regular Expression Constraints,” In Proceedings 1999 International Conference Very Large Data Bases(VLDB’99), vol. 99, pp. 7-10, Sep. 1999. [21] Capelle M., Masson C., and Boulicaut J. F., “Mining Frequent Sequential Patterns under a Similarity Constraint,” In Intelligent Data Engineering and Automated Learning—IDEAL 2002, Springer Berlin Heidelberg, pp. 1-6, 2002. [22] Pei J., Han J., and Wang W., “Mining Sequential Patterns with Constraints in Large Databases,” In Proceedings of the Eleventh International Conference on Information and Knowledge Management(CIKM’02), pp. 18-25, Nov. 2002. [23] Sun X., Orlowska M. E., and Li X., “Finding Temporal Features of Event-Oriented Patterns,” In Advances in Knowledge Discovery and Data Mining, Springer Berlin Heidelberg, pp. 778-784, 2005. [24] Parthasarathy S., Zaki M., Ogihara M., and Dwarkadas S., “Incremental and Interactive Sequence Mining,” In Proceedings of the 8th International Conference on Information and Knowledge Management(CIKM’99), pp. 251-258, 1999. [25] Zhang M., Kao B., Cheung D. W., and Yip C. L., “Efficient Algorithms for Incremental Update of Frequent Sequences,” Advances in Knowledge Discovery and Data Mining, Springer Berlin Heidelberg, pp. 186-197, 2002. [26] Lin M. and Lee S., “Improving the Efficiency of Interactive Sequential Pattern Mining by Incremental Pattern Discovery,” In Proceedings of the 36th Annual Hawaii International Conference on System Sciences, pp. 8-pp, Jan. 2003. [27] Masseglia F., Poncelet P., and Teisseire M., “Incremental Mining of Sequential Patterns in Large Databases,” Data and Knowledge Engineering, vol. 46, no. 1, pp. 97-121, 2003. [28] Lin M. Y. and Lee S. Y., “Incremental update on sequential patterns in large databases by implicit merging and efficient counting,” Information Systems, vol. 29, no. 5, pp. 385-404, 2004. [29] Cheng H., Yan X., and Han J., “IncSpan: Incremental Mining of Sequential Patterns in Large Database,” In Proceedings of the tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining(KDD’04), pp. 527-532, Aug. 2004. [30] Nguyen S. N., Sun X., and Orlowska M. E., “Improvements of IncSpan: Incremental Mining of Sequential Patterns in Large Database,” In Advances in Knowledge Discovery and Data Mining, Springer Berlin Heidelberg, pp. 442-451, 2005. [31] Chen Y., Guo J., Wang Y., Xiong Y., and Zhu Y., “Incremental Mining of Sequential Patterns Using Prefix Tree,” In Advances in Knowledge Discovery and Data Mining, Springer Berlin Heidelberg, pp. 433-440, 2007.