Parallel and Distributed Search for Structure in Multivariate Time Series

Abstract

Efficient data mining algorithms are crucial for effective knowledge discovery. We present the Multi-Stream Dependency Detection ( msdd ) data mining algorithm that performs a systematic search for structure in multivariate time series of categorical data. The systematicity of msdd 's search makes implementation of both parallel and distributed versions straightforward. Distributing the search for structure over multiple processors or networked machines makes mining of large numbers of databases or very large databases feasible. We present results showing that msdd efficiently finds complex structure in multivariate time series, and that the distributed version finds the same structure in approximately 1/ n of the time required by msdd , where n is the number of machines across which the search is distributed.

Cite

Text

Oates et al. "Parallel and Distributed Search for Structure in Multivariate Time Series." European Conference on Machine Learning, 1997. doi:10.1007/3-540-62858-4_84

Markdown

[Oates et al. "Parallel and Distributed Search for Structure in Multivariate Time Series." European Conference on Machine Learning, 1997.](https://mlanthology.org/ecmlpkdd/1997/oates1997ecml-parallel/) doi:10.1007/3-540-62858-4_84

BibTeX

@inproceedings{oates1997ecml-parallel,
  title     = {{Parallel and Distributed Search for Structure in Multivariate Time Series}},
  author    = {Oates, Tim and Schmill, Matthew D. and Cohen, Paul R.},
  booktitle = {European Conference on Machine Learning},
  year      = {1997},
  pages     = {191-198},
  doi       = {10.1007/3-540-62858-4_84},
  url       = {https://mlanthology.org/ecmlpkdd/1997/oates1997ecml-parallel/}
}