Speech and Audio Signal Processing: Processing and Perception of Speech and Music
Speech and Audio Signal Processing: Processing and Perception of Speech and Music
Discovery of Frequent Episodes in Event Sequences
Data Mining and Knowledge Discovery
Discovering Frequent Event Patterns with Multiple Granularities in Time Sequences
IEEE Transactions on Knowledge and Data Engineering
Mining Sequential Patterns with Regular Expression Constraints
IEEE Transactions on Knowledge and Data Engineering
ICDE '95 Proceedings of the Eleventh International Conference on Data Engineering
Temporal Abstractions for Diabetic Patients Management
AIME '97 Proceedings of the 6th Conference on Artificial Intelligence in Medicine in Europe
Pattern discovery in sequences under a Markov assumption
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
Generalized Mixture of HMMs for Continuous Speech Recognition
ICASSP '97 Proceedings of the 1997 IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP '97)-Volume 2 - Volume 2
Reliable Detection of Episodes in Event Sequences
ICDM '03 Proceedings of the Third IEEE International Conference on Data Mining
Detection of Significant Sets of Episodes in Event Sequences
ICDM '04 Proceedings of the Fourth IEEE International Conference on Data Mining
Discovering clusters in motion time-series data
CVPR'03 Proceedings of the 2003 IEEE computer society conference on Computer vision and pattern recognition
Scouts, promoters, and connectors: the roles of ratings in nearest neighbor collaborative filtering
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
Out-of-core coherent closed quasi-clique mining from large dense graph databases
ACM Transactions on Database Systems (TODS)
Scouts, promoters, and connectors: The roles of ratings in nearest-neighbor collaborative filtering
ACM Transactions on the Web (TWEB)
A fast algorithm for finding frequent episodes in event streams
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
Unsupervised pattern mining from symbolic temporal data
ACM SIGKDD Explorations Newsletter - Special issue on data mining for health informatics
Stream prediction using a generative model based on frequent episodes in event sequences
Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
Mining temporal interval relational rules from temporal data
Journal of Systems and Software
Mining Interventions from Parallel Event Sequences
APWeb/WAIM '09 Proceedings of the Joint International Conferences on Advances in Data and Web Management
Sustainable operation and management of data center chillers using temporal data mining
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
A frequent pattern based framework for event detection in sensor network stream data
Proceedings of the Third International Workshop on Knowledge Discovery from Sensor Data
Leveraging Call Center Logs for Customer Behavior Prediction
IDA '09 Proceedings of the 8th International Symposium on Intelligent Data Analysis: Advances in Intelligent Data Analysis VIII
VOGUE: A variable order hidden Markov model with duration based on frequent sequence mining
ACM Transactions on Knowledge Discovery from Data (TKDD)
Mining consequence events in temporal health data
Intelligent Data Analysis - Knowledge Discovery in Bioinformatics
An algorithmic approach to event summarization
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Using interesting sequences to interactively build Hidden Markov Models
Data Mining and Knowledge Discovery
Rule generation for categorical time series with Markov assumptions
Statistics and Computing
Temporal data mining approaches for sustainable chiller management in data centers
ACM Transactions on Intelligent Systems and Technology (TIST)
Proceedings of the 20th ACM international conference on Information and knowledge management
VOGUE: a novel variable order-gap state machine for modeling sequences
PKDD'06 Proceedings of the 10th European conference on Principle and Practice of Knowledge Discovery in Databases
Mining closed episodes from event sequences efficiently
PAKDD'10 Proceedings of the 14th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining - Volume Part I
Discovering injective episodes with general partial orders
Data Mining and Knowledge Discovery
HIS'12 Proceedings of the First international conference on Health Information Science
Discovering lag intervals for temporal dependencies
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
Structural and temporal inference search (STIS): pattern identification in multimodal data
Proceedings of the 14th ACM international conference on Multimodal interaction
Mining frequent serial episodes over uncertain sequence data
Proceedings of the 16th International Conference on Extending Database Technology
Towards appliance usage prediction for home energy management
Proceedings of the fourth international conference on Future energy systems
Cross-Correlation Measure for Mining Spatio-Temporal Patterns
Journal of Database Management
Editorial: Pattern-growth based frequent serial episode discovery
Data & Knowledge Engineering
| Hi-index | 0.00 |
This paper establishes a formal connection between two common, but previously unconnected methods for analyzing data streams: discovering frequent episodes in a computer science framework and learning generative models in a statistics framework. We introduce a special class of discrete Hidden Markov Models (HMMs), called Episode Generating HMMs (EGHs), and associate each episode with a unique EGH. We prove that, given any two episodes, the EGH that is more likely to generate a given data sequence is the one associated with the more frequent episode. To be able to establish such a relationship, we define a new measure of frequency of an episode, based on what we call nonoverlapping occurrences of the episode in the data. An efficient algorithm is proposed for counting the frequencies for a set of episodes. Through extensive simulations, we show that our algorithm is both effective and more efficient than current methods for frequent episode discovery. We also show how the association between frequent episodes and EGHs can be exploited to assess the significance of frequent episodes discovered and illustrate empirically how this idea may be used to improve the efficiency of the frequent episode discovery.