On predicting the optimal number of hidden nodes

Alan Thomas, Miltiadis Petridis, Simon Walters, Mohammad Malekshahi Gheytassi, Robert Morgan

Research output: Chapter in Book/Conference proceeding with ISSN or ISBNConference contribution with ISSN or ISBNResearchpeer-review

Abstract

Abstract- Determining the optimal number of hidden nodes isthe most challenging aspect of Artificial Neural Network(ANN) design. To date, there are still no reliable methods ofdetermining this a priori, as it depends on so many domainspecificfactors. Current methods which take these intoaccount, such as exhaustive search, growing and pruning andevolutionary algorithms are not only inexact, but alsoextremely time consuming - in some cases prohibitively so. Anovel approach embodied in a system called Heurix isintroduced. This rapidly predicts the optimal number ofhidden nodes from a small number of sample topologies. It canbe configured to favour speed (low complexity), accuracy, or abalance between the two. Single hidden layer feedforwardnetworks (SLFNs) can be built twenty times faster, and with ageneralisation error of as little as 0.4% greater than thosefound by exhaustive search.
Original languageEnglish
Title of host publication2015 international conference on computational science and computational intelligence
Place of PublicationLas Vegas
PublisherCPS/IEEE
Pages565-570
Number of pages6
ISBN (Print)9781467397957
DOIs
Publication statusPublished - 8 Dec 2015
Event2015 international conference on computational science and computational intelligence - Las Vegas, 7-9 December 2015
Duration: 8 Dec 2015 → …

Conference

Conference2015 international conference on computational science and computational intelligence
Period8/12/15 → …

Fingerprint

Topology
Neural networks

Cite this

Thomas, A., Petridis, M., Walters, S., Malekshahi Gheytassi, M., & Morgan, R. (2015). On predicting the optimal number of hidden nodes. In 2015 international conference on computational science and computational intelligence (pp. 565-570). Las Vegas: CPS/IEEE. https://doi.org/10.1109/CSCI.2015.33
Thomas, Alan ; Petridis, Miltiadis ; Walters, Simon ; Malekshahi Gheytassi, Mohammad ; Morgan, Robert. / On predicting the optimal number of hidden nodes. 2015 international conference on computational science and computational intelligence. Las Vegas : CPS/IEEE, 2015. pp. 565-570
@inproceedings{1320a0efc1274be693bf6eb61e5fb960,
title = "On predicting the optimal number of hidden nodes",
abstract = "Abstract- Determining the optimal number of hidden nodes isthe most challenging aspect of Artificial Neural Network(ANN) design. To date, there are still no reliable methods ofdetermining this a priori, as it depends on so many domainspecificfactors. Current methods which take these intoaccount, such as exhaustive search, growing and pruning andevolutionary algorithms are not only inexact, but alsoextremely time consuming - in some cases prohibitively so. Anovel approach embodied in a system called Heurix isintroduced. This rapidly predicts the optimal number ofhidden nodes from a small number of sample topologies. It canbe configured to favour speed (low complexity), accuracy, or abalance between the two. Single hidden layer feedforwardnetworks (SLFNs) can be built twenty times faster, and with ageneralisation error of as little as 0.4{\%} greater than thosefound by exhaustive search.",
author = "Alan Thomas and Miltiadis Petridis and Simon Walters and {Malekshahi Gheytassi}, Mohammad and Robert Morgan",
year = "2015",
month = "12",
day = "8",
doi = "10.1109/CSCI.2015.33",
language = "English",
isbn = "9781467397957",
pages = "565--570",
booktitle = "2015 international conference on computational science and computational intelligence",
publisher = "CPS/IEEE",

}

Thomas, A, Petridis, M, Walters, S, Malekshahi Gheytassi, M & Morgan, R 2015, On predicting the optimal number of hidden nodes. in 2015 international conference on computational science and computational intelligence. CPS/IEEE, Las Vegas, pp. 565-570, 2015 international conference on computational science and computational intelligence, 8/12/15. https://doi.org/10.1109/CSCI.2015.33

On predicting the optimal number of hidden nodes. / Thomas, Alan; Petridis, Miltiadis; Walters, Simon; Malekshahi Gheytassi, Mohammad; Morgan, Robert.

2015 international conference on computational science and computational intelligence. Las Vegas : CPS/IEEE, 2015. p. 565-570.

Research output: Chapter in Book/Conference proceeding with ISSN or ISBNConference contribution with ISSN or ISBNResearchpeer-review

TY - GEN

T1 - On predicting the optimal number of hidden nodes

AU - Thomas, Alan

AU - Petridis, Miltiadis

AU - Walters, Simon

AU - Malekshahi Gheytassi, Mohammad

AU - Morgan, Robert

PY - 2015/12/8

Y1 - 2015/12/8

N2 - Abstract- Determining the optimal number of hidden nodes isthe most challenging aspect of Artificial Neural Network(ANN) design. To date, there are still no reliable methods ofdetermining this a priori, as it depends on so many domainspecificfactors. Current methods which take these intoaccount, such as exhaustive search, growing and pruning andevolutionary algorithms are not only inexact, but alsoextremely time consuming - in some cases prohibitively so. Anovel approach embodied in a system called Heurix isintroduced. This rapidly predicts the optimal number ofhidden nodes from a small number of sample topologies. It canbe configured to favour speed (low complexity), accuracy, or abalance between the two. Single hidden layer feedforwardnetworks (SLFNs) can be built twenty times faster, and with ageneralisation error of as little as 0.4% greater than thosefound by exhaustive search.

AB - Abstract- Determining the optimal number of hidden nodes isthe most challenging aspect of Artificial Neural Network(ANN) design. To date, there are still no reliable methods ofdetermining this a priori, as it depends on so many domainspecificfactors. Current methods which take these intoaccount, such as exhaustive search, growing and pruning andevolutionary algorithms are not only inexact, but alsoextremely time consuming - in some cases prohibitively so. Anovel approach embodied in a system called Heurix isintroduced. This rapidly predicts the optimal number ofhidden nodes from a small number of sample topologies. It canbe configured to favour speed (low complexity), accuracy, or abalance between the two. Single hidden layer feedforwardnetworks (SLFNs) can be built twenty times faster, and with ageneralisation error of as little as 0.4% greater than thosefound by exhaustive search.

U2 - 10.1109/CSCI.2015.33

DO - 10.1109/CSCI.2015.33

M3 - Conference contribution with ISSN or ISBN

SN - 9781467397957

SP - 565

EP - 570

BT - 2015 international conference on computational science and computational intelligence

PB - CPS/IEEE

CY - Las Vegas

ER -

Thomas A, Petridis M, Walters S, Malekshahi Gheytassi M, Morgan R. On predicting the optimal number of hidden nodes. In 2015 international conference on computational science and computational intelligence. Las Vegas: CPS/IEEE. 2015. p. 565-570 https://doi.org/10.1109/CSCI.2015.33