A Family of Algorithms for Finding Temporal Structure in Data
Abstract
Finding patterns in temporally structured data is an important and difficult problem. Examples of temporally structured data include time series of economic indicators, distributed network status reports, and continuous streams such as flight recorder data. We have developed a family of algorithms for finding structure in multivariate, discrete-valued time series data (Oates & Cohen 1996b; Oates, Schmill, & Cohen 1996; Oates et al. 1995). In this paper, we introduce a new member of that family for handling event-based data, and offer an empirical characterization of a time series based algorithm.
Cite
Text
Oates et al. "A Family of Algorithms for Finding Temporal Structure in Data." Proceedings of the Sixth International Workshop on Artificial Intelligence and Statistics, 1997.Markdown
[Oates et al. "A Family of Algorithms for Finding Temporal Structure in Data." Proceedings of the Sixth International Workshop on Artificial Intelligence and Statistics, 1997.](https://mlanthology.org/aistats/1997/oates1997aistats-family/)BibTeX
@inproceedings{oates1997aistats-family,
title = {{A Family of Algorithms for Finding Temporal Structure in Data}},
author = {Oates, Tim and Schmill, Matthew J. and Jensen, David and Cohen, Paul R.},
booktitle = {Proceedings of the Sixth International Workshop on Artificial Intelligence and Statistics},
year = {1997},
pages = {371-378},
volume = {R1},
url = {https://mlanthology.org/aistats/1997/oates1997aistats-family/}
}