Development of Sequential ID3: “An advance Sequential mining Algorithm”

Swati Singh Lodhi^1,

¹Sanghvi Innovative Academy, Indore (MP) India

Cite this paper:
Swati Singh Lodhi. Development of Sequential ID3: “An advance Sequential mining Algorithm”. American Journal of Software Engineering. 2014; 2(2):16-21. doi: 10.12691/ajse-2-2-1

Abstract

Sequential pattern mining is an important data mining technique which discovers closed frequent sub sequence from a sequence database. Sequential pattern mining was used in a great spectrum of areas. Some of the applications of sequential pattern mining are namely bio-informatics, web access traces, system utilization logs etc. The data is naturally in the form of sequences. However it is very difficult as it generates explosive number of sub sequence in candidate generator and test approach. Previous sequential pattern mining algorithm like Clospan, Sequence generator, closed sequence-sequence generator mining (CSGM). In sequential pattern mining and web log mining a traditional algorithm Apriori is always reminded but due to some performance issues they were replaced with other algorithms and techniques. Many different techniques for mining frequent sequential patterns from the log data have been proposed in the recent past but still mining data from weblog files an effective and efficient algorithm is required that works with high performance. Moreover; it is required to authenticate the algorithm for that purposes we have used a traditional algorithm for mining sequential pattern from web log data. Thus the aim of the present work is to bridge these gaps by developing and proposing a new algorithm “Sequential ID3” for sequential pattern mining and their experimental validation on web log data.

Keywords:
Sequential ID3 web log data CSSGM algorithm

This work is licensed under a Creative Commons Attribution 4.0 International License. To view a copy of this license, visit http://creativecommons.org/licenses/by/4.0/

References:

[1]	Agarwal, R., and Srikant, R. Mining sequential patterns. Proceedings of the Eleventh International Conference on Data Engineering, 1995.
[2]	Gaul, W., and Schmidt-Thieme, L. Mining Generalized Association Rules for Sequential and Path Data. Proceedings of the 2001 IEEE International Conference on Data Mining, 2001.
[3]	Srikant, R., and Agarwal, R. Mining Sequential Patterns: Generalizations and Performance Improvements. Proceedings of the 5th International Conference on Extending Database Technology: Advances in Database Technology, 1996.
[4]	Yan, X., Han, J., and Afshar, R. CloSpanMining Closed Sequential Patterns in Large Datasets. Proceedings of the SIAM International Conference on Data Mining (SDM'03)2003.
[5]	Hao zang, and yue xu. Non redundant Sequential association rule mining and application in recommender System.IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology, 2010.
[6]	Xu, Y., & Li, Y. Concise representations for approximate association rules. Proceedings of the IEEE International Conference on Systems, Man and Cybernetics, SMC, 2008.
[7]	Li, J., Li, H., Wong, L., Pei, J., & Dong, G. Minimum description length principle: generators are preferable to closed patterns. Proceedings of the21st National Conference on Artificial Intelligence, 2006.
[8]	Desikan, P., Pathak, N., Srivastava, J., and Kumar, V. Incremental page rank computation on evolving graphs. Paper presented at the Special interest tracks and posters of the 14th International Conference on World Wide Web, 2005.
[9]	Cooley, R. Web Mining: Information and Pattern Discovery on the World Wide Web. Proceedings of the 9th International Conference on Tools with Artificial Intelligence.1997.