Breaking the barrier of transactions: mining inter-transaction association rules
KDD '99 Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining
Principles of data mining
Discovery of Frequent Episodes in Event Sequences
Data Mining and Knowledge Discovery
Scalable Algorithms for Association Mining
IEEE Transactions on Knowledge and Data Engineering
ICDM '01 Proceedings of the 2001 IEEE International Conference on Data Mining
Discovering Sequential Association Rules with Constraints and Time Lags in Multiple Sequences
ISMIS '02 Proceedings of the 13th International Symposium on Foundations of Intelligent Systems
Data Mining in Time Series Database
Data Mining in Time Series Database
Data Mining: Concepts and Techniques
Data Mining: Concepts and Techniques
A survey of interestingness measures for knowledge discovery
The Knowledge Engineering Review
An efficient algorithm for mining frequent inter-transaction patterns
Information Sciences: an International Journal
Data & Knowledge Engineering
Efficient mining of frequent episodes from complex sequences
Information Systems
Computers and Industrial Engineering
Statistical mining of interesting association rules
Statistics and Computing
Fuzzy expert systems and challenge of new product pricing
Computers and Industrial Engineering
Hi-index | 0.00 |
This paper shows and describes a heuristic methodology applied to Time Series Databases (TSDBs) by approaching Temporal Data Mining (TDM). The methodology focuses on temporal association rules from multiple time series which could be captured from many applications and processes (industrial processes, financial assets, environment variables, demographic series, etc). This heuristic methodology is designed to obtain temporal association rules that represent the repeated relationships between events/episodes of a big number of time series, using a time window and a time lag. The process involves finding significant events into multivariate time series and then, with the consequent fixed, extracting previous important episodes within a time window and time lag established. In the next stage, a search is made for sequences of episodes or items that are repeated amongst the various time series. Finally, extraction is carried out of the temporal association rules for those cases that appear on a high number of times and have a high rate of hits. This proposal is computerised by using R-language supported with a software tool that has been called CONOTOOL.