Kernel feature spaces and nonlinear blind source separation

Stefan Harmeling, Andreas Ziehe, Motoaki Kawanabe, Klaus Robert Müller

Research output: Chapter in Book/Report/Conference proceedingConference contribution

21 Citations (Scopus)

Abstract

In kernel based learning the data is mapped to a kernel feature space of a dimension that corresponds to the number of training data points. In practice, however, the data forms a smaller submanifold in feature space, a fact that has been used e.g. by reduced set techniques for SVMs. We propose a new mathematical construction that permits to adapt to the intrinsic dimension and to find an orthonormal basis of this submanifold. In doing so, computations get much simpler and more important our theoretical framework allows to derive elegant kernelized blind source separation (BSS) algorithms for arbitrary invertible nonlinear mixings. Experiments demonstrate the good performance and high computational efficiency of our kTDSEP algorithm for the problem of nonlinear BSS.

Original languageEnglish
Title of host publicationAdvances in Neural Information Processing Systems 14 - Proceedings of the 2001 Conference, NIPS 2001
PublisherNeural information processing systems foundation
ISBN (Print)0262042088, 9780262042086
Publication statusPublished - 2002
Externally publishedYes
Event15th Annual Neural Information Processing Systems Conference, NIPS 2001 - Vancouver, BC, Canada
Duration: 2001 Dec 32001 Dec 8

Publication series

NameAdvances in Neural Information Processing Systems
ISSN (Print)1049-5258

Other

Other15th Annual Neural Information Processing Systems Conference, NIPS 2001
Country/TerritoryCanada
CityVancouver, BC
Period01/12/301/12/8

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Information Systems
  • Signal Processing

Fingerprint

Dive into the research topics of 'Kernel feature spaces and nonlinear blind source separation'. Together they form a unique fingerprint.

Cite this