Asian Journal of Information Technology

Year: 2010
Volume: 9
Issue: 4
Page No. 238 - 242

Discovery of Maximal Contiguous Sequence Patterns with Priority in Web Logs

Authors : M. Thilagu and R. Nadarajan

References

Agrawal, R. and R. Srikant, 1995. Mining sequential patterns. Proceedings of the 11th International Conference on Data Engineering, March 6-10, 1995, Taipei, Taiwan, pp: 3-14.

Antunes, C. and A.L. Oliveira, 2003. Generalization of pattern-growth methods for sequential pattern mining with gap constraints. Machine Learning Data Mining, 2734: 239-251.
CrossRef  |  

Antunes, C. and A.L. Oliveira, 2004. Sequential pattern mining algorithms: Trade-offs between speed and memory. Proceedings of the 2nd Workshop on Mining Graphs, Trees and Seq, Italy.

Ayres, J., J. Flannick, J. Gehrke and T. Yiu, 2002. Sequential pattern mining using a bitmap representation. Proceedings of the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, July 23-25, 2002, New York, USA., pp: 429-435.

Chen, J. and T. Cook, 2007. Using d-gap patterns for index compression. Proceedings of the 16th International Conference on World Wide Web, Banff, Alberta, Canada, May 08-12, ACM, New York, USA., pp: 1209-1210.

Chen, J., 2008. Contiguous item sequential pattern mining using updown tree. Intell. Data Anal., 12: 25-49.
Direct Link  |  

Chen, M.S., J.S. Park and P.S. Yu, 1998. Efficient data mining for path traversal patterns. IEEE. Trans. Knowledge Data Eng., 10: 209-220.
CrossRef  |  Direct Link  |  

Han, J., J. Pei, B. Mortazavi-Asl, Q. Chen, U. Dayal and M. Hsu, 2000. FreeSpan: Frequent pattern-projected sequential pattern mining. Proceedings of the 6th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, August 20-23, 2000, Boston, MA., USA., pp: 355-359.

Lin, M. and S. Lee, 2005. Fast discovery of sequential patterns through memory indexing and database partitioning. J. Inform. Sci. Eng., 21: 109-128.
Direct Link  |  

Nakagawa, M. and B. Mobasher, 2003. A Hybrid Web Personalization Model Based on Site Connectivity. Proceedings of the In WEBKDD, pp: 59-70

Pei, J., J. Han, B. Mortazavi-Asl, J. Wang and H. Pinto et al., 2004. Mining sequential patterns by pattern-growth: The prefixSpan approach. IEEE. TKDE., 16: 1424-1440.

Pei, J., J. Han, B. Mortazavi-asi and H. Zhu, 2000. Mining Access Patterns Efficiently from Web Logs: In Proceedings of 6th Pacific Area Conference on Knowledge Discovery and Data Mining (PAKDD). Lecture Notes Comp. Sci., 1805: 396-407.
CrossRef  |  

Saputra, D., D.R.A. Rambli and O.M. Foong, 2008. Mining Sequential Patterns Using I-PrefixSpan. Int. J. Comput. Sci. Eng., 2: 2-2.
Direct Link  |  

Show-Jane, Y., 2003. An Efficient Approach for Analyzing User Behaviors in a Web-Based Training Environment. J. Dis. Edu. Techno., 1: 55-71.

Srikant, R. and R. Agrawal, 1996. Mining sequential patterns: Generalizations and performance improvements. Proc. Int. Conf. Extend. Database Technol., 1057: 3-17.
Direct Link  |  

Zaki, M.J., 2001. SPADE: An efficient algorithm for mining frequent sequences. Mach. Learn. J., 42: 31-60.
CrossRef  |  Direct Link  |  

Zhang, Z. and M. Kitsuregawa, 2005. LAPIN-SPAM: An Improved Algorithm for Mining Sequential Pattern. Proceedings of the International Special Workshop on Databases for Next Generation Researchers, April 5-8, University of Tokyo, pp: 1222-1222.

Design and power by Medwell Web Development Team. © Medwell Publishing 2024 All Rights Reserved