Mining Sequential Patterns: Generalizations and Performance Improvements
EDBT '96 Proceedings of the 5th International Conference on Extending Database Technology: Advances in Database Technology
WUM - A Tool for WWW Ulitization Analysis
WebDB '98 Selected papers from the International Workshop on The World Wide Web and Databases
Sequential PAttern mining using a bitmap representation
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
Mining Web Log Sequential Patterns with Position Coded Pre-Order Linked WAP-Tree
Data Mining and Knowledge Discovery
Mining frequent itemsets with partial enumeration
Proceedings of the 44th annual Southeast regional conference
Generalization of pattern-growth methods for sequential pattern mining with gap constraints
MLDM'03 Proceedings of the 3rd international conference on Machine learning and data mining in pattern recognition
| Hi-index | 0.00 |
In this paper, we extend the pattern-growth web access pattern mining algorithms [1, 2, 3] with partial enumeration. The extended algorithm can grow the frequent patterns with more than one symbol at a time and unifies the pattern-growth and apriori algorithms [4]. The experimental results show that for the databases of long sequences, the best performance is neither given by the pattern-growth algorithms nor by the full apriori enumeration algorithms, but rather by the mining with partial enumeration in the middle.