A fast neural network learning algorithm with approximate singular value decomposition

DOI10.2478/AMCS-2019-0043zbMATH Open1430.68277OpenAlexW2979104771WikidataQ127183864 ScholiaQ127183864MaRDI QIDQ2299166FDOQ2299166

Norbert Jankowski, Rafał Linowiecki

Publication date: 20 February 2020

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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
• Title not available (Why is that?)
• Title not available (Why is that?)
• Linear discriminant analysis with a generalization of the Moore-Penrose pseudoinverse
• Comparison of prototype selection algorithms used in construction of neural networks learned by SVD

Cited In (2)

• An ANN-based scalable hashing algorithm for computational clouds with schedulers
• FAST NON-NEGATIVE LEAST-SQUARES LEARNING IN THE RANDOM NEURAL NETWORK

Uses Software

• UCI-ml

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)