Fast subsequence matching in time-series databases
SIGMOD '94 Proceedings of the 1994 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
ICDE '95 Proceedings of the Eleventh International Conference on Data Engineering
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
Fast Similarity Search in the Presence of Noise, Scaling, and Translation in Time-Series Databases
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
On the need for time series data mining benchmarks: a survey and empirical demonstration
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
Sequential PAttern mining using a bitmap representation
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
Efficient Mining of Partial Periodic Patterns in Time Series Database
ICDE '99 Proceedings of the 15th International Conference on Data Engineering
Fast similarity search in the presence of longitudinal scaling in time series databases
ICTAI '97 Proceedings of the 9th International Conference on Tools with Artificial Intelligence
A symbolic representation of time series, with implications for streaming algorithms
DMKD '03 Proceedings of the 8th ACM SIGMOD workshop on Research issues in data mining and knowledge discovery
CLOSET+: searching for the best strategies for mining frequent closed itemsets
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
BIDE: Efficient Mining of Frequent Closed Sequences
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Efficient Algorithms for Mining Closed Itemsets and Their Lattice Structure
IEEE Transactions on Knowledge and Data Engineering
SQUIRE: Sequential pattern mining with quantities
Journal of Systems and Software
RETRACTED: Efficient mining of temporal emerging itemsets from data streams
Expert Systems with Applications: An International Journal
Incremental updates of closed frequent itemsets over continuous data streams
Expert Systems with Applications: An International Journal
Efficient mining of sequential patterns with time constraints: Reducing the combinations
Expert Systems with Applications: An International Journal
Mining inter-sequence patterns
Expert Systems with Applications: An International Journal
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
Closed inter-sequence pattern mining
Journal of Systems and Software
| Hi-index | 12.05 |
In this paper, we propose an efficient algorithm, called CFP, for mining closed flexible patterns in time-series databases, where flexible gaps are allowed in a pattern. Our proposed algorithm involves three stages: transforming a time-series database into a symbolic database, generating all frequent patterns of length one from the transformed database, and mining closed flexible patterns in a depth-first search manner. In the proposed method, we design two pruning strategies and a closure checking scheme to reduce the search space and thus speed up the algorithm. The experimental results show that our algorithm outperforms the modified Apriori algorithm by an order of magnitude.