English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
  Semi-Supervised Laplacian Regularization of Kernel Canonical Correlation Analysis

Blaschko, M., Lampert, C., & Gretton, A. (2008). Semi-Supervised Laplacian Regularization of Kernel Canonical Correlation Analysis. In W. Daelemans, B. Goethals, & K. Morik (Eds.), Machine Learning and Knowledge Discovery in Databases: European Conference, ECML PKDD 2008, Antwerp, Belgium, September 15-19, 2008 (pp. 133-145). Berlin, Germany: Springer.

Item is

Files

show Files

Locators

show
hide
Description:
-
OA-Status:

Creators

show
hide
 Creators:
Blaschko, MB1, 2, Author           
Lampert, CH1, 2, Author           
Gretton, A1, 2, Author           
Affiliations:
1Department Empirical Inference, Max Planck Institute for Biological Cybernetics, Max Planck Society, ou_1497795              
2Max Planck Institute for Biological Cybernetics, Max Planck Society, Spemannstrasse 38, 72076 Tübingen, DE, ou_1497794              

Content

show
hide
Free keywords: -
 Abstract: Kernel canonical correlation analysis (KCCA) is a dimensionality reduction technique for paired data. By finding directions that
maximize correlation, KCCA learns representations that are more closely
tied to the underlying semantics of the data rather than noise. However,
meaningful directions are not only those that have high correlation to another
modality, but also those that capture the manifold structure of the
data. We propose a method that is simultaneously able to find highly
correlated directions that are also located on high variance directions
along the data manifold. This is achieved by the use of semi-supervised
Laplacian regularization of KCCA. We show experimentally that Laplacian
regularized training improves class separation over KCCA with only
Tikhonov regularization, while causing no degradation in the correlation
between modalities. We propose a model selection criterion based on
the Hilbert-Schmidt norm of the semi-supervised Laplacian regularized
cross-covariance operator, which we compute in closed form.

Details

show
hide
Language(s):
 Dates: 2008-09
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: DOI: 10.1007/978-3-540-87479-9_27
BibTex Citekey: 5248
 Degree: -

Event

show
hide
Title: 19th European Conference on Machine Learning (ECML PKDD 2008)
Place of Event: Antwerpen, Belgium
Start-/End Date: 2008-09-15 - 2008-09-19

Legal Case

show

Project information

show

Source 1

show
hide
Title: Machine Learning and Knowledge Discovery in Databases: European Conference, ECML PKDD 2008, Antwerp, Belgium, September 15-19, 2008
Source Genre: Proceedings
 Creator(s):
Daelemans, W, Editor
Goethals, B, Editor
Morik, K, Editor
Affiliations:
-
Publ. Info: Berlin, Germany : Springer
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 133 - 145 Identifier: ISBN: 978-3-540-87478-2

Source 2

show
hide
Title: Lecture Notes in Computer Science
Source Genre: Series
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 5211 Sequence Number: - Start / End Page: - Identifier: -