(Enter summary)
Abstract: The problem of efficiently and accurately locating patterns
of interest in massive time series data sets is an
important and non-trivial problem in a wide variety
of applications, including diagnosis and monitoring of
complex systems, biomedical data analysis, and exploratory
data analysis in scientific and business time
series. In this paper a probabilistic approach is taken
to this problem. Using piecewise linear segmentations
as the underlying representation, local features (such
as peaks,... (Update)
Cited by: More
Parameter Free Bursty Events Detection in Text Streams - Fung, Yu, Yu, Lu (2005)
(Correct)
Bursty and Hierarchical Structure in Streams - Jon Kleinbe Rg (2002)
(Correct)
Summarization of Spacecraft Telemetry Data by.. - Yairi, Ogasawara, .. (2004)
(Correct)
Active bibliography (related documents): More All
0.3: A Fast and Robust Method for Pattern Matching in Time.. - Eamonn Keogh Department (1997)
(Correct)
0.1: An Enhanced Representation of Time Series Which Allows Fast.. - Keogh, Pazzani (1998)
(Correct)
0.1: An Indexing Scheme for Fast Similarity Search in Large Time.. - Keogh, Pazzani (1999)
(Correct)
Similar documents based on text: More All
0.4: Mining Motifs in Massive Time Series Databases - Patel, Keogh, Lin, Lonardi (2002)
(Correct)
0.3: Finding Motifs in Time Series - Lin, Keogh, Lonardi, Patel (2002)
(Correct)
0.2: Iterative Deepening Dynamic Time Warping for Time Series - Chu, Keogh, Hart, Pazzani (2002)
(Correct)
Related documents from co-citation: More All
27: Fast subsequence matching in time-series databases
- Faloutsos, Ranganathan et al. - 1994
21: Approximate Queries and Representations for Large Data Sequences
- Shatkay, Zdonik - 1996
19: Fast similarity search in the presence of noise (context) - Agrawal, Lin et al. - 1995
BibTeX entry: (Update)
E. Keogh and P. Smyth, "A probabilistic approach to fast pattern matching in time series databases," in Proceedings of the Third International Conference on Knowledge Discovery and Data Mining (KDD'97), D. Heckerman, H. Mannila, D. Pregibon, and R. Uthurusamy, eds., pp. 24--30, AAAI Press, 1997. http://citeseer.ist.psu.edu/keogh97probabilistic.html More
@inproceedings{ keogh97probabilistic,
author = "E. Keogh and P. Smyth",
title = "A probabilistic approach to fast pattern matching in time series databases",
booktitle = "Third International Conference on Knowledge Discovery and Data Mining",
publisher = "AAAI Press, Menlo Park, California.",
address = "Newport Beach, CA, USA",
editor = "D. Heckerman and H. Mannila and D. Pregibon and R. Uthurusamy",
pages = "24--30",
year = "1997",
url = "citeseer.ist.psu.edu/keogh97probabilistic.html" }
Citations (may not include all citations):
241
Fast Subsequence Matching in Time-Series Databases
- Faloutsos, Ranganathan et al. - 1994 ACM DBLP
105
Probabilistic independence networks for hidden Markov probab..
- Smyth, Heckerman et al. - 1997 ACM DBLP
103
Some informational aspects of visual perception (context) - Attneave - 1954
39
Fast Similarity Search in the Presence of Noise, Scaling, an..
- Agrawal, Lin et al. - 1995 ACM DBLP
29
Using Dynamic Time Warping to Find Patterns in Time Series (context) - Berndt, Clifford - 1994 DBLP
26
Recognition of planar object classes
- Burl, Perona - 1996 ACM DBLP
20
Hidden Markov models for fault detection in dynamic systems (context) - Smyth - 1994
12
A System for Approximate Tree Matching (context) - Wang, Zhang et al. - 1994 ACM DBLP
12
Waveform segmentation through functional approximation (context) - Pavlidis - 1974
10
Structural Processing of Waveforms as Trees (context) - Shaw, Defigueiredo - 1990
1
Minimum length encoding and inductive inference (context) - Pednault - 1991
The graph only includes citing articles where the year of publication is known.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC