A fast neural network learning algorithm with approximate singular value decomposition

DOI10.2478/AMCS-2019-0043MaRDI QIDQ2299166zbMATH OpenOpenAlexWikidataFDO

Authors Norbert Jankowski, Rafał Linowiecki

Publication date 20 February 2020

Published in International Journal of Applied Mathematics and Computer Science (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.2478/amcs-2019-0043

zbMATH Keywords

machine learningprincipal component analysiskernel methodssingular value decompositionradial basis function networkextreme learning machinesdeep extreme learningMoore-Penrose pseudo-inverse learning

Mathematics Subject Classification ID

Factor analysis and principal components; correspondence analysis (62H25) Artificial neural networks and deep learning (68T07) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Theory of matrix inversion and generalized inverses (15A09)

Recommendations

• Evolutionary extreme learning machine
• Fast learning algorithms for neural networks
• scientific article; zbMATH DE number 1234082
• A fast neural network algorithm for principal singular triplet extraction
• scientific article; zbMATH DE number 1300102

Cites work

• scientific article; zbMATH DE number 4074523 (Why is no real title available?)
• scientific article; zbMATH DE number 3551792 (Why is no real title available?)
• scientific article; zbMATH DE number 1179314 (Why is no real title available?)
• scientific article; zbMATH DE number 823069 (Why is no real title available?)
• Comparison of prototype selection algorithms used in construction of neural networks learned by SVD
• Deep learning
• Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
• Linear discriminant analysis with a generalization of the Moore-Penrose pseudoinverse

Cited in

(3)

• An ANN-based scalable hashing algorithm for computational clouds with schedulers
• FAST NON-NEGATIVE LEAST-SQUARES LEARNING IN THE RANDOM NEURAL NETWORK
• Comparison of prototype selection algorithms used in construction of neural networks learned by SVD

Describes a project that uses

Uses Software

• UCI

This page was built for publication: A fast neural network learning algorithm with approximate singular value decomposition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2299166)