Anderson King Junior, Suharjito, Novan Zulkarnain, Devriady Pratama, Eric Gunawan, Ditdit Nugeraha Utama
{"title":"交叉和选择方法对genclus++算法性能的影响分析","authors":"Anderson King Junior, Suharjito, Novan Zulkarnain, Devriady Pratama, Eric Gunawan, Ditdit Nugeraha Utama","doi":"10.1109/ICISS48059.2019.8969832","DOIUrl":null,"url":null,"abstract":"In the K-Means algorithm, the determination of the center point coordinates (centroid) directly affects the quality of the clustering process. Determination of the coordinates of the center point (centroid) is generally done by generating random numbers and each instance will then be placed based on proximity to random numbers generated. Determining a good centroid will prevent the occurrence of local optima problems in K-Means. The GenClust++ algorithm is a pretty good algorithm in determining centroid. However, what needs to be considered is the influence of the selection and crossover process on the performance of clustering. This study will discuss the combination of selection and crossover processes that are good in the process of determining the centroid. Performance measurement method will be based on the measurement of Mean Square Error and distance calculation using Euclidean Distance. The results show that the Roulette Wheel Selection and Whole Arithmetic Crossover selection processes will give the best performance for the GenClust++ Algorithm.","PeriodicalId":125643,"journal":{"name":"2019 International Conference on ICT for Smart Society (ICISS)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"The Effect Analysis of Crossover and Selection Methods on the Performance of GenClust++ Algorithm\",\"authors\":\"Anderson King Junior, Suharjito, Novan Zulkarnain, Devriady Pratama, Eric Gunawan, Ditdit Nugeraha Utama\",\"doi\":\"10.1109/ICISS48059.2019.8969832\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In the K-Means algorithm, the determination of the center point coordinates (centroid) directly affects the quality of the clustering process. Determination of the coordinates of the center point (centroid) is generally done by generating random numbers and each instance will then be placed based on proximity to random numbers generated. Determining a good centroid will prevent the occurrence of local optima problems in K-Means. The GenClust++ algorithm is a pretty good algorithm in determining centroid. However, what needs to be considered is the influence of the selection and crossover process on the performance of clustering. This study will discuss the combination of selection and crossover processes that are good in the process of determining the centroid. Performance measurement method will be based on the measurement of Mean Square Error and distance calculation using Euclidean Distance. The results show that the Roulette Wheel Selection and Whole Arithmetic Crossover selection processes will give the best performance for the GenClust++ Algorithm.\",\"PeriodicalId\":125643,\"journal\":{\"name\":\"2019 International Conference on ICT for Smart Society (ICISS)\",\"volume\":\"15 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 International Conference on ICT for Smart Society (ICISS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICISS48059.2019.8969832\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 International Conference on ICT for Smart Society (ICISS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICISS48059.2019.8969832","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The Effect Analysis of Crossover and Selection Methods on the Performance of GenClust++ Algorithm
In the K-Means algorithm, the determination of the center point coordinates (centroid) directly affects the quality of the clustering process. Determination of the coordinates of the center point (centroid) is generally done by generating random numbers and each instance will then be placed based on proximity to random numbers generated. Determining a good centroid will prevent the occurrence of local optima problems in K-Means. The GenClust++ algorithm is a pretty good algorithm in determining centroid. However, what needs to be considered is the influence of the selection and crossover process on the performance of clustering. This study will discuss the combination of selection and crossover processes that are good in the process of determining the centroid. Performance measurement method will be based on the measurement of Mean Square Error and distance calculation using Euclidean Distance. The results show that the Roulette Wheel Selection and Whole Arithmetic Crossover selection processes will give the best performance for the GenClust++ Algorithm.