Mining Compressed Repetitive Gapped Sequential Patterns Efficiently
ADMA '09 Proceedings of the 5th International Conference on Advanced Data Mining and Applications
Discovering Relevant Cross-Graph Cliques in Dynamic Networks
ISMIS '09 Proceedings of the 18th International Symposium on Foundations of Intelligent Systems
Mining closed discriminative dyadic sequential patterns
Proceedings of the 14th International Conference on Extending Database Technology
SBAD: sequence based attack detection via sequence comparison
PSDML'10 Proceedings of the international ECML/PKDD conference on Privacy and security issues in data mining and machine learning
Probabilistic quality assessment based on article's revision history
DEXA'11 Proceedings of the 22nd international conference on Database and expert systems applications - Volume Part II
Mining direct antagonistic communities in explicit trust networks
Proceedings of the 20th ACM international conference on Information and knowledge management
Mining antagonistic communities from social networks
PAKDD'10 Proceedings of the 14th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining - Volume Part I
Mining frequent partial periodic patterns in spectrum usage data
Proceedings of the 2012 IEEE 20th International Workshop on Quality of Service
General algorithms for mining closed flexible patterns under various equivalence relations
ECML PKDD'12 Proceedings of the 2012 European conference on Machine Learning and Knowledge Discovery in Databases - Volume Part II
Probabilistically ranking web article quality based on evolution patterns
Transactions on Large-Scale Data- and Knowledge-Centered Systems VI
BIDE-Based parallel mining of frequent closed sequences with mapreduce
ICA3PP'12 Proceedings of the 12th international conference on Algorithms and Architectures for Parallel Processing - Volume Part II
Mining direct antagonistic communities in signed social networks
Information Processing and Management: an International Journal
MAIL: mining sequential patterns with wildcards
International Journal of Data Mining and Bioinformatics
Editorial: Pattern-growth based frequent serial episode discovery
Data & Knowledge Engineering
Mining sequential patterns with extensible knowledge representation
Intelligent Data Analysis
| Hi-index | 0.00 |
There is a huge wealth of sequence data available, for example, customer purchase histories, program execution traces, DNA, and protein sequences. Analyzing this wealth of data to mine important knowledge is certainly a worthwhile goal.In this paper, as a step forward to analyzing patterns in sequences, we introduce the problem of mining closed repetitive gapped subsequences and propose efficient solutions. Given a database of sequences where each sequence is an ordered list of events, the pattern we would like to mine is called repetitive gapped subsequence, which is a subsequence (possibly with gaps between two successive events within it) of some sequences in the database. We introduce the concept of repetitive support to measure how frequently a pattern repeats in the database. Different from the sequential pattern mining problem, repetitive support captures not only repetitions of a pattern in different sequences but also the repetitions within a sequence. Given a userspecified support threshold min_sup, we study finding the set of all patterns with repetitive support no less than min_sup. To obtain a compact yet complete result set and improve the efficiency, we also study finding closed patterns. Efficient mining algorithms to find the complete set of desired patterns are proposed based on the idea of instance growth. Our performance study on various datasets shows the efficiency of our approach. A case study is also performed to show the utility of our approach.