Paper Title:
The Sequential Pattern Mining Algorithm MHSP Based on MH
  Abstract

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.

  Info
Periodical
Edited by
Helen Zhang and David Jin
Pages
425-430
DOI
10.4028/www.scientific.net/AMM.63-64.425
Citation
J. Wang, 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
Export
Price
$32.00
Share

In order to see related information, you need to Login.

In order to see related information, you need to Login.

Authors: Lu Na Byon, Jeong Hye Han
Abstract:As electronic commerce progresses, temporal association rules are developed by time to offer personalized services for customer’s interests....
287
Authors: Ying Lin Li, Man Liang Qiu, Lian He Yang
Abstract:In view of the defect and shortage in cutting path automatic optimization of 2D pattern pieces in current garment automatic cutter, a new...
973
Authors: Hai Feng Li, Ning Zhang
Chapter 1: Transportation & Service Science
Abstract:Maximal frequent itemsets are one of several condensed representations of frequent itemsets, which store most of the information contained in...
21
Authors: Jun Tan
Chapter 12: Computer-Aided Design and Applications in Industry and Civil Engineering
Abstract:Online mining of frequent closed itemsets over streaming data is one of the most important issues in mining data streams. In this paper, we...
2910
Authors: Hai Yan Wang
Chapter 6: Production Management
Abstract:This paper presents a hybrid algorithm to address the flexible job-shop scheduling problem (FJSP). Based on Differential Evolution (DE), a...
502