Submit Manuscript

Information Technology Journal

Year: 2011 | Volume: 10 | Issue: 12 | Page No.: 2434-2439
Research Article

Mining Web Frequent Multi-dimensional Sequential Patterns

Guoyan Huang
College of Information Science and Engineering, Yanshan University, Qinhuangdao 066004, People`s Republic China
Na Zuo
College of Information Science and Engineering, Yanshan University, Qinhuangdao 066004, People`s Republic China
Jiadong Ren
College of Information Science and Engineering, Yanshan University, Qinhuangdao 066004, People`s Republic China
Although, numerous methods have been proposed to mine sequential patterns, previous approaches can’t effectively find web frequent multi-dimensional sequential patterns from d-dimensional sequence data with multi-dimensional information, where d>2. The main objective of web frequent multi-dimensional sequential pattern mining is to provide the end user with more useful and interesting patterns. To mine web frequent multi-dimensional sequential patterns, in present study, we propose a new algorithm ExtSeq-MIDim. It employs extseq (Extended sequential pattern mining method) to mine sequential patterns from d-dimensional sequence data, then forms projected multi-dimensional database for each sequential pattern and uses an algorithm MIDim (Memory Indexing for mining multi-dimensional pattern) to mine multi-dimensional patterns within projected databases. During the multi-dimensional pattern mining process, MIDim takes advantage of the idea of memory indexing without multiple scanning projected databases and handles fewer and shorter multi-dimensional tuples as the discovered patterns get longer. The experimental results show that ExtSeq-MIDim scales up linearly and is efficient to find web multi-dimensional sequential patterns.
PDF Fulltext XML References Citation

Leave a Comment

Your email address will not be published. Required fields are marked *

Article Trend

Total views 2816

References

  1. 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.
    CrossRef
  2. Srikant, R. and R. Agrawal, 1996. Mining sequential patterns: Generalizations and performance improvements. Proc. Int. Conf. Extend. Database Technol., 1057: 3-17.
    Direct Link
  3. 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 Trans. Knowledge Data Eng., 16: 1424-1440.
    Direct Link
  4. Pei, J., J. Han and W. Wang, 2007. Constraint-based sequential pattern mining: The pattern-growth methods. J. Intell. Inform. Syst., 28: 133-160.
    CrossRef
  5. Chang, J.H., 2011. Mining weighted sequential patterns in a sequence database with a time-interval weight. Knowledge-Based Syst., 24: 1-9.
    CrossRef
  6. Lin, M.Y., S.C. Hsueh and C.W. Chang, 2008. Mining closed sequential patterns with time constraints. J. Inform. Sci. Eng., 24: 33-46.
    Direct Link
  7. 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
  8. Lin, M.Y., S.C. Hsueh and C.W. Chang, 2008. Fast discovery of sequential patterns in large databases using effective time-indexing. Inform. Sci., 178: 4228-4245.
    CrossRef
  9. Pinto, H., J. Han, J. Pei, K. Wang, Q. Chen and U. Dayal, 2001. Multi-dimensional sequential pattern mining. Proceedings of the 10th International Conference on Information and Knowledge Management, Oct. 5-10, Atlanta, GA., pp: 81-88.
    Direct Link
  10. Yu, C.C. and Y.L. Chen, 2005. Mining sequential patterns from multidimensional sequence data. IEEE Trans. Knowledge Data Eng., 17: 136-140.
    CrossRef

Keywords