Please use this identifier to cite or link to this item: https://ptsldigital.ukm.my/jspui/handle/123456789/394835
Full metadata record
DC FieldValueLanguage
dc.contributor.authorZainudin Zukhri-
dc.contributor.authorKhairuddin Omar-
dc.date.accessioned2023-06-15T07:50:58Z-
dc.date.available2023-06-15T07:50:58Z-
dc.identifier.otherukmvital:120978-
dc.identifier.urihttps://ptsldigital.ukm.my/jspui/handle/123456789/394835-
dc.description.abstractThis paper is presented to explain application of Genetic Algorithms (GA) to cluster new students into several classes. It is very essential since good educational service for a large number of student needs clustering of them. There is no clustering method can handle it due to the capacity of each class. The supervised clustering method can only cluster students where number of class is predefined, but it cannot handle the class capacities. The proposed approach is GA which succeeded in solving difficult optimization problems. Since clustering method can be solved by minimizing the distance between each object in the cluster with the corresponding cluster center, we proposed GA with cluster centre based chromosomal representation. We developed it as software and evaluated it with random data. The result showed that the class generated by GA consists of more similar students than the class generated by traditional sorting method.-
dc.language.isoeng-
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE),Piscataway, USA-
dc.subjectChromosomal representation-
dc.subjectGenetic algorithms-
dc.titleCentre based chromosomal representation of genetic algorithms to cluster new student-
dc.typeSeminar Papers-
dc.format.pages6-
dc.identifier.callnoT58.5.C634 2008 kat sem-
dc.contributor.conferencenameInternational Symposium on Information Technology-
dc.coverage.conferencelocationKuala Lumpur Convention Centre-
dc.date.conferencedate26/08/2008-
Appears in Collections:Seminar Papers/ Proceedings / Kertas Kerja Seminar/ Prosiding

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.