Evolutionary computation to search for strongly correlated variables in high-dimensional time-series

7Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Swift, S., Tucker, A., & Liu, X. (1999). Evolutionary computation to search for strongly correlated variables in high-dimensional time-series. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1642, pp. 51–62). Springer Verlag. https://doi.org/10.1007/3-540-48412-4_5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free