Abstract
This work is about developing a new method for the analysis of evoked potentials of cognitive activities that combines methods from statistics and sequence alignment to tackle the following two problems: the visualization of high dimensional sequential data and the unsupervised discovery of patterns within this multivariate set of real valued time series data. The sequences of the original high dimensional vectors are transformed to discrete sequences by vector quantization plus Sammon mapping of the codebook. Instead of having to conduct a time-consuming search for common subsequences in the set of multivariate sequential data a multiple sequence alignment procedure can be applied to the set of one-dimensional discrete symbolic time series. The methods are described in detail and the results are shown to be significantly better than those obtained for two sets of randomized artificial data.
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Bacon D.J., Anderson W.F.: Multiple Sequence Alignment, Journal of Molecular Biology, 191, 153–161, 1986.
Barton G.J.: Protein Multiple Sequence Alignment and Flexible Pattern Matching, Methods in Enzymology, Vol. 183, pp. 403–428, 1990.
Duda R.O., Hart P.E.: Pattern Classification and Scene Analysis, John Wiley & Sons, N.Y., 1973.
Flexer A.: Limitations of Self-Organizing Maps for Vector Quantization and Multidimensional Scaling, in Mozer M.C., et al. (eds.), Advances in Neural Information Processing Systems 9, MIT Press/Bradford Books, pp. 445–451, 1997.
Heckerman D., Mannila H., Pregibon D., Uthurusamy R. (eds.): KDD-97: Proceedings Third International Conference on Knowledge Discovery & Data Mining, AAAI Press, Menlo Park, 1997.
Keogh E., Smyth P.: A Probabilistic Approach to Fast Pattern Matching in Time Series Databases, in [5], pp. 24–30.
Ketterlin A.: Clustering Sequences of Complex Objects, in [5], pp. 215–218.
Mannila H., Toivonen H., Verkamo A.I.: Discovery of Frequent Episodes in Event Sequences, Data Mining and Knowledge Discovery, Volume 1, Issue 3, 1997.
Rabiner L.R., Juang B.H.: An Introduction To Hidden Markov Models, IEEE ASSP Magazine, 3(1):4–16, 1986.
Sammon J.W.: A Nonlinear Mapping for Data Structure Analysis, IEEE Transactions on Comp., Vol. C-18, No. 5, p.401–409, 1969.
Sankoff D., Kruskal J.B. (eds.): Time warps, string edits, and macromolecules: the theory and practice of sequence comparison, Addison-Wesley, Reading, MA, 1983.
Taylor W.R.: Multiple Protein Sequence Alignment: Algorithms and Gap Insertion, Methods in Enzymology, Vol. 266, pp.343–367, 1996.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Flexer, A., Bauer, H. (1998). Discovery of common subsequences in cognitive evoked potentials. In: Żytkow, J.M., Quafafou, M. (eds) Principles of Data Mining and Knowledge Discovery. PKDD 1998. Lecture Notes in Computer Science, vol 1510. Springer, Berlin, Heidelberg . https://doi.org/10.1007/BFb0094833
Download citation
DOI: https://doi.org/10.1007/BFb0094833
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65068-3
Online ISBN: 978-3-540-49687-8
eBook Packages: Springer Book Archive