期刊
MACHINE LEARNING
卷 74, 期 1, 页码 23-38出版社
SPRINGER
DOI: 10.1007/s10994-008-5085-3
关键词
Canonical Correlation Analysis; Rademacher complexity; Kernel methods
资金
- EU [IST-2001-34405]
- PASCAL [IST-2002-506778]
- EPSRC [EP/D063612/1] Funding Source: UKRI
- Engineering and Physical Sciences Research Council [EP/D063612/1] Funding Source: researchfish
Canonical Correlation Analysis is a technique for finding pairs of basis vectors that maximise the correlation of a set of paired variables, these pairs can be considered as two views of the same object. This paper provides a convergence analysis of Canonical Correlation Analysis by defining a pattern function that captures the degree to which the features from the two views are similar. We analyse the convergence using Rademacher complexity, hence deriving the error bound for new data. The analysis provides further justification for the regularisation of kernel Canonical Correlation Analysis and is corroborated by experiments on real world data.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据