Canonical Correlation Analysis [3] is used when we have two data sets which we believe have some underlying correlation. In this paper, we derive a new family of neural methods for finding the canonical correlation directions by solving a generalized eigenvalue problem. Based on the differential equation for the generalized eigenvalue problem, a family of CCA learning algorithms can be obtained. We compare our family of methods with a previously derived [2] CCA learning algorithm. Our results show that all the new learning algorithms of this family have the same order of convergence speed and in particular are much faster than existing algorithms; they are also shown to be able to find greater nonlinear correlations. They are also much more robust with respect to parameter selection.
CITATION STYLE
Gou, Z., & Fyfe, C. (2000). Generalised Canonical correlation analysis. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1983, pp. 164–173). Springer Verlag. https://doi.org/10.1007/3-540-44491-2_25
Mendeley helps you to discover research relevant for your work.