DIGWO: Hybridization of Dragonfly Algorithm with Improved Grey Wolf Optimization Algorithm for Data Clustering

A. N. Jadhav
{"title":"DIGWO: Hybridization of Dragonfly Algorithm with Improved Grey Wolf Optimization Algorithm for Data Clustering","authors":"A. N. Jadhav","doi":"10.46253/j.mr.v2i3.a1","DOIUrl":null,"url":null,"abstract":": Data present in great quantity raises the difficulty of managing them that affects the effectual decision-making procedure. Therefore, data clustering achieves notable significance in knowledge extraction and a well-organized clustering algorithm endorses the effectual decision making. For that reason, an algorithm for data clustering by exploiting the DIGWO method is presented in this paper, which decides the optimal centroid to perform the clustering procedure. The developed DIGWO technique exploits the calculation steps of the Dragonfly Algorithm (DA) with the incorporation of the Improved Grey Wolf Optimization (IGWO) with a novel formulated fitness model. Moreover, the proposed method exploits the least fitness measure to position the optimal centroid and the fitness measure based upon three constraints, such as intra-cluster distance, intercluster distance, and cluster density. The optimal centroid ensuing to the minimum value of the fitness is exploited for clustering the data. Simulation is performed by exploiting three datasets and the comparative evaluation is performed that shows that the performance of the developed method is better than the conventional algorithms such as Grey Wolf Optimization (GWO), Dragonfly and Particle Swarm Optimization (PSO).","PeriodicalId":167187,"journal":{"name":"Multimedia Research","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"78","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Multimedia Research","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.46253/j.mr.v2i3.a1","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 78

Abstract

: Data present in great quantity raises the difficulty of managing them that affects the effectual decision-making procedure. Therefore, data clustering achieves notable significance in knowledge extraction and a well-organized clustering algorithm endorses the effectual decision making. For that reason, an algorithm for data clustering by exploiting the DIGWO method is presented in this paper, which decides the optimal centroid to perform the clustering procedure. The developed DIGWO technique exploits the calculation steps of the Dragonfly Algorithm (DA) with the incorporation of the Improved Grey Wolf Optimization (IGWO) with a novel formulated fitness model. Moreover, the proposed method exploits the least fitness measure to position the optimal centroid and the fitness measure based upon three constraints, such as intra-cluster distance, intercluster distance, and cluster density. The optimal centroid ensuing to the minimum value of the fitness is exploited for clustering the data. Simulation is performed by exploiting three datasets and the comparative evaluation is performed that shows that the performance of the developed method is better than the conventional algorithms such as Grey Wolf Optimization (GWO), Dragonfly and Particle Swarm Optimization (PSO).
DIGWO:蜻蜓算法与改进灰狼优化算法的杂交聚类
大量的数据增加了管理这些数据的难度,影响了有效的决策程序。因此,数据聚类在知识提取中具有显著意义,组织良好的聚类算法有利于有效的决策。为此,本文提出了一种利用DIGWO方法进行数据聚类的算法,该算法确定最优质心来进行聚类。DIGWO技术利用了蜻蜓算法(DA)的计算步骤,并将改进的灰狼优化(IGWO)与新的制定的适应度模型结合起来。此外,该方法利用最小适应度度量来定位最优质心,并基于簇内距离、簇间距离和簇密度三个约束条件进行适应度度量。利用适应度最小的最优质心对数据进行聚类。利用3个数据集进行了仿真,并进行了对比评价,结果表明该方法的性能优于灰狼优化(GWO)、蜻蜓优化(Dragonfly)和粒子群优化(PSO)等传统算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信