Abstract
If knowledge can be gained at the pre-processing stage, concerning the approximate underlying structure of large databases, it can be used to assist in performing various operations such as variable subset selection and model selection. In this paper we examine three methods, including two evolutionary methods for finding this approximate structure as quickly as possible. We describe two applications where the fast identification of correlation structure is essential and apply these three methods to the associated datasets. This automatic approach to the searching of approximate structure is useful in applications where domain specific knowledge is not readily available.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
T. Baeck, G. Rudolph, H.-P. Schwefel, “Evolutionary Programming and Evolution Strategies: Similarities and Differences”, D. B. Fogel and W. Atmar,editor: Proceedings of the Second Annual Conference on Evolutionary Programming, 11–22, 1993.
T. Baeck, “Evolutionary Algorithms: Theory and Practice”, Oxford University Press, 1996.
C. Chatfield, “The Analysis of Time Series-An Introduction”, Chapman and Hall, 4th edition, 1989.
D. Crabb, F. Fitzke, A. McNaught, R. Hitchings, “A Profile of the Spatial Dependence of Pointwise Sensitivity Across The Glaucomatous Visual Field”, Perimetry Update, 1996/1997, pp. 301–310.
D. B. Fogel, “Evolutionary Computation-Toward a New Philosophy of Machine Intelligence”, IEEE Press, 1995.
A. Ghozeil and D. B. Fogel, “Discovering Patterns in Spatial Data using Evolutionary Programming”, Genetic Programming 1996: Proceedings of the First Annual Conference, J. R. Koza, D. E. Goldberg, D. B. Fogel, and R. L. Riolo (eds.), MIT Press, Cambridge, MA, pp. 521–527.
D. E. Goldberg, “Genetic Algorithms in Search, Optimisation, and Machine Learning”, Addison Wesley, 1989
M. J. Haley, “The Field Analyzer Primer”, Allergan Humphrey, 1987.
A. Heijl, A. Lindgren, G. Lindgren, “Inter-Point Correlations of Deviations of Threshold Values in Normal and Glaucomatous Visual Fields”, Perimetry Update, 1988/89, pp. 177–183.
J. H. Holland, “Adaptation in Natural and Artificial Systems”, University of Michigan Press, (1995).
R. Sadeghbeigi, “Fluid Catalytic Cracking Handbook”, Gulf Publishing Company, 1995.
G. Snedecor and W. Cochran, “Statistical Methods”, Iowa State University Press, 6th edition, 1967.
E. W. Steeg, D. Robinson and E. Willis, “Coincidence Detection: A Fast Method for Discovering Higher-Order Correlations in Multidimensional Data”, Proceedings of the 4th International Conference on Knowledge Discovery and Data Mining, New York, 1998, pp. 112–120.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Swift, S., Tucker, A., Liu, X. (1999). Evolutionary Computation to Search for Strongly Correlated Variables in High-Dimensional Time-Series. In: Hand, D.J., Kok, J.N., Berthold, M.R. (eds) Advances in Intelligent Data Analysis. IDA 1999. Lecture Notes in Computer Science, vol 1642. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48412-4_5
Download citation
DOI: https://doi.org/10.1007/3-540-48412-4_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66332-4
Online ISBN: 978-3-540-48412-7
eBook Packages: Springer Book Archive