Abstract

Extreme learning machines (ELM) were created to simplify the training phase of single-layer feedforward neural networks, where the input weights are randomly set and the only parameter is the number of neurons in the hidden layer. These networks are also known for one-shot training using Moore–Penrose pseudo-inverse. In this work, we propose Gauss–Seidel extreme learning machine (GS-ELM), an ELM based on Gauss–Seidel iterative method to solve linear equation systems. We performed tests considering databases with different characteristics and analysed its discrimination capabilities and memory consumption in comparison to the canonical ELM and the online sequential ELM. GS-ELM presented similar discrimination capabilities, but consuming significantly less memory, turning possible its application in low-memory systems and embedded solutions.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.