An optimal algorithm for closest pair maintenance (extended abstract)
Proceedings of the eleventh annual symposium on Computational geometry
Fast hierarchical clustering and other applications of dynamic closest pairs
Journal of Experimental Algorithmics (JEA)
Maintaining Stream Statistics over Sliding Windows
SIAM Journal on Computing
Efficient Similarity Search In Sequence Databases
FODO '93 Proceedings of the 4th International Conference on Foundations of Data Organization and Algorithms
An Online Algorithm for Segmenting Time Series
ICDM '01 Proceedings of the 2001 IEEE International Conference on Data Mining
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
C2P: Clustering based on Closest Pairs
Proceedings of the 27th International Conference on Very Large Data Bases
Mining Motifs in Massive Time Series Databases
ICDM '02 Proceedings of the 2002 IEEE International Conference on Data Mining
Probabilistic discovery of time series motifs
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Online Amnesic Approximation of Streaming Time Series
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Online summarization of dynamic time series data
The VLDB Journal — The International Journal on Very Large Data Bases
Detecting time series motifs under uniform scaling
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
Load shedding in a data stream manager
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
FAB-MAP: Probabilistic Localization and Mapping in the Space of Appearance
International Journal of Robotics Research
Proceedings of the VLDB Endowment
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
On-line motif detection in time series with SwiftMotif
Pattern Recognition
Proceedings of the 2008 ACM SIGGRAPH/Eurographics Symposium on Computer Animation
Toward unsupervised activity discovery using multi-dimensional motif detection in time series
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Similarity join in metric spaces
ECIR'03 Proceedings of the 25th European conference on IR research
Localized alternative cluster ensembles for collaborative structuring
ECML'06 Proceedings of the 17th European conference on Machine Learning
Finding semantics in time series
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
EnBlogue: emergent topic detection in web 2.0 streams
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Discovery of motifs to forecast outlier occurrence in time series
Pattern Recognition Letters
Discovering shakers from evolving entities via cascading graph inference
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
SciQL: bridging the gap between science and relational DBMS
Proceedings of the 15th Symposium on International Database Engineering & Applications
Significant motifs in time series
Statistical Analysis and Data Mining
Searching and mining trillions of time series subsequences under dynamic time warping
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
Unsupervised temporal commonality discovery
ECCV'12 Proceedings of the 12th European conference on Computer Vision - Volume Part IV
A time-dependent enhanced support vector machine for time series regression
Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
ACM Transactions on Knowledge Discovery from Data (TKDD) - Special Issue on ACM SIGKDD 2012
Pattern discovery in data streams under the time warping distance
The VLDB Journal — The International Journal on Very Large Data Bases
Parallel motif extraction from very long sequences
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Variance-wise segmentation for a temporal-adaptive SAX
AusDM '12 Proceedings of the Tenth Australasian Data Mining Conference - Volume 134
Data mining a trillion time series subsequences under dynamic time warping
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.00 |
The detection of repeated subsequences, time series motifs, is a problem which has been shown to have great utility for several higher-level data mining algorithms, including classification, clustering, segmentation, forecasting, and rule discovery. In recent years there has been significant research effort spent on efficiently discovering these motifs in static offline databases. However, for many domains, the inherent streaming nature of time series demands online discovery and maintenance of time series motifs. In this paper, we develop the first online motif discovery algorithm which monitors and maintains motifs exactly in real time over the most recent history of a stream. Our algorithm has a worst-case update time which is linear to the window size and is extendible to maintain more complex pattern structures. In contrast, the current offline algorithms either need significant update time or require very costly pre-processing steps which online algorithms simply cannot afford. Our core ideas allow useful extensions of our algorithm to deal with arbitrary data rates and discovering multidimensional motifs. We demonstrate the utility of our algorithms with a variety of case studies in the domains of robotics, acoustic monitoring and online compression.