CUSE: A novel cube-based approach for sequential pattern mining

Sequences are one of the most important types of patterns which are extracted from datasets and are used to construct association rules. Several sequential pattern mining methods have been proposed in the literature. This paper introduces a novel bit wise approach to compress and represent the sequence database as a 3-dimentional array and use a corresponding mining method to extract frequent sequences from the compressed structure. Experimental results and performance study show that this algorithm outperforms the best previously developed algorithms.

[1]  Ahmad Abdollahzadeh Barforoush,et al.  Efficient colossal pattern mining in high dimensional datasets , 2012, Knowl. Based Syst..

[2]  Zhenglu Yang,et al.  LAPIN-SPAM: An Improved Algorithm for Mining Sequential Pattern , 2005, 21st International Conference on Data Engineering Workshops (ICDEW'05).

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

[4]  Kuo-Chung Chu,et al.  Closed inter-sequence pattern mining , 2013, J. Syst. Softw..

[5]  Sohrabi Mohammad Karim,et al.  Association Rule Mining Using New FP-Linked List Algorithm , 2016 .

[6]  Jiawei Han,et al.  BIDE: efficient mining of frequent closed sequences , 2004, Proceedings. 20th International Conference on Data Engineering.

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

[8]  Purushothama Raju,et al.  Mining Closed Sequential Patterns in Large Sequence Databases , 2015 .

[9]  Bay Vo,et al.  Combination of dynamic bit vectors and transaction information for mining frequent closed sequences efficiently , 2015, Eng. Appl. Artif. Intell..

[10]  Jian Pei,et al.  Mining frequent patterns without candidate generation , 2000, SIGMOD 2000.

[11]  Mohammad Karim Sohrabi,et al.  A comprehensive study on the effects of using data mining techniques to predict tie strength , 2016, Comput. Hum. Behav..

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

[13]  C. Raghavendra Rao,et al.  Sequential Pattern Mining With Multiple Minimum Supports by MS-SPADE , 2012 .

[14]  Qiming Chen,et al.  PrefixSpan,: mining sequential patterns efficiently by prefix-projected pattern growth , 2001, Proceedings 17th International Conference on Data Engineering.

[15]  Xifeng Yan,et al.  CloSpan: Mining Closed Sequential Patterns in Large Datasets , 2003, SDM.

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

[17]  Antonio Gomariz,et al.  VMSP: Efficient Vertical Mining of Maximal Sequential Patterns , 2014, Canadian Conference on AI.

[18]  Vahid Ghods,et al.  Top-down vertical itemset mining , 2015, International Conference on Graphic and Image Processing.

[19]  Wei Li,et al.  Research on a frequent maximal induced subtrees mining method based on the compression tree sequence , 2015, Expert Syst. Appl..

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

[21]  Ahmad Abdollahzadeh Barforoush,et al.  Parallel frequent itemset mining using systolic arrays , 2013, Knowl. Based Syst..

[22]  Jiadong Ren,et al.  Mining frequent biological sequences based on bitmap without candidate sequence generation , 2016, Comput. Biol. Medicine.

[23]  Wei Liu,et al.  Frequent patterns mining in multiple biological sequences , 2013, Comput. Biol. Medicine.

[24]  Das Amrita,et al.  Mining Association Rules between Sets of Items in Large Databases , 2013 .