Please use this identifier to cite or link to this item: https://hdl.handle.net/11147/2019
Full metadata record
DC FieldValueLanguage
dc.contributor.authorGezgin, Erkin-
dc.contributor.authorSevil, Hakkı Erhan-
dc.contributor.authorÖzdemir, Serhan-
dc.date.accessioned2016-08-01T07:54:59Z
dc.date.available2016-08-01T07:54:59Z
dc.date.issued2005
dc.identifier.citationGezgin, E., Sevil, H. E., and Özdemir, S. (2005). The effects of bias, population migration and credit assignment in optimizing trait-based heterogeneous populations. In H. R. Arabnia, & R. Joshua (Eds.), Proceedings of the 2005 International Conference on Artificial Intelligence, ICAI 05. Paper presented at 2005 International Conference on Artificial Intelligence, ICAI 05 (USA), Las Vegas, 27 - 30 June (pp. 747-753). Las Vegas, Nevada : CSREA Press.en_US
dc.identifier.isbn9781932415667
dc.identifier.urihttp://hdl.handle.net/11147/2019
dc.description.abstractPopulation based search algorithms are becoming the mainstay in nonlinear problems with discontinuous search domains. The generic name of genetic algorithms (GAs) basicly applies to all population based methods. GAs have spawned many versions to suit new applications. Some of these alterations have reached such points that the algorithms may no longer be called GAs. One similar study may be found in [1], in which a perturbation based search algorithm was proposed, called Responsive Perturbation Algorithm (RPA). In a later work [2], instead of a population of homogenous individuals, as is the case for generic GAs, a population of heterogeneous individuals has been set to compete. Replacing the set of winner parents, the fittest individual is made the parent to yield offspring. The current work is now called, with the supplements, trait-based heterogeneous populations plus (TbHP+). Credit assignment and bias concepts in the form of immunity and instinct has been added to provide the populations with a more efficient guidance. Simulations were made through an RBF neural network training, as it was carried out in earlier works, mentioned above, for comparison. Results were prsented at the end as network testing errors which showed further improvement with TbHP+.en_US
dc.language.isoenen_US
dc.publisherCSREA Pressen_US
dc.relation.ispartof2nd Indian International Conference on Artificial Intelligence, IICAI 2005en_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectBiasen_US
dc.subjectCredit assignmenten_US
dc.subjectImmunityen_US
dc.subjectInstincten_US
dc.subjectPopulation migrationen_US
dc.subjectNeural networksen_US
dc.titleThe effects of bias, population migration and credit assignment in optimizing trait-based heterogeneous populationsen_US
dc.typeConference Objecten_US
dc.authoridTR130615en_US
dc.authoridTR130950en_US
dc.institutionauthorÖzdemir, Serhan-
dc.departmentİzmir Institute of Technology. Mechanical Engineeringen_US
dc.identifier.volume2en_US
dc.identifier.startpage747en_US
dc.identifier.endpage753en_US
dc.identifier.wosWOS:000236070700111en_US
dc.identifier.scopus2-s2.0-60749136012en_US
dc.relation.publicationcategoryKonferans Öğesi - Uluslararası - Kurum Öğretim Elemanıen_US
dc.identifier.wosqualityN/A-
dc.identifier.scopusqualityN/A-
item.fulltextWith Fulltext-
item.grantfulltextopen-
item.languageiso639-1en-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.cerifentitytypePublications-
item.openairetypeConference Object-
crisitem.author.dept03.10. Department of Mechanical Engineering-
Appears in Collections:Mechanical Engineering / Makina Mühendisliği
Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection
WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection
Files in This Item:
File Description SizeFormat 
2019.pdfConference Paper731.64 kBAdobe PDFThumbnail
View/Open
Show simple item record



CORE Recommender

SCOPUSTM   
Citations

1
checked on Nov 15, 2024

Page view(s)

264
checked on Nov 18, 2024

Download(s)

68
checked on Nov 18, 2024

Google ScholarTM

Check




Altmetric


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