Theoretical method for solving BSS-ICA using SVM

1Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this work we propose a new method for solving the blind source separation (BSS) problem using a support vector machine (SVM) workbench. Thus, we provide an introduction to SVM-ICA, a theoretical approach to unsupervised learning based on learning machines, which has frequently been proposed for classification and regression tasks. The key idea is to construct a Lagrange function from both the objective function and the corresponding constraints, by introducing a dual set of variables and solving the optimization problem. For this purpose we define a specific cost function and its derivative in terms of independence, i.e. inner products between the output and the objective function, transforming an unsupervised learning problem into a supervised learning machine task where optimization theory can be applied to develop effective algorithms. © Springer-Verlag 2004.

Cite

CITATION STYLE

APA

Puntonet, C. G., Górriz, J. M., Salmerón, M., & Hornillo-Mellado, S. (2004). Theoretical method for solving BSS-ICA using SVM. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3195, 256–262. https://doi.org/10.1007/978-3-540-30110-3_33

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free