MKF-Cuckoo: Hybridization of Cuckoo Search and Multiple Kernel-based Fuzzy C-means Algorithm

D. Binu, M. Selvi, Aloysius George
{"title":"MKF-Cuckoo: Hybridization of Cuckoo Search and Multiple Kernel-based Fuzzy C-means Algorithm","authors":"D. Binu,&nbsp;M. Selvi,&nbsp;Aloysius George","doi":"10.1016/j.aasri.2013.10.037","DOIUrl":null,"url":null,"abstract":"<div><p>Discovering of optimal cluster through the help of optimization procedure is a recent trend in clustering process. Accordingly, several algorithms have been developed in the literature to mine optimal clusters. Most of the optimization- based clustering algorithms presented in the literature are only focused on the same objective given in the well-known clustering process, k-means clustering. Instead of k-means objective, some more effective objective functions are designed by the researchers for clustering. So, hybridization of those effective objectives with optimization algorithms can lead the effective clustering results. With the aim of this, we have presented a hybrid algorithm, called MKF-Cuckoo which is the hybridization of cuckoo search algorithm with the multiple kernel-based fuzzy c means algorithm. Here, MKFCM objective is taken and the same objective is solved through the cuckoo search algorithm which is one of the recent optimization algorithm proved effective in many optimization problems. For proving the effectiveness of the algorithm, the performance of the algorithm is comparatively analyzed with some other algorithm using clustering accuracy, rand coefficient, jaccard coefficient and computational time with iris and wine datasets. From the results, we can prove that the hybrid algorithm obtained 96% accuracy in iris data and 67% accuracy in wine data.</p></div>","PeriodicalId":100008,"journal":{"name":"AASRI Procedia","volume":"4 ","pages":"Pages 243-249"},"PeriodicalIF":0.0000,"publicationDate":"2013-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.aasri.2013.10.037","citationCount":"16","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"AASRI Procedia","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2212671613000383","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 16

Abstract

Discovering of optimal cluster through the help of optimization procedure is a recent trend in clustering process. Accordingly, several algorithms have been developed in the literature to mine optimal clusters. Most of the optimization- based clustering algorithms presented in the literature are only focused on the same objective given in the well-known clustering process, k-means clustering. Instead of k-means objective, some more effective objective functions are designed by the researchers for clustering. So, hybridization of those effective objectives with optimization algorithms can lead the effective clustering results. With the aim of this, we have presented a hybrid algorithm, called MKF-Cuckoo which is the hybridization of cuckoo search algorithm with the multiple kernel-based fuzzy c means algorithm. Here, MKFCM objective is taken and the same objective is solved through the cuckoo search algorithm which is one of the recent optimization algorithm proved effective in many optimization problems. For proving the effectiveness of the algorithm, the performance of the algorithm is comparatively analyzed with some other algorithm using clustering accuracy, rand coefficient, jaccard coefficient and computational time with iris and wine datasets. From the results, we can prove that the hybrid algorithm obtained 96% accuracy in iris data and 67% accuracy in wine data.

MKF-Cuckoo: Cuckoo搜索与基于多核的模糊c均值算法的杂交
利用优化过程发现最优聚类是聚类研究的一个新趋势。因此,文献中已经开发了几种算法来挖掘最优聚类。文献中提出的大多数基于优化的聚类算法都只关注与众所周知的聚类过程k-means聚类相同的目标。研究人员设计了一些更有效的目标函数来代替k-means目标函数。因此,将这些有效目标与优化算法进行杂交,可以得到有效的聚类结果。为此,我们提出了一种混合算法,称为MKF-Cuckoo,它是杜鹃搜索算法与基于多核的模糊c均值算法的杂交。本文以MKFCM为目标,通过布谷鸟搜索算法求解同一目标,布谷鸟搜索算法是近年来在许多优化问题中被证明有效的优化算法之一。为了证明算法的有效性,以虹膜和葡萄酒数据集为例,利用聚类精度、rand系数、jaccard系数和计算时间等指标,对比分析了算法的性能。从结果可以证明,混合算法在虹膜数据上的准确率为96%,在葡萄酒数据上的准确率为67%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信