Identifiability of overcomplete independent component analysis
From MaRDI portal
Cites work
- A history of Greek mathematics. Vol. 1: From Thales to Euclid. Vol. 2: From Aristarchus to Diophantus.
- A linear non-Gaussian acyclic model for causal discovery
- An efficient method for finding the minimum of a function of several variables without calculating derivatives
- Analyse générale des liaisons stochastiques: etude particulière de l'analyse factorielle linéaire
- Enumerative algebraic geometry of conics
- Fourth-Order Cumulant-Based Blind Identification of Underdetermined Mixtures
- scientific article; zbMATH DE number 3180575 (Why is no real title available?)
- scientific article; zbMATH DE number 52497 (Why is no real title available?)
- scientific article; zbMATH DE number 773851 (Why is no real title available?)
- scientific article; zbMATH DE number 3426633 (Why is no real title available?)
- scientific article; zbMATH DE number 3085449 (Why is no real title available?)
- Independent component analysis, a new concept?
- On generic identifiability of symmetric tensors of subgeneric rank
- Pencils of quadrics: old and new
- Quantifying identifiability in independent component analysis
- Solving polynomial systems via homotopy continuation and monodromy
- Tensor methods in statistics
- The complexity of the word problems for commutative semigroups and polynomial ideals
- The Universe of Quadrics
- Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics
- Weakly defective varieties
This page was built for publication: Identifiability of overcomplete independent component analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7254286)
