A Constrained EM Algorithm for Independent Component Analysis

DOI10.1162/089976601300014510zbMath1085.68655DBLPjournals/neco/WellingW01OpenAlexW2050681499WikidataQ43489214 ScholiaQ43489214MaRDI QIDQ4814220

Markus Weber, Max Welling

Publication date: 7 September 2004

Published in: Neural Computation (Search for Journal in Brave)

Full work available at URL: https://authors.library.caltech.edu/27691/

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items (5)

One-Bit-Matching Conjecture for Independent Component Analysis ⋮ Investigation on the skewness for independent component analysis ⋮ A stochastic algorithm for probabilistic independent component analysis ⋮ A Further Result on the ICA One-Bit-Matching Conjecture ⋮ One-Bit-Matching Theorem for ICA, Convex-Concave Programming on Polyhedral Set, and Distribution Approximation for Combinatorics

Cites Work

• Blind separation of sources. I: An adaptive algorithm based on neuromimetic architecture
• Independent component analysis, a new concept?

This page was built for publication: A Constrained EM Algorithm for Independent Component Analysis