The Sequential Pattern Mining Algorithm MHSP Based on MH


Article Preview

Pattern growth approach is an important method in sequential pattern mining. Projection database based on the method is introduced in PrefixSpan, and the PrefixSpan algorithm can solve the problem of mining sequential patterns. But relative to large projection database, the performance of PrefixSpan is affected. Inspired by the prefix-divide method and MH structure, this paper proposed a new algorithm MHSP for sequential pattern mining. Based on the real datasets, experimental results show that the performance of MHSP algorithm is more than twice as fast as PrefixSpan.



Edited by:

Helen Zhang and David Jin




J. Wang and Y. Q. Jiang, "The Sequential Pattern Mining Algorithm MHSP Based on MH", Applied Mechanics and Materials, Vols. 63-64, pp. 425-430, 2011

Online since:

June 2011




[1] R. Agrawal and R. Srikant. Mining sequential patterns. In Proc. 1995 Int. Conf. Data Engineering (ICDE'95), pages 3-14, Taipei, Taiwan, Mar. (1995).

[2] JianPei, Jiawei Han. Mining Swquential Patterns by Pattern-Growth: The PrefixSpan Approach. In IEEE Transactions on Knowledge and Data Engineering, Vol16, No11, pages 1424-1440, November (2004).

[3] Jian Pei, Jiawei Han. H-Mine: Hyper-structure Mining of Frequent Patterns in Large Databases. Proceedings of the 2001 IEEE International Conference on Data Mining, 441 – 448, (2001).


[4] IBM Almaden Research Center, Synthetic Data Generation Code for Associations and Sequential, (2006).

Fetching data from Crossref.
This may take some time to load.