title: Twinned principal curves.
abstract: Principal Curves are extensions of Principal Component Analysis and are smooth curves, which pass through the middle of a data set. We extend the method so that, on pairs of data sets which have underlying non-linear correlations, we have pairs of curves which go through the 'centre' of data sets in such a way that the non-linear correlations between the data sets are captured. The core of the method is to iteratively average the current local projections of the data points which produces an increasingly sparsified set of nodes. The Twinned Principal Curves are generated in three ways: by joining up the nodes in order, by performing Local Canonical Correlation Analysis and by performing Local Exploratory Correlation Analysis (Koetsier et al., 2002). The latter two are shown to improve the forecasting capability of the method but at an increased computational load. We show that it is crucial to terminate the algorithm after a small number of iterations for the first method and investigate several criteria for doing so.
authors.affiliation: Applied Computational Intelligence Research Unit, The University of Paisley, Paisley, Scotland, UK. jos.koetsier@paisley.ac.uk
authors.forename: Jos
authors.initials: J
authors.lastname: Koetsier
authors.forename: Ying
authors.initials: Y
authors.lastname: Han
authors.forename: Colin
authors.initials: C
authors.lastname: Fyfe
mesh_terms: D000465:Algorithms; D001330:Electronic Data Processing; D006801:Humans; D016013:Likelihood Functions; D016571:Neural Networks, Computer; D025341:Principal Component Analysis; D012815:Signal Processing, Computer-Assisted