Alpsoc蚂蚁狮子*:粒子群优化混合k -媒质聚类

T. M. Murugan, E. Baburaj
{"title":"Alpsoc蚂蚁狮子*:粒子群优化混合k -媒质聚类","authors":"T. M. Murugan, E. Baburaj","doi":"10.1109/ICSTCEE49637.2020.9277088","DOIUrl":null,"url":null,"abstract":"K-medoids clustering aims at partitioning a numerous data points into different K medoids based on the similarity distance between object pair. Cluster efficiency varies with respect to medoid initialization and may results in local optima traps. Various evolutionary swarm based approaches are adopted to obtain enhanced performance. Suitable combination of K-medoids with optimization technique does not operate well as expected while considering computational time. No such techniques are developed to solve entire clustering drawbacks. Assurance is not provided to any method in attaining success by solving the overall issues. Hence in this, an improved K-medoids integrated with Ant lion optimization and Particle swarm optimization algorithm commonly referred as ALPSOC is proposed to obtain optimized cluster centroid in which the computational complexity is preserved with better improvements in performance. Further the intra-cluster distance, F-measure, Rand Index, Adjusted Rand Index, Entropy and Normalized Mutual Information is evaluated for different datasets adopting the presented approach. The proposed algorithm is simulated on different datasets and is compared with different existing techniques based on above performance metric. From the observed results, it is shown that the proposed method functions better in all cases maintaining to solve clustering limitations.","PeriodicalId":113845,"journal":{"name":"2020 International Conference on Smart Technologies in Computing, Electrical and Electronics (ICSTCEE)","volume":"214 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Alpsoc Ant Lion * : Particle Swarm Optimized Hybrid K-Medoid Clustering\",\"authors\":\"T. M. Murugan, E. Baburaj\",\"doi\":\"10.1109/ICSTCEE49637.2020.9277088\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"K-medoids clustering aims at partitioning a numerous data points into different K medoids based on the similarity distance between object pair. Cluster efficiency varies with respect to medoid initialization and may results in local optima traps. Various evolutionary swarm based approaches are adopted to obtain enhanced performance. Suitable combination of K-medoids with optimization technique does not operate well as expected while considering computational time. No such techniques are developed to solve entire clustering drawbacks. Assurance is not provided to any method in attaining success by solving the overall issues. Hence in this, an improved K-medoids integrated with Ant lion optimization and Particle swarm optimization algorithm commonly referred as ALPSOC is proposed to obtain optimized cluster centroid in which the computational complexity is preserved with better improvements in performance. Further the intra-cluster distance, F-measure, Rand Index, Adjusted Rand Index, Entropy and Normalized Mutual Information is evaluated for different datasets adopting the presented approach. The proposed algorithm is simulated on different datasets and is compared with different existing techniques based on above performance metric. From the observed results, it is shown that the proposed method functions better in all cases maintaining to solve clustering limitations.\",\"PeriodicalId\":113845,\"journal\":{\"name\":\"2020 International Conference on Smart Technologies in Computing, Electrical and Electronics (ICSTCEE)\",\"volume\":\"214 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-10-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 International Conference on Smart Technologies in Computing, Electrical and Electronics (ICSTCEE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICSTCEE49637.2020.9277088\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 International Conference on Smart Technologies in Computing, Electrical and Electronics (ICSTCEE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSTCEE49637.2020.9277088","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

K-媒质聚类的目的是根据对象对之间的相似距离将大量数据点划分为不同的K媒质。簇效率随介质初始化而变化,并可能导致局部最优陷阱。采用了各种基于进化群的方法来提高性能。考虑到计算时间的因素,k -介质与优化技术的适当结合并不能达到预期的效果。目前还没有开发出这样的技术来解决整个集群的缺点。不保证任何方法通过解决整体问题而获得成功。为此,本文提出了一种结合蚁狮优化和粒子群优化算法(ALPSOC)的改进k -介质算法,以获得优化的聚类质心,在保证计算复杂度的同时,在性能上有较好的提高。采用该方法对不同数据集的聚类距离、f测度、Rand指数、调整后Rand指数、熵和归一化互信息进行了评估。在不同的数据集上对该算法进行了仿真,并基于上述性能指标与现有的不同算法进行了比较。观察结果表明,该方法在所有情况下都能较好地解决聚类限制问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Alpsoc Ant Lion * : Particle Swarm Optimized Hybrid K-Medoid Clustering
K-medoids clustering aims at partitioning a numerous data points into different K medoids based on the similarity distance between object pair. Cluster efficiency varies with respect to medoid initialization and may results in local optima traps. Various evolutionary swarm based approaches are adopted to obtain enhanced performance. Suitable combination of K-medoids with optimization technique does not operate well as expected while considering computational time. No such techniques are developed to solve entire clustering drawbacks. Assurance is not provided to any method in attaining success by solving the overall issues. Hence in this, an improved K-medoids integrated with Ant lion optimization and Particle swarm optimization algorithm commonly referred as ALPSOC is proposed to obtain optimized cluster centroid in which the computational complexity is preserved with better improvements in performance. Further the intra-cluster distance, F-measure, Rand Index, Adjusted Rand Index, Entropy and Normalized Mutual Information is evaluated for different datasets adopting the presented approach. The proposed algorithm is simulated on different datasets and is compared with different existing techniques based on above performance metric. From the observed results, it is shown that the proposed method functions better in all cases maintaining to solve clustering limitations.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Flower Classification using Deep Learning models An Unprecedented PSO-PID Optimized Glucose Homeostasis Improving elasticity in cloud with predictive algorithms A Second Order-Second Order Generalized Integrator for Three - Phase Single – Stage Multifunctional Grid-Connected SPV System Continuous Compliance model for Hybrid Multi-Cloud through Self-Service Orchestrator
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1