Finding Playing Styles of Badminton Players Using Firefly Algorithm Based Clustering Algorithms

IF 0.3 Q4 COMPUTER SCIENCE, THEORY & METHODS
Anuradha Ariyaratne, I M T P K Ilankoon, U Samarasinghe, R M Silva
{"title":"Finding Playing Styles of Badminton Players Using Firefly Algorithm Based Clustering Algorithms","authors":"Anuradha Ariyaratne, I M T P K Ilankoon, U Samarasinghe, R M Silva","doi":"10.7494/csci.2023.24.3.5116","DOIUrl":null,"url":null,"abstract":"Cluster analysis can be defined as applying clustering algorithms with the goal of finding hidden patterns or groupings in a dataset. Different clustering methods provide different solutions for the same dataset. Traditional clustering algorithms are popular, but handling big data sets is beyond the ability of such methods. We propose three big data clustering methods, based on the Firefly Algorithm (FA). Three different fitness functions were defined on FA using inter cluster distance, intra cluster distance, silhouette value and Calinski-Harabasz Index. The algorithms find the most appropriate cluster centers for a given data set. The algorithms were tested with four popular synthetic data sets and later applied on two badminton data sets to identify different playing styles of players based on physical characteristics. The results specify that the firefly algorithm could generate better clustering results with high accuracy. The algorithms cluster the players to find the most suitable playing strategy for a given player where expert knowledge is needed in labeling the clusters. Comparisons with a PSO based clustering algorithm (APSO) and traditional algorithms point out that the proposed firefly variants work similarly as the APSO method and surpass the performance of traditional algorithms.","PeriodicalId":41917,"journal":{"name":"Computer Science-AGH","volume":"30 1","pages":"0"},"PeriodicalIF":0.3000,"publicationDate":"2023-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Science-AGH","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.7494/csci.2023.24.3.5116","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

Abstract

Cluster analysis can be defined as applying clustering algorithms with the goal of finding hidden patterns or groupings in a dataset. Different clustering methods provide different solutions for the same dataset. Traditional clustering algorithms are popular, but handling big data sets is beyond the ability of such methods. We propose three big data clustering methods, based on the Firefly Algorithm (FA). Three different fitness functions were defined on FA using inter cluster distance, intra cluster distance, silhouette value and Calinski-Harabasz Index. The algorithms find the most appropriate cluster centers for a given data set. The algorithms were tested with four popular synthetic data sets and later applied on two badminton data sets to identify different playing styles of players based on physical characteristics. The results specify that the firefly algorithm could generate better clustering results with high accuracy. The algorithms cluster the players to find the most suitable playing strategy for a given player where expert knowledge is needed in labeling the clusters. Comparisons with a PSO based clustering algorithm (APSO) and traditional algorithms point out that the proposed firefly variants work similarly as the APSO method and surpass the performance of traditional algorithms.
利用基于萤火虫算法的聚类算法寻找羽毛球运动员的打球风格
聚类分析可以定义为应用聚类算法,目的是在数据集中发现隐藏的模式或分组。不同的聚类方法为相同的数据集提供了不同的解决方案。传统的聚类算法很受欢迎,但处理大数据集超出了这种方法的能力。提出了基于萤火虫算法(Firefly Algorithm, FA)的三种大数据聚类方法。利用聚类间距离、聚类内距离、剪形值和Calinski-Harabasz指数定义了三种不同的适应度函数。该算法为给定的数据集找到最合适的聚类中心。在四种流行的合成数据集上对算法进行了测试,随后将算法应用于两个羽毛球数据集上,根据运动员的身体特征识别不同的打球风格。结果表明,萤火虫算法能产生较好的聚类结果,具有较高的聚类精度。算法对玩家进行聚类,为给定的玩家找到最合适的游戏策略,在标记聚类时需要专家知识。与基于粒子群算法的聚类算法(APSO)和传统算法的比较表明,所提出的萤火虫变体与基于粒子群算法的聚类方法相似,并且优于传统算法的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Computer Science-AGH
Computer Science-AGH COMPUTER SCIENCE, THEORY & METHODS-
CiteScore
1.40
自引率
0.00%
发文量
18
审稿时长
20 weeks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信