P. Mudjihartono, T. Tanprasert, Rachsuda Jiamthapthaksin
{"title":"Clustering analysis on alumni data using abandoned and Reborn Particle Swarm Optimization","authors":"P. Mudjihartono, T. Tanprasert, Rachsuda Jiamthapthaksin","doi":"10.1109/KST.2016.7440500","DOIUrl":null,"url":null,"abstract":"Alumni data is one of the most important data that university management uses for developing the learning process decisions. This paper applies the idea of Abandoned and Reborn PSO (AR-PSO) to convert a clustering problem into the optimization form with an objective function to minimize the ugliness of the desired clusters. This algorithm of Clustering using AR-PSO (CAR-PSO) is slightly adapted to the cluster problem domain. The generated clusters need to be examined to decide if they are acceptable. There are three evaluations; the closeness, the separation and the purity. Finally, the experiment results show that the CAR-PSO is comparable with &-means in both types of alumni data while leaving the other two clustering algorithms.","PeriodicalId":350687,"journal":{"name":"2016 8th International Conference on Knowledge and Smart Technology (KST)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 8th International Conference on Knowledge and Smart Technology (KST)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/KST.2016.7440500","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
Alumni data is one of the most important data that university management uses for developing the learning process decisions. This paper applies the idea of Abandoned and Reborn PSO (AR-PSO) to convert a clustering problem into the optimization form with an objective function to minimize the ugliness of the desired clusters. This algorithm of Clustering using AR-PSO (CAR-PSO) is slightly adapted to the cluster problem domain. The generated clusters need to be examined to decide if they are acceptable. There are three evaluations; the closeness, the separation and the purity. Finally, the experiment results show that the CAR-PSO is comparable with &-means in both types of alumni data while leaving the other two clustering algorithms.