An efficient method for pattern discovery from discrete time series is introduced in this paper. The method utilizes two parallel streams of data, a discrete unit time-series and a set of labeled events, From these inputs it builds associative models between systematically co-occurring structures existing in both streams. The models are based on transitional probabilities of events at several different time scales. Learning and recognition processes are incremental, making the approach suitable for online learning tasks. The capabilities of the algorithm are demonstrated in a continuous speech recognition task operating in varying noise levels.
Cite as: Räsänen, O.J., Laine, U.K., Altosaar, T. (2009) A noise robust method for pattern discovery in quantized time series: the concept matrix approach. Proc. Interspeech 2009, 3035-3038, doi: 10.21437/Interspeech.2009-562
@inproceedings{rasanen09c_interspeech,
author={Okko Johannes Räsänen and Unto Kalervo Laine and Toomas Altosaar},
title={{A noise robust method for pattern discovery in quantized time series: the concept matrix approach}},
year=2009,
booktitle={Proc. Interspeech 2009},
pages={3035--3038},
doi={10.21437/Interspeech.2009-562}
}