Please use this identifier to cite or link to this item:
https://ah.lib.nccu.edu.tw/handle/140.119/46714
DC Field | Value | Language |
---|---|---|
dc.creator | 蔡瑞煌 | zh_TW |
dc.creator | Tsaih,Rua-Huan;Wan,Yat-wah | - |
dc.date | 2010-01 | en_US |
dc.date.accessioned | 2010-10-06T03:40:01Z | - |
dc.date.available | 2010-10-06T03:40:01Z | - |
dc.date.issued | 2010-10-06T03:40:01Z | - |
dc.identifier.uri | http://nccur.lib.nccu.edu.tw/handle/140.119/46714 | - |
dc.description.abstract | This study proposes and validates a construction concept for the realization of a real-valued single-hidden layer feed-forward neural network (SLFN) with continuous-valued hidden nodes for arbitrary mapping problems. The proposed construction concept says that for a specific application problem, the upper bound on the number of used hidden nodes depends on the characteristic of adopted SLFN and the observed properties of collected data samples. A positive validation result is obtained from the experiment of applying the construction concept to the m-bit parity problem learned by constructing two types of SLFN network solutions. | - |
dc.language.iso | en_US | - |
dc.relation | 19th International Conference on Artificial Neural Networks (ICANN2009) | en_US |
dc.relation | Lecture Notes in Computer Science,5768,658-667 | - |
dc.subject | Bound; hidden nodes; single-hidden layer feed-forward neural network; preimage; parity problem | - |
dc.title | A Guide for the Upper Bound on the Number of Continuous-Valued Hidden Nodes of a Feed-Forward Network | en_US |
dc.type | article | en |
dc.identifier.doi | 10.1007/978-3-642-04274-4_68 | en_US |
dc.doi.uri | http://dx.doi.org/10.1007/978-3-642-04274-4_68 | en_US |
item.fulltext | With Fulltext | - |
item.cerifentitytype | Publications | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.grantfulltext | open | - |
item.openairetype | article | - |
item.languageiso639-1 | en_US | - |
Appears in Collections: | 期刊論文 |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
658-667.pdf | 203.53 kB | Adobe PDF2 | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.