Abstract
The object of this paper is to present a model of non-stationary time series generated by switching between a finite number of random processes and to apply clustering algorithms to the task of estimating the model's parameters, We will also analyze the parameters which govern the algorithm's behavior to infer a novel cluster validity criterion for fuzzy clustering algorithms of temporal patterns.
The model defines a non-stationary composite source generated by randomly switching between elements of a finite number of random processes, The probability distribution which underlies the behavior of the switch is controlled by a temporal parameter vector process which is used to determine a different switching probability in each time instant. This definition allows us to analyze a drift between disjoint states of the composite model.
Chapter PDF
References
J. R. Deller, J. G. Proakis, J. H. L. Hansen Discrete-time processing of speech signals. Prentice-Hall, 1987
E. R. Kandel, J. H. Schwartz and T. M. Jessell, Principles of neural science. Prentice-Hall, 1991
I. Gath and A.B. Geva, “Unsupervised optimal fuzzy clustering”. IEEE Trans. On Pattern Anal. Machine Intell., Vol 7, pp. 773–781, 1989
K. Rose, E. Gurewitz and G. Fox “A deterministic annealing approach to clustering”. IEEE Pattern Recognition Letters 11, 1990 589–594
B. Porat, Digital Processing of Random Signals. Prentice-Hall, 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Policker, S., Geva, A.B. (1998). A model for non-stationary time series analysis with clustering methods. In: Amin, A., Dori, D., Pudil, P., Freeman, H. (eds) Advances in Pattern Recognition. SSPR /SPR 1998. Lecture Notes in Computer Science, vol 1451. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0033289
Download citation
DOI: https://doi.org/10.1007/BFb0033289
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64858-1
Online ISBN: 978-3-540-68526-5
eBook Packages: Springer Book Archive