Clustering Approach Using Multiobjective Non-Dominated Sorting Teaching Learning Based Optimization with Kernel Fuzzy C-Means Algorithm (NSTLBO-KFCM)

Saumya Singh, S. Srivastava
{"title":"Clustering Approach Using Multiobjective Non-Dominated Sorting Teaching Learning Based Optimization with Kernel Fuzzy C-Means Algorithm (NSTLBO-KFCM)","authors":"Saumya Singh, S. Srivastava","doi":"10.1109/REEDCON57544.2023.10150896","DOIUrl":null,"url":null,"abstract":"Clustering has evolved over a period and has become more sensitive and precise with the outcomes. No clustering algorithm is suited for all types of data sets, but partitional clustering lays foundation for almost all-important clustering algorithms. Single solution can be achieved in case of single objective clustering, but in multiobjective clustering the solution becomes set of solution vector. Multiobjective clustering has made the pattern recognition possible in more than one dimension. The solution strategy of Multiobjective clustering is conceptualized on Pareto dominance. A multiobjective NSTLBO-KFCM is implemented in this paper using non-dominated sorting technique. The clustering algorithm is then compared with multiobjective non dominated sorting genetic algorithm third generation-based kernel fuzzy C-means (NSGAIII-KFCM) algorithm and multiobjective particle swarm optimization-based kernel fuzzy C-means (MPSO-KFCM) algorithm. The algorithm is also compared with non-dominated sorting teaching learning-based optimization with fuzzy C-means (NSTLBO-FCM) algorithm and the results show that NSTLBO-KFCM is superior clustering algorithm.","PeriodicalId":429116,"journal":{"name":"2023 International Conference on Recent Advances in Electrical, Electronics & Digital Healthcare Technologies (REEDCON)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 International Conference on Recent Advances in Electrical, Electronics & Digital Healthcare Technologies (REEDCON)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/REEDCON57544.2023.10150896","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Clustering has evolved over a period and has become more sensitive and precise with the outcomes. No clustering algorithm is suited for all types of data sets, but partitional clustering lays foundation for almost all-important clustering algorithms. Single solution can be achieved in case of single objective clustering, but in multiobjective clustering the solution becomes set of solution vector. Multiobjective clustering has made the pattern recognition possible in more than one dimension. The solution strategy of Multiobjective clustering is conceptualized on Pareto dominance. A multiobjective NSTLBO-KFCM is implemented in this paper using non-dominated sorting technique. The clustering algorithm is then compared with multiobjective non dominated sorting genetic algorithm third generation-based kernel fuzzy C-means (NSGAIII-KFCM) algorithm and multiobjective particle swarm optimization-based kernel fuzzy C-means (MPSO-KFCM) algorithm. The algorithm is also compared with non-dominated sorting teaching learning-based optimization with fuzzy C-means (NSTLBO-FCM) algorithm and the results show that NSTLBO-KFCM is superior clustering algorithm.
基于核模糊c均值算法(NSTLBO-KFCM)的多目标非支配排序教学优化聚类方法
聚类已经发展了一段时间,并且对结果变得更加敏感和精确。没有一种聚类算法适合所有类型的数据集,但分区聚类为几乎所有重要的聚类算法奠定了基础。在单目标聚类的情况下可以得到单个解,而在多目标聚类的情况下,解成为解向量的集合。多目标聚类使得模式识别在多个维度上成为可能。在Pareto优势的基础上,提出了多目标聚类问题的求解策略。本文采用非支配排序技术实现了一种多目标NSTLBO-KFCM。将该聚类算法与多目标非主导排序遗传算法第三代核模糊c -均值(NSGAIII-KFCM)算法和多目标粒子群优化核模糊c -均值(MPSO-KFCM)算法进行比较。并将该算法与基于模糊c均值的非主导排序教学优化算法(NSTLBO-FCM)进行了比较,结果表明NSTLBO-KFCM是更优的聚类算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信