Please use this identifier to cite or link to this item:
https://hdl.handle.net/2440/58979
Citations | ||
Scopus | Web of Science® | Altmetric |
---|---|---|
?
|
?
|
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Watts, Michael John | en |
dc.date.issued | 2009 | en |
dc.identifier.citation | IEEE Transactions on Systems, Man and Cybernetics Part C - Applications and Reviews, 2009: 39(3):253-269 | en |
dc.identifier.issn | 1558-2442 | en |
dc.identifier.uri | http://hdl.handle.net/2440/58979 | - |
dc.description.abstract | Evolving connectionist Systems (ECoS) are a family of constructive artificial neural network algorithms that were first proposed by Kasabov in 1998, where ‘evolving’ in this context means “changing over time”, rather than evolving through simulated evolution. A decade on, the number of ECoS algorithms, and the problems to which they have been applied, have multiplied. This paper reviews the current state-of-the-art in the field of ECoS networks via a substantial literature review. It reviews (1) the motivations for ECoS, (2) the major ECoS algorithms in use, (3) previously existing constructive algorithms that are similar to ECoS, (4) empirical evaluations of ECoS networks over benchmark data sets, (5 applications of ECoS to real-world problems. The paper ends with some suggestions of future directions of research into ECoS networks | en |
dc.publisher | Institute of Electrical and Electronics Engineers | en |
dc.rights | © 2009 IEEE | en |
dc.subject | Survey; Connectionism and neural nets; Knowledgeacquisition | en |
dc.title | A decade of Kasabov’s evolving connectionist systems: a review | en |
dc.type | Journal article | en |
dc.contributor.school | School of Earth and Environmental Sciences | en |
dc.identifier.doi | 10.1109/TSMCC.2008.2012254 | en |
dc.publisher.place | New York | en |
Appears in Collections: | Earth and Environmental Sciences publications Environment Institute publications |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.