Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

One-Bit-Matching Conjecture for Independent Component Analysis

From MaRDI portal
Publication:4819830
Jump to:navigation, search

DOI10.1162/089976604322742074zbMath1097.68596OpenAlexW2149819603WikidataQ51704510 ScholiaQ51704510MaRDI QIDQ4819830

Lei Xu, Kai-Chun Chiu, Zhi-yong Liu

Publication date: 5 October 2004

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

Full work available at URL: https://doi.org/10.1162/089976604322742074


zbMATH Keywords

kurtosisskewness


Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)


Related Items

Applications for affine invariant descriptor and affine parameter estimation based on two-source ICA ⋮ Investigation on the skewness for 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 ⋮ Fast nonlinear autocorrelation algorithm for source separation



Cites Work

  • Learned parametric mixture based ICA algorithm
  • Independent component analysis, a new concept?
  • A Constrained EM Algorithm for Independent Component Analysis
  • HIGH-ORDER CONTRASTS FOR SELF-ADAPTIVE SOURCE SEPARATION
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4819830&oldid=19141484"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 8 February 2024, at 02:41.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki