Mining association rules between sets of items in large databases
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Can we push more constraints into frequent pattern mining?
Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining
Discovery of Frequent Episodes in Event Sequences
Data Mining and Knowledge Discovery
ICDE '95 Proceedings of the Eleventh International Conference on 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 Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach
Data Mining and Knowledge Discovery
Mining serial-episode rules using minimal occurrences with gap constraint
ICCSA'13 Proceedings of the 13th international conference on Computational Science and Its Applications - Volume 1
Data mining of serial-episode association rules using gap-constrained minimal occurrences
International Journal of Business Intelligence and Data Mining
Hi-index | 0.00 |
This work extends the existing parallel- and serial-episode data mining algorithms to that for parallel connection of serial (PoS) episodes. The PoS-episodes can model more general situations and preserve the sequence information as well. The PoS-episode mining algorithm can provide episode-mining users a powerful mining tool and make the episode mining more flexible. To use the PoS-episode mining algorithm, users need to decide reasonable parameters like window width and minimum frequency ratio. Concepts and methods are provided by using Web log mining as example to illustrate the applicability of the PoS-episode mining and show how to decide reasonable parameters as well as evaluate the mining process.