Abstract
The analysis of time series is extremely important in the field of medicine, because this is the format of many medical data types. Most of the approaches that address this problem are based on numerical algorithms that calculate distances, clusters, reference models, etc. However, a symbolic rather than numerical analysis is sometimes needed to search for the characteristics of time series. Symbolic information helps users to efficiently analyse and compare time series in the same or in a similar way as a domain expert would. This paper describes the definition of the symbolic domain, the process of converting numerical into symbolic time series and a distance for comparing symbolic temporal sequences. Then, the paper focuses on a method to create the symbolic reference model for a certain population using grammar-guided genetic programming. The work is applied to the isokinetics domain within an application called I4.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Alonso, F., Martínez, L., Pérez, A., Santamaría, A., Valente, J.P.: Symbol Extraction Method and Symbolic Distance for Analysing Medical Time Series. In: Maglaveras, N., Chouvarda, I., Koutkias, V., Brause, R. (eds.) ISBMDA 2006. LNCS (LNBI), vol. 4345, pp. 311–322. Springer, Heidelberg (2006)
Alonso, F., Valente, J.P., Martínez, L., Montes, C.: Discovering Patterns and Reference Models in the Medical Domain of Isokinetics. In: Zurada, J.M. (ed.) New Generations of Data Mining Applications. IEEE Press/Wiley (2005)
Lin, J., Keogh, E., Lonardi, S., Patel, P.: Finding Motifs in Time Series. In: Proceedings of the 2nd Workshop on Temporal Data Mining. At the 8th ACM SIGKDD Int’l Conference on Knowledge Discovery and Data Mining, Edmonton, Alberta, Canada, pp. 53–68 (2002)
Lin, J., Keogh, E., Lonardi, S., Chiu, B.: A symbolic representation of time series, with implications for streaming algorithms. In: Proceedings of 8th ACM SIGMOD workshop on Research issues in data mining and knowledge discovery, San Diego, California, pp. 2–11 (2003)
Needleman, S.B., Wunsch, C.D.: A general method applicable to the search for similarities in the amino acid sequences of two proteins. J. Mol. Biol. 48, 443–453 (1970)
Luke, S.: Two Fast Tree-Creation Algorithms for Genetic Programming. IEEE Trans. on Evolutionary Computation 4(3), 274–283 (2000)
Koza, J.R., Keane, M.A., Streeter, M.J., et al.: Genetic Programming IV: Routine Human-Competitive Machine Intelligence. Kluwer Academic Publishers, Norwell (2005)
Langdon, W.B., Poli, R.: Foundations of Genetic Programming. Springer, London (2001)
Brindle, A.: Genetic Algorithms for Function Optimization. PhD Thesis, University of Alberta (1991)
Baker, J.E.: Reducing Bias and Inefficiency in the Selection Algorithm. In: Proceedings of the 1st International Conference on Genetic Algorithms, pp. 101–111 (1987)
Crow, J.F., Kimura, M.: An Introduction to Population Genetics Theory. Harper and Row, New York (1970)
De Jong, K.A.: Analysis of Behaviour of a class of Genetic Adaptive Systems. PhD Thesis, University of Michigan (1975)
Koza, J.R.: Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge (1992)
D′haesler, P.: Context Preserving Crossover in Genetic Programming. In: Proceedings of the 1994 IEEE World Congress on Computational Intelligence, Orlando, Florida, USA, vol. 1, pp. 379–407 (1994)
Langdon, W.B.: Size Fair and Homologous Tree Genetic Programming Crossovers. In: Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 1999, pp. 1092–1097. Morgan Kaufmann, San Francisco (1999)
Crawford-Marks, R., Spector, L.: Size control via Size Fair Genetic Operators in the PushGP Genetic Programming System. In: Proceedings of the Genetic and Evolutionary Computation Conference, New York, USA, pp. 733–739 (2002)
Whigham, P.A.: Grammatically-Based Genetic Programming. In: Rosca, J.P. (ed.) Proceedings of the Workshop on Genetic Programming: From Theory to Real-World Applications, Tahoe City, California, USA, pp. 33–41 (1995)
Couchet, J., Manrique, D., Ríos, J., Rodríguez-Patón, A.: Crossover and mutation operators for grammar-guided genetic programming. Soft Computing - A Fusion of Foundations, Methodologies and Applications 11(10), 943–955 (2007)
Grosman, B., Lewin, D.R.: Adaptive genetic programming for steady-state process modelling. Comput. Chem. Eng. 28, 2779–2790 (2004)
Hussain, T.S.: Attribute grammar encoding of the structure and behavior of artificial neural networks. PhD Thesis, Queen’s University, Kingston, Ontario (2003)
Rodrigues, E., Pozo, A.: Grammar-guided genetic programming and automatically defined functions. In: Proceedings of the 16th Brazilian symposium on artificial intelligence, Brazil, pp. 324–333 (2002)
Hoai, N.X., McKay, R.I.: Is ambiguity useful or problematic for grammar guided genetic programming? A case of study. In: Proceedings of the 4th Asia-Pacific conference on simulated evolution and learning, Singapore, pp. 449–453 (2002)
Wong, M.L., Leung, K.S.: Data mining using grammar based genetic programming and applications. Kluwer, Norwell (2002)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Alonso, F., Martínez, L., Pérez, A., Santamaría, A., Valente, J.P. (2008). Modelling Medical Time Series Using Grammar-Guided Genetic Programming. In: Perner, P. (eds) Advances in Data Mining. Medical Applications, E-Commerce, Marketing, and Theoretical Aspects. ICDM 2008. Lecture Notes in Computer Science(), vol 5077. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70720-2_3
Download citation
DOI: https://doi.org/10.1007/978-3-540-70720-2_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-70717-2
Online ISBN: 978-3-540-70720-2
eBook Packages: Computer ScienceComputer Science (R0)