Please use this identifier to cite or link to this item: http://hdl.handle.net/20.500.11861/7635
DC FieldValueLanguage
dc.contributor.authorCheang, Sin Manen_US
dc.contributor.authorLee, Kin Hongen_US
dc.contributor.authorProf. LEUNG Kwong Saken_US
dc.date.accessioned2023-03-28T04:49:28Z-
dc.date.available2023-03-28T04:49:28Z-
dc.date.issued2003-
dc.identifier.citation2003 Congress on Evolutionary Computation, CEC 2003 - Proceedings, 2003, Vol. 1, pp. 248 - 255en_US
dc.identifier.urihttp://hdl.handle.net/20.500.11861/7635-
dc.description.abstractA novel linear genetic programming (LGP) paradigm called genetic parallel programming (GPP) has been proposed to evolve parallel programs based on a multi-ALU processor. It is found that GPP can evolve parallel programs for data classification problems. In this paper, five binary-class UCI machine learning repository databases are used to test the effectiveness of the proposed GPP-classifier. The main advantages of employing GPP for data classification are: 1) speeding up evolutionary process by parallel hardware fitness evaluation; and 2) discovering parallel algorithms automatically. Experimental results show that the GPP-classifier evolves simple classification programs with good generalization performance. The accuracies of these evolved classifiers are comparable to other existing classification algorithms. © 2003 IEEE.en_US
dc.language.isoenen_US
dc.publisherIEEE Computer Societyen_US
dc.relation.ispartof2003 Congress on Evolutionary Computation, CEC 2003 - Proceedingsen_US
dc.titleEvolving data classification programs using genetic parallel programmingen_US
dc.typeConference Proceedingsen_US
dc.identifier.doi10.1109/CEC.2003.1299582-
item.fulltextNo Fulltext-
crisitem.author.deptDepartment of Applied Data Science-
Appears in Collections:Publication
Show simple item record

SCOPUSTM   
Citations

7
checked on Jan 3, 2024

Page view(s)

16
checked on Jan 3, 2024

Google ScholarTM

Impact Indices

Altmetric

PlumX

Metrics


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