电气数据聚类的模糊粒子群和k -谐波均值算法

A. Rani, Latha Parthipan
{"title":"电气数据聚类的模糊粒子群和k -谐波均值算法","authors":"A. Rani, Latha Parthipan","doi":"10.1109/ICRTIT.2013.6844261","DOIUrl":null,"url":null,"abstract":"This paper proposed Fuzzified Particle Swarm Optimization and K-Harmonic Means algorithm (FPSO+KHM) for clustering the Electrical data systems. Thepartitioned clustering algorithms are more suitable for clustering large datasets. The K-Harmonic means algorithm is center based clustering algorithm and very insensitive to the selection of initial partition usingbuilt in boost function, but easily convergence in local optima. The proposed algorithm uses Fuzzified PSO and K-harmonic means algorithm to generate more accurate, robust, better clustering results, best solution in few number of iterations, avoid trapping in local optima and get faster convergence when compare to K-Harmonic Meansand hybrid PSO+ K-Harmonic Means algorithms. This algorithm is applied for two different set of IEEE bus electrical data systems.","PeriodicalId":113531,"journal":{"name":"2013 International Conference on Recent Trends in Information Technology (ICRTIT)","volume":"100 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"FuzzifiedPSO and K-Harmonic means algorithm for electrical data clustering\",\"authors\":\"A. Rani, Latha Parthipan\",\"doi\":\"10.1109/ICRTIT.2013.6844261\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper proposed Fuzzified Particle Swarm Optimization and K-Harmonic Means algorithm (FPSO+KHM) for clustering the Electrical data systems. Thepartitioned clustering algorithms are more suitable for clustering large datasets. The K-Harmonic means algorithm is center based clustering algorithm and very insensitive to the selection of initial partition usingbuilt in boost function, but easily convergence in local optima. The proposed algorithm uses Fuzzified PSO and K-harmonic means algorithm to generate more accurate, robust, better clustering results, best solution in few number of iterations, avoid trapping in local optima and get faster convergence when compare to K-Harmonic Meansand hybrid PSO+ K-Harmonic Means algorithms. This algorithm is applied for two different set of IEEE bus electrical data systems.\",\"PeriodicalId\":113531,\"journal\":{\"name\":\"2013 International Conference on Recent Trends in Information Technology (ICRTIT)\",\"volume\":\"100 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-07-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 International Conference on Recent Trends in Information Technology (ICRTIT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICRTIT.2013.6844261\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 International Conference on Recent Trends in Information Technology (ICRTIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICRTIT.2013.6844261","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

针对电力数据系统的聚类问题,提出了模糊粒子群算法和k -谐波平均算法(FPSO+KHM)。分区聚类算法更适合于大型数据集的聚类。k -谐均值算法是一种基于中心的聚类算法,它使用内置的boost函数对初始分区的选择不敏感,但易于收敛于局部最优。与K-harmonic means和混合PSO+ K-harmonic means算法相比,该算法采用模糊化PSO和K-harmonic means算法,生成更准确、鲁棒、更好的聚类结果,迭代次数少,解最优,避免陷入局部最优,收敛速度更快。该算法应用于两组不同的IEEE总线电气数据系统。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
FuzzifiedPSO and K-Harmonic means algorithm for electrical data clustering
This paper proposed Fuzzified Particle Swarm Optimization and K-Harmonic Means algorithm (FPSO+KHM) for clustering the Electrical data systems. Thepartitioned clustering algorithms are more suitable for clustering large datasets. The K-Harmonic means algorithm is center based clustering algorithm and very insensitive to the selection of initial partition usingbuilt in boost function, but easily convergence in local optima. The proposed algorithm uses Fuzzified PSO and K-harmonic means algorithm to generate more accurate, robust, better clustering results, best solution in few number of iterations, avoid trapping in local optima and get faster convergence when compare to K-Harmonic Meansand hybrid PSO+ K-Harmonic Means algorithms. This algorithm is applied for two different set of IEEE bus electrical data systems.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信