Nature inspired-based remora optimisation algorithm for enhancement of density peak clustering

IF 2.1 Q2 ENGINEERING, MULTIDISCIPLINARY
S. Anandarao, Sweetlin Hemalatha Chellasamy
{"title":"Nature inspired-based remora optimisation algorithm for enhancement of density peak clustering","authors":"S. Anandarao, Sweetlin Hemalatha Chellasamy","doi":"10.1080/23311916.2023.2278259","DOIUrl":null,"url":null,"abstract":"Abstract Density peak clustering (DPC) has shown promising results for many complex problems when compared with other existing clustering techniques. Inspite of many advantages, DPC suffers with lack of cluster centroids and cut-off distance identification. Cut-off distance is the prominent parameter used in the calculation of local density. The improper choice of cut-off distance leads to improper cluster results. Currently, the cut-off distance is selected using decision graph or delta density or knee point detection or silhouette score or kernel functions. The main problem with the above functions for selecting the cut-off distance in DPC is that they often rely on heuristic or visually subjective criteria, making the choice of the optimal cut-off distance challenging and potentially sensitive to data characteristics. By leveraging metaheuristic optimisation algorithms, the process of selecting the cut-off distance becomes less subjective and data-driven, potentially leading to improved clustering results in DPC. This motivated us to work on the choice of cut-off distance by the usage of remora optimisation algorithm (ROA). The cluster results are improved by the usage of remora in selection of reliable cut-off distance (${d_c})$dc). The effectiveness of the updated DPC with ROA is evaluated by applying on the eight datasets and compared with K-means, traditional DPC, DPC merged with other optimisation results. The three parameters used here to check the quality of the cluster are homogeneity, completeness and silhouette analysis. ROA is new and built on the inspiration of remora which moves from one place to another using the sea fishes like shark, whale, sword fish, etc. It is clear from the results that DPC with ROA has produced the better homogeneity value of 0.807, completeness of 0.699 and silhouette analysis of 0.79 than the other clustering algorithms.","PeriodicalId":10464,"journal":{"name":"Cogent Engineering","volume":"56 7","pages":""},"PeriodicalIF":2.1000,"publicationDate":"2023-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Cogent Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/23311916.2023.2278259","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"ENGINEERING, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 0

Abstract

Abstract Density peak clustering (DPC) has shown promising results for many complex problems when compared with other existing clustering techniques. Inspite of many advantages, DPC suffers with lack of cluster centroids and cut-off distance identification. Cut-off distance is the prominent parameter used in the calculation of local density. The improper choice of cut-off distance leads to improper cluster results. Currently, the cut-off distance is selected using decision graph or delta density or knee point detection or silhouette score or kernel functions. The main problem with the above functions for selecting the cut-off distance in DPC is that they often rely on heuristic or visually subjective criteria, making the choice of the optimal cut-off distance challenging and potentially sensitive to data characteristics. By leveraging metaheuristic optimisation algorithms, the process of selecting the cut-off distance becomes less subjective and data-driven, potentially leading to improved clustering results in DPC. This motivated us to work on the choice of cut-off distance by the usage of remora optimisation algorithm (ROA). The cluster results are improved by the usage of remora in selection of reliable cut-off distance (${d_c})$dc). The effectiveness of the updated DPC with ROA is evaluated by applying on the eight datasets and compared with K-means, traditional DPC, DPC merged with other optimisation results. The three parameters used here to check the quality of the cluster are homogeneity, completeness and silhouette analysis. ROA is new and built on the inspiration of remora which moves from one place to another using the sea fishes like shark, whale, sword fish, etc. It is clear from the results that DPC with ROA has produced the better homogeneity value of 0.807, completeness of 0.699 and silhouette analysis of 0.79 than the other clustering algorithms.
基于自然启发的雷莫拉优化算法,用于增强密度峰聚类效果
摘要 与其他现有聚类技术相比,密度峰聚类(DPC)在许多复杂问题上都显示出良好的效果。尽管密度峰聚类具有很多优点,但它也存在缺乏聚类中心点和截止距离识别的问题。截止距离是用于计算局部密度的重要参数。截断距离选择不当会导致聚类结果不正确。目前,截止距离是通过决策图或 delta 密度或膝点检测或剪影得分或核函数来选择的。在 DPC 中,上述用于选择截止距离的函数存在的主要问题是,它们通常依赖于启发式或视觉主观标准,这使得最优截止距离的选择具有挑战性,并且可能对数据特征非常敏感。通过利用元启发式优化算法,选择截止距离的过程变得不那么主观,而是以数据为导向,从而有可能改进 DPC 中的聚类结果。这促使我们使用雷莫拉优化算法(ROA)来选择截止距离。在选择可靠的截止距离(${d_c})$dc)时使用 remora,聚类结果得到了改善。通过在八个数据集上应用 ROA,并与 K-means、传统 DPC、与其他优化结果合并的 DPC 进行比较,对更新的 DPC 的有效性进行了评估。检查聚类质量的三个参数是同质性、完整性和剪影分析。ROA 是一种新方法,其灵感来源于利用鲨鱼、鲸鱼、剑鱼等海洋鱼类从一个地方移动到另一个地方的 remora。从结果可以看出,与其他聚类算法相比,使用 ROA 的 DPC 产生了更好的同质性值 0.807、完整性 0.699 和剪影分析 0.79。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Cogent Engineering
Cogent Engineering ENGINEERING, MULTIDISCIPLINARY-
CiteScore
4.00
自引率
5.30%
发文量
213
审稿时长
13 weeks
期刊介绍: One of the largest, multidisciplinary open access engineering journals of peer-reviewed research, Cogent Engineering, part of the Taylor & Francis Group, covers all areas of engineering and technology, from chemical engineering to computer science, and mechanical to materials engineering. Cogent Engineering encourages interdisciplinary research and also accepts negative results, software article, replication studies and reviews.
×
引用
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学术官方微信