无监督数据聚类的k -媒质疯狂萤火虫算法

M. Behera, Archana Sarangi, Debahuti Mishra
{"title":"无监督数据聚类的k -媒质疯狂萤火虫算法","authors":"M. Behera, Archana Sarangi, Debahuti Mishra","doi":"10.1109/ODICON50556.2021.9428980","DOIUrl":null,"url":null,"abstract":"Data clustering is an unsupervised process in which identical data are collected in groups. A clustering algorithm divides a set of objects into different subsets, these subsets are non-overlapping in nature, and each subset is considered as a cluster. In this paper, a modified clustering approach is developed on integration of k-medoids clustering algorithm with crazy firefly algorithm. The proposed algorithm is experimented on four different datasets. The main aim of the suggested algorithm is to give fast and accurate user specified clustering results from given datasets. Finally, the outcome obtained from the proposed algorithm is compared with both k-medoids clustering algorithm and k-medoids firefly clustering algorithm. The results of the suggested algorithm are better than the k-medoids algorithm and the k-medoids firefly clustering algorithm.","PeriodicalId":197132,"journal":{"name":"2021 1st Odisha International Conference on Electrical Power Engineering, Communication and Computing Technology(ODICON)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-01-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"K-medoids Crazy Firefly Algorithm For Unsupervised Data Clustering\",\"authors\":\"M. Behera, Archana Sarangi, Debahuti Mishra\",\"doi\":\"10.1109/ODICON50556.2021.9428980\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Data clustering is an unsupervised process in which identical data are collected in groups. A clustering algorithm divides a set of objects into different subsets, these subsets are non-overlapping in nature, and each subset is considered as a cluster. In this paper, a modified clustering approach is developed on integration of k-medoids clustering algorithm with crazy firefly algorithm. The proposed algorithm is experimented on four different datasets. The main aim of the suggested algorithm is to give fast and accurate user specified clustering results from given datasets. Finally, the outcome obtained from the proposed algorithm is compared with both k-medoids clustering algorithm and k-medoids firefly clustering algorithm. The results of the suggested algorithm are better than the k-medoids algorithm and the k-medoids firefly clustering algorithm.\",\"PeriodicalId\":197132,\"journal\":{\"name\":\"2021 1st Odisha International Conference on Electrical Power Engineering, Communication and Computing Technology(ODICON)\",\"volume\":\"44 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-01-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 1st Odisha International Conference on Electrical Power Engineering, Communication and Computing Technology(ODICON)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ODICON50556.2021.9428980\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 1st Odisha International Conference on Electrical Power Engineering, Communication and Computing Technology(ODICON)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ODICON50556.2021.9428980","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

数据聚类是一种无监督的过程,其中将相同的数据分组收集。聚类算法将一组对象划分为不同的子集,这些子集本质上是不重叠的,每个子集被认为是一个聚类。本文将k- medioids聚类算法与疯狂萤火虫算法相结合,提出了一种改进的聚类方法。该算法在四个不同的数据集上进行了实验。该算法的主要目的是在给定的数据集上给出快速准确的用户指定聚类结果。最后,将该算法与k-medoids聚类算法和k-medoids萤火虫聚类算法进行了比较。该算法的聚类结果优于k-medoids算法和k-medoids萤火虫聚类算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
K-medoids Crazy Firefly Algorithm For Unsupervised Data Clustering
Data clustering is an unsupervised process in which identical data are collected in groups. A clustering algorithm divides a set of objects into different subsets, these subsets are non-overlapping in nature, and each subset is considered as a cluster. In this paper, a modified clustering approach is developed on integration of k-medoids clustering algorithm with crazy firefly algorithm. The proposed algorithm is experimented on four different datasets. The main aim of the suggested algorithm is to give fast and accurate user specified clustering results from given datasets. Finally, the outcome obtained from the proposed algorithm is compared with both k-medoids clustering algorithm and k-medoids firefly clustering algorithm. The results of the suggested algorithm are better than the k-medoids algorithm and the k-medoids firefly clustering algorithm.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信