Please use this identifier to cite or link to this item: http://hdl.handle.net/20.500.11889/4220
DC FieldValueLanguage
dc.contributor.authorAbu Snaina, Ahmed-
dc.contributor.authorAbdullah, Rosni-
dc.date.accessioned2017-02-13T09:06:21Z-
dc.date.available2017-02-13T09:06:21Z-
dc.date.issued2013-
dc.identifier.urihttp://hdl.handle.net/20.500.11889/4220-
dc.description.abstractTraining an artificial neural network (ANN) is an optimization task since it is desired to find optimal neurons‘ weight of a neural network in an iterative training process. Traditional training algorithms have some drawbacks such as local minima and its slowness. Therefore, evolutionary algorithms are utilized to train neural networks to overcome these issues. This research tackles the ANN training by adapting Mussels Wandering Optimization (MWO) algorithm. The proposed method tested and verified by training an ANN with well-known benchmarking problems. Two criteria used to evaluate the proposed method were overall training time and classification accuracy. The obtained results indicate that MWO algorithm is on par or better in terms of classification accuracy and convergence training time.en_US
dc.language.isoen_USen_US
dc.subjectArtificial intelligenceen_US
dc.subjectNeural networks (Computer science)en_US
dc.titleMussels wandering optimization algorithm based training of artificial neural networks for pattern classificationen_US
dc.typeArticleen_US
newfileds.departmentEngineering and TechnologyEngineering and Technologyen_US
newfileds.item-access-typeopen_accessen_US
newfileds.thesis-prognoneen_US
newfileds.general-subjectnoneen_US
item.languageiso639-1other-
item.fulltextWith Fulltext-
item.grantfulltextopen-
Appears in Collections:Fulltext Publications
Files in This Item:
File Description SizeFormat
PID105.pdf727.55 kBAdobe PDFView/Open
Show simple item record

Page view(s)

147
Last Week
0
Last month
2
checked on Apr 14, 2024

Download(s)

46
checked on Apr 14, 2024

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.