Multi-objective genetic algorithm for supervised clustering

dc.contributor.advisorSurapong Auwatanamongkol
dc.contributor.authorVipa Thananant
dc.date.accessioned2023-05-15T03:32:19Z
dc.date.available2023-05-15T03:32:19Z
dc.date.issued2018
dc.date.issuedBE2561th
dc.descriptionThesis (Ph.D. (Computer Science and Information Systems))--National Institute of Development Administration, 2018th
dc.description.abstractSupervised clustering organizes data instances into clusters on the basis of similarities between the data instances as well as class labels for the data instances. Supervised clustering seeks to meet multiple objectives, such as compactness of clusters, homogeneity of data in clusters with respect to their class labels, and separateness of clusters. With these objectives in mind, a new supervised clustering algorithm based on a multi-objective crowding genetic algorithm, named SC-MOGA, is proposed in this thesis. The algorithm searches for the optimal clustering solution that simultaneously achieves the three objectives mentioned above. The SC-MOGA performs very well on a small dataset, but for a large dataset it may not be able to converge to an optimal solution or can take a very long running time to converge to a solution. Hence, a data sampling method based on the Bisecting K-Means algorithm is also introduced, to find representatives for supervised clustering. This method groups the data instances of a dataset into small clusters, each containing data instances with the same class label. Data representatives are then randomly selected from each cluster. The experimental results show that SC-MOGA with the proposed data sampling method is very effective. It outperforms three previously proposed supervised clustering algorithms, namely SRIDHCR, LK-Means and SCEC, in terms of four cluster validity indexes. The experimental results show that the proposed data sampling method not only helps to reduce the number of data instances to be clustered by the SC-MOGA, but also enhances the quality of the data clustering results. Moreover, the biased initial approach is proposed in this thesis to find a good initial population to bias. The experimental results show that biased initial population of SCMOGA will improve clustering quality and the more percentage of biased initial population the better clustering quality.th
dc.format.extent121 leavesth
dc.format.mimetypeapplication/pdfth
dc.identifier.doi10.14457/NIDA.the.2018.129
dc.identifier.otherb207807th
dc.identifier.urihttps://repository.nida.ac.th/handle/662723737/6424
dc.language.isoength
dc.publisherNational Institute of Development Administrationth
dc.rightsผลงานนี้เผยแพร่ภายใต้ สัญญาอนุญาตครีเอทีฟคอมมอนส์แบบ แสดงที่มา-ไม่ใช้เพื่อการค้า-ไม่ดัดแปลง 4.0 (CC BY-NC-ND 4.0)th
dc.subjectgenetic algorithmth
dc.subject.otherComputer algorithmsth
dc.subject.otherGeneticth
dc.subject.otherMultiple criteria decision makingth
dc.subject.otherอัลกอริธึมth
dc.titleMulti-objective genetic algorithm for supervised clusteringth
dc.typetext--thesis--doctoral thesisth
mods.genreDissertationth
mods.physicalLocationNational Institute of Development Administration. Library and Information Centerth
thesis.degree.departmentGraduate School of Applied Statisticsth
thesis.degree.disciplineComputer Science and Information Systemsth
thesis.degree.grantorNational Institute of Development Administrationth
thesis.degree.levelDoctoralth
thesis.degree.nameDoctor of Philosophyth
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
b207807.pdf
Size:
4.61 MB
Format:
Adobe Portable Document Format
Description:
fulltext
License bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description: