Jakkaphan Whasphuttisit, Watchareewan Jitsakul, T. Kaewkiriya
{"title":"Comparison of Clustering Techniques for Thai Mutual Funds Fee Dataset","authors":"Jakkaphan Whasphuttisit, Watchareewan Jitsakul, T. Kaewkiriya","doi":"10.1109/KST53302.2022.9729076","DOIUrl":null,"url":null,"abstract":"There are researches that study about clustering techniques e.g., K-Means, K-Medoids, and X-Means. Their works mainly focus on applying one technique on multiple data sets to find the pros and cons of each algorithm. In this work, we focus on study and comparing these three clustering techniques instead. The experiment is done by applying each technique on Thai mutual funds fee data set which consists of 2,595 funds. From our experiment, we found that the optimal K value is 22. K-Means use the least processing time while K-Medoids use the most time. K-Means also has the least average distant between each centroid while K-Medoids has the most average distant. From Davies-Bouldin index, X-Means has the lowest value while K-Medoids has the highest value. The most density cluster of K-Means and X-Means is cluster 0 but it is cluster 1 for K-Medoids.","PeriodicalId":433638,"journal":{"name":"2022 14th International Conference on Knowledge and Smart Technology (KST)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-01-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 14th International Conference on Knowledge and Smart Technology (KST)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/KST53302.2022.9729076","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
There are researches that study about clustering techniques e.g., K-Means, K-Medoids, and X-Means. Their works mainly focus on applying one technique on multiple data sets to find the pros and cons of each algorithm. In this work, we focus on study and comparing these three clustering techniques instead. The experiment is done by applying each technique on Thai mutual funds fee data set which consists of 2,595 funds. From our experiment, we found that the optimal K value is 22. K-Means use the least processing time while K-Medoids use the most time. K-Means also has the least average distant between each centroid while K-Medoids has the most average distant. From Davies-Bouldin index, X-Means has the lowest value while K-Medoids has the highest value. The most density cluster of K-Means and X-Means is cluster 0 but it is cluster 1 for K-Medoids.