泰国共同基金收费数据集的聚类技术比较

Jakkaphan Whasphuttisit, Watchareewan Jitsakul, T. Kaewkiriya
{"title":"泰国共同基金收费数据集的聚类技术比较","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":"{\"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}","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

摘要

目前已有关于聚类技术的研究,如K-Means、K-Medoids、X-Means等。他们的工作主要集中在将一种技术应用于多个数据集上,以找出每种算法的优缺点。在本文中,我们将重点研究和比较这三种聚类技术。在泰国共有2595只基金的费用数据集上应用了这两种技术进行了实验。从我们的实验中,我们发现最优K值为22。K-Means使用最少的处理时间,而k - medium使用最多的处理时间。K-Means的每个质心之间的平均距离也最小,而K-Medoids的平均距离最大。从Davies-Bouldin指数来看,X-Means的值最低,K-Medoids的值最高。K-Means和X-Means的密度最大的聚类是聚类0,而K-Medoids的密度最大的聚类是聚类1。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Comparison of Clustering Techniques for Thai Mutual Funds Fee Dataset
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Unsupervised and Ensemble-based Anomaly Detection Method for Network Security Unsupervised concept identification from a large corpus of research documents GSAP: A Hybrid GRU and Self-Attention Based Model for Dual Medical NLP Tasks Beyond fear go viral: A machine learning study on infodemic detection during covid-19 pandemic Blockchain for Transport (BC4 T), Performance Simulations of Blockchain Network for Emission Monitoring
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1