Convergence analysis of a simple minor component analysis algorithm
From MaRDI portal
Publication:2383048
DOI10.1016/J.NEUNET.2007.07.001zbMATH Open1124.68095OpenAlexW2005821522WikidataQ50921081 ScholiaQ50921081MaRDI QIDQ2383048FDOQ2383048
Dezhong Peng, Wenjing Luo, Zhang Yi
Publication date: 5 October 2007
Published in: Neural Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.neunet.2007.07.001
Recommendations
- Convergence analysis of the OJAn MCA learning algorithm by the deterministic discrete time method
- Global convergence of an adaptive minor component extraction algorithm
- On the discrete time dynamics of a self-stabilizing MCA learning algorithm
- A stable MCA learning algorithm
- Advances in Neural Networks – ISNN 2005
Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10) Nonnumerical algorithms (68W05)
Cites Work
Cited In (10)
- Convergence of a Hebbian-type learning algorithm
- Optimal Curiosity-Driven Modular Incremental Slow Feature Analysis
- Incremental slow feature analysis: adaptive low-complexity slow feature updating from high-dimensional input streams
- Convergence of algorithms used for principal component analysis
- Global convergence of an adaptive minor component extraction algorithm
- Advances in Neural Networks – ISNN 2005
- A novel approach to the convergence of neural networks for signal processing
- Convergence analysis of the OJAn MCA learning algorithm by the deterministic discrete time method
- Title not available (Why is that?)
- Continual curiosity-driven skill acquisition from high-dimensional video inputs for humanoid robots
This page was built for publication: Convergence analysis of a simple minor component analysis algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2383048)
