Constraint-Based Sequential Pattern Mining: A Pattern Growth Algorithm Incorporating Compactness, Le

Constraint-Based Sequential Pattern Mining:
A Pattern Growth Algorithm Incorporating Compactness, Length and Monetary

1Bhawna Mallick, 1Deepak Garg, and 2Preetam Singh Grover
1Department of Computer Science & Engineering, Thapar University, India
2Department of Computer Science & Engineering, Guru Tegh Bahadur Institute of Technology
GGS Indraprastha University, India

 
Abstract: Sequential pattern mining is advantageous for several applications for example, it finds out the sequential purchasing behavior of majority customers from a large number of customer transactions. However, the existing researches in the field of discovering sequential patterns are based on the concept of frequency and presume that the customer purchasing behavior sequences do not fluctuate with change in time, purchasing cost and other parameters. To acclimate the sequential patterns to these changes, constraint are integrated with the traditional sequential pattern mining approach. It is possible to discover more user-centered patterns by integrating certain constraints with the sequential mining process. Thus in this paper, monetary and compactness constraints in addition to frequency and length are included in the sequential mining process for discovering pertinent sequential patterns from sequential databases. Also, a CFML-PrefixSpan algorithm is proposed by integrating these constraints with the original PrefixSpan algorithm, which allows discovering all CFML sequential patterns from the sequential database. The proposed CFML-PrefixSpan algorithm has been validated on synthetic sequential databases. The experimental results ensure that the efficacy of the sequential pattern mining process is further enhanced in view of the fact that the purchasing cost, time duration and length are integrated with the sequential pattern mining process.

Keywords: Zernike moments, building extraction, Mean Shift, SVM, VHSR satellite images.
 
Received July 15, 2011; accepted May 22, 2012
  

Full Text

Read 3478 times Last modified on Sunday, 13 January 2013 05:39
Share
Top
We use cookies to improve our website. By continuing to use this website, you are giving consent to cookies being used. More details…