DRL-Prefixspan: A novel pattern growth algorithm for discovering downturn, revision and launch (DRL) sequential patterns

Discovering sequential patterns is a rather well-studied area in data mining and has been found many diverse applications, such as basket analysis, telecommunications, etc. In this article, we propose an efficient algorithm that incorporates constraints and promotion-based marketing scenarios for the mining of valuable sequential patterns. Incorporating specific constraints into the sequential mining process has enabled the discovery of more user-centered patterns. We move one step ahead and integrate three significant marketing scenarios for mining promotion-oriented sequential patterns. The promotion-based market scenarios considered in the proposed research are 1) product Downturn, 2) product Revision and 3) product Launch (DRL). Each of these scenarios is characterized by distinct item and adjacency constraints. We have developed a novel DRL-PrefixSpan algorithm (tailored form of the PrefixSpan) for mining all length DRL patterns. The proposed algorithm has been validated on synthetic sequential databases. The experimental results demonstrate the effectiveness of incorporating the promotion-based marketing scenarios in the sequential pattern mining process.

[1]  Jianyong Wang,et al.  Mining sequential patterns by pattern-growth: the PrefixSpan approach , 2004, IEEE Transactions on Knowledge and Data Engineering.

[2]  Chin-Chen Chang,et al.  Isolated items discarding strategy for discovering high utility itemsets , 2008, Data Knowl. Eng..

[3]  Suh-Yin Lee,et al.  Efficient mining of sequential patterns with time constraints by delimited pattern growth , 2005, Knowledge and Information Systems.

[4]  Ramakrishnan Srikant,et al.  Mining quantitative association rules in large relational tables , 1996, SIGMOD '96.

[5]  Poonam Sharma,et al.  PrefixSpan: Mining Sequential Patterns by Prefix- Projected Pattern , 2011 .

[6]  M. Teisseire,et al.  Mining Sequential Patterns with Time Constraints : Reducing the Combinations , 2007 .

[7]  Lior Rokach,et al.  Decomposition Methodology for Knowledge Discovery and Data Mining , 2005, The Data Mining and Knowledge Discovery Handbook.

[8]  Jian Pei,et al.  Mining sequential patterns with constraints in large databases , 2002, CIKM '02.

[9]  Cláudia Antunes,et al.  SEQUENTIAL PATTERN MINING WITH APPROXIMATED CONSTRAINTS , 2004 .

[10]  Yen-Liang Chen,et al.  Constraint-based sequential pattern mining: The consideration of recency and compactness , 2006, Decis. Support Syst..

[11]  Sourav S. Bhowmick,et al.  Sequential Pattern Mining: A Survey , 2003 .

[12]  Jiadong Ren,et al.  Sliding-Window Filtering with Constraints of Compactness and Recency in Incremental Database , 2008, 2008 Fourth International Conference on Networked Computing and Advanced Information Management.

[13]  Priyanka Tiwari,et al.  Multidimensional Sequential Pattern Mining , 2012 .

[14]  Gregory Piatetsky-Shapiro,et al.  Advances in Knowledge Discovery and Data Mining , 2004, Lecture Notes in Computer Science.

[15]  Kyuseok Shim,et al.  Mining Sequential Patterns with Regular Expression Constraints , 2002, IEEE Trans. Knowl. Data Eng..

[16]  Jian Pei,et al.  Constraint-based sequential pattern mining: the pattern-growth methods , 2007, Journal of Intelligent Information Systems.

[17]  Cláudia Antunes,et al.  Generalization of Pattern-Growth Methods for Sequential Pattern Mining with Gap Constraints , 2003, MLDM.

[18]  Tadeusz Morzy,et al.  Efficient Constraint-Based Sequential Pattern Mining Using Dataset Filtering Techniques , 2002, BalticDB&IS.

[19]  Mohammed J. Zaki,et al.  SPADE: An Efficient Algorithm for Mining Frequent Sequences , 2004, Machine Learning.

[20]  Johannes Gehrke,et al.  Sequential PAttern mining using a bitmap representation , 2002, KDD.

[21]  Salvatore Orlando,et al.  A new algorithm for gap constrained sequence mining , 2004, SAC '04.

[22]  Yen-Liang Chen,et al.  Discovering recency, frequency, and monetary (RFM) sequential patterns from customers' purchasing data , 2009, Electron. Commer. Res. Appl..

[23]  Ramakrishnan Srikant,et al.  Mining sequential patterns , 1995, Proceedings of the Eleventh International Conference on Data Engineering.

[24]  R. Suganya,et al.  Data Mining Concepts and Techniques , 2010 .

[25]  Umeshwar Dayal,et al.  PrefixSpan: Mining Sequential Patterns by Prefix-Projected Growth , 2001, ICDE 2001.

[26]  Maguelonne Teisseire,et al.  Incremental mining of sequential patterns in large databases , 2003, Data Knowl. Eng..

[27]  Ming-Syan Chen,et al.  A General Model for Sequential Pattern Mining with a Progressive Database , 2008, IEEE Transactions on Knowledge and Data Engineering.

[28]  Vijay V. Raghavan,et al.  A Theoretical Framework for Association Mining Based on the Boolean Retrieval Model , 2001, DaWaK.

[29]  Roberto J. Bayardo,et al.  The many roles of constraints in data mining , 2002 .

[30]  Lior Rokach,et al.  Decomposition Methodology for Knowledge Discovery and Data Mining - Theory and Applications , 2005, Series in Machine Perception and Artificial Intelligence.

[31]  Philip S. Yu,et al.  Data Mining: An Overview from a Database Perspective , 1996, IEEE Trans. Knowl. Data Eng..

[32]  Ramakrishnan Srikant,et al.  Mining Sequential Patterns: Generalizations and Performance Improvements , 1996, EDBT.

[33]  Suh-Yin Lee,et al.  Interactive sequence discovery by incremental mining , 2004, Inf. Sci..

[34]  D. Edwards.  Data Mining: Concepts, Models, Methods, and Algorithms , 2003 .

[35]  Yen-Liang Chen,et al.  On mining multi-time-interval sequential patterns , 2009, Data Knowl. Eng..