Mining Top-k Distinguishing Sequential Patterns with Gap Constraint

Distinguishing sequential pattern can be used to present the difference between data sets, and thus has wide applications, such as commodity recommendation, user behavior analysis and power supply predication. Previous algorithms on mining distinguishing sequential patterns ask users to set both positive and negative support thresholds. Without sufficient prior knowledge of data sets, it is difficult for users to set the appropriate support thresholds, resulting in missing some significant contrast patterns. To deal with this problem, an algorithm, called k DSP-miner(top-k distinguishing sequential patterns with gap constraint miner), for mining top-k distinguishing sequential patterns satisfying the gap constraint is proposed. Instead of setting the contrast thresholds directly, a user-friendly parameter, which indicates the expected number of top distinguishing patterns to be discovered, is introduced in k DSP-miner. It makes k DSP-miner easy to use, and its mining result more comprehensible. In order to improve the efficiency of k DSP-miner, several pruning strategies and a heuristic strategy are designed. Furthermore, a multi-thread version of k DSP-miner is designed to enhance its applicability in dealing with the sequences with high dimensional set of elements. Experiments on real world data sets demonstrate that the proposed algorithm is effective and efficient.

[1]  Xindong Wu,et al.  Keyword extraction based on sequential pattern mining , 2011, ICIMCS '11.

[2]  Taghi M. Khoshgoftaar,et al.  Contrast Pattern Mining with Gap Constraints for Peptide Folding Prediction , 2008, FLAIRS.

[3]  Paulo J. Azevedo,et al.  Protein Sequence Pattern Mining with Constraints , 2005, PKDD.

[4]  Xiaosong Li,et al.  Mining Itemset-based Distinguishing Sequential Patterns with Gap Constraint , 2015, DASFAA.

[5]  Changjie Tang,et al.  Efficient Mining of Density-Aware Distinguishing Sequential Patterns with Gap Constraints , 2014, DASFAA.

[6]  Xindong Wu,et al.  PMBC: Pattern mining from biological sequences with wildcard constraints , 2013, Comput. Biol. Medicine.

[7]  Kevin Y. Yip,et al.  Mining periodic patterns with gap requirement from sequences , 2007 .

[8]  Araceli Sanchis,et al.  Activity Recognition Using Hybrid Generative/Discriminative Models on Home Environments Using Binary Sensors , 2013, Sensors.

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

[10]  Ke Wang,et al.  Frequent-subsequence-based prediction of outer membrane proteins , 2003, KDD '03.

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

[12]  Ron Rymon,et al.  Search through Systematic Set Enumeration , 1992, KR.

[13]  Philip S. Yu,et al.  Discovering Frequent Closed Partial Orders from Strings , 2006, IEEE Transactions on Knowledge and Data Engineering.

[14]  Ming Li,et al.  Efficient Mining of Gap-Constrained Subsequences and Its Various Applications , 2012, TKDD.

[15]  Judy Kay,et al.  Finding Top-n Emerging Sequences to Contrast Sequence Sets , 2007 .

[16]  James Bailey,et al.  Mining Minimal Distinguishing Subsequence Patterns with Gap Constraints , 2005, ICDM.

[17]  Jiawei Han,et al.  Mining top-k frequent closed patterns without minimum support , 2002, 2002 IEEE International Conference on Data Mining, 2002. Proceedings..

[18]  Darrell Conklin,et al.  Comparative Pattern Analysis of Cretan Folk Songs , 2011 .

[19]  Yadong Zhang,et al.  Sliding-Window Top-k Pattern Mining on Uncertain Streams , 2011 .