Mining frequent patterns without candidate generation
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
FreeSpan: frequent pattern-projected sequential pattern mining
Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining
SPADE: an efficient algorithm for mining frequent sequences
Machine Learning
Mining Sequential Patterns: Generalizations and Performance Improvements
EDBT '96 Proceedings of the 5th International Conference on Extending Database Technology: Advances in Database Technology
PrefixSpan: Mining Sequential Patterns by Prefix-Projected Growth
Proceedings of the 17th 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
Sequential PAttern mining using a bitmap representation
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
Mining frequent sequential patterns with first-occurrence forests
Proceedings of the 46th Annual Southeast Regional Conference on XX
Hi-index | 0.00 |
The mining of frequent sequential patterns has been a hot and well studied area---under the broad umbrella of research known as KDD (Knowledge Discovery and Data Mining)---for well over a decade. Yet researchers are still uncovering interesting problems, new algorithms, and ways to improve upon existing methods. In this paper, we marry state-of-the-art frequent sequential pattern mining algorithms (e.g., SPAM, FOF, PrefixSpan), data structures (e.g., aggregate tree, bitmap), and other tried-and-true methods for candidate generation (e.g., apriori), in an attempt to derive a new algorithm with the best qualities of the aforementioned algorithms. In this paper, we disseminate the new algorithm created, lessons learned, and future work to be done.