Reverse search for enumeration
Discrete Applied Mathematics - Special volume: first international colloquium on graphs and optimization (GOI), 1992
Discovery of Frequent Episodes in Event Sequences
Data Mining and Knowledge Discovery
Scalable Algorithms for Association Mining
IEEE Transactions on Knowledge and Data Engineering
Fast Algorithms for Mining Association Rules in Large Databases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Mining Sequential Patterns by Pattern-Growth: The PrefixSpan Approach
IEEE Transactions on Knowledge and Data Engineering
Discovering Frequent Closed Partial Orders from Strings
IEEE Transactions on Knowledge and Data Engineering
Mining Frequent Diamond Episodes from Event Sequences
MDAI '07 Proceedings of the 4th international conference on Modeling Decisions for Artificial Intelligence
PAKDD '09 Proceedings of the 13th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining
Efficient algorithms for mining frequent and closed patterns from semi-structured data
PAKDD'08 Proceedings of the 12th Pacific-Asia conference on Advances in knowledge discovery and data mining
A simple characterization on serially constructible episodes
PAKDD'08 Proceedings of the 12th Pacific-Asia conference on Advances in knowledge discovery and data mining
Mining sectorial episodes from event sequences
DS'06 Proceedings of the 9th international conference on Discovery Science
A polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
| Hi-index | 0.00 |
In this paper, first we introduce a bipartite episode of the form A ***B for two sets A and B of events, which means that every event of A is followed by every event of B . Then, we present an algorithm that finds all frequent bipartite episodes from an input sequence without duplication in O (|Σ| ·N ) time per an episode and in O (|Σ|2 n ) space, where Σ is an alphabet, N is total input size of $\mathcal S$, and n is the length of S . Finally, we give experimental results on artificial and real sequences to evaluate the efficiency of the algorithm.