城市全球定位系统中 K 均值自动聚类的遗传-模糊蚁群混合优化算法

IF 7.5 2区 计算机科学 Q1 AUTOMATION & CONTROL SYSTEMS
{"title":"城市全球定位系统中 K 均值自动聚类的遗传-模糊蚁群混合优化算法","authors":"","doi":"10.1016/j.engappai.2024.109237","DOIUrl":null,"url":null,"abstract":"<div><p>This paper introduces an innovative automatic K-means clustering algorithm, namely HGA-FACO, which seamlessly integrates the noise algorithm, Genetic Algorithm (GA), Ant Colony Optimization (ACO), and Adaptive Fuzzy System (AFS). The rationale behind the HGA-FACO algorithm is to mitigate the shortcomings of traditional K-means, particularly the reliance on pre-determined cluster centers and the need for specifying the number of clusters in advance. By optimizing the search strategy, HGA-FACO efficiently circumvents local optima and effectively explores the global optimal solution, resulting in more accurate and stable clustering outcomes. To validate the superiority of the HGA-FACO over conventional K-Means Clustering (KMeans) and other intelligent clustering approaches such as ACO-KMeans, GA-KMeans (GAK), particle swarm optimization KMeans (PSOK), and ACO-GAK, we conducted comprehensive experiments on taxi Global Positioning System (GPS) datasets sourced from four distinct cities. Employing rigorous evaluation metrics including Silhouette Coefficient (SC), Partition Coefficient (PBM), Davies-Bouldin Index (DBI), and Sum of Squared Errors (SSE), the experimental results convincingly demonstrate that the HGA-FACO significantly outperforms its counterparts across all metrics, highlighting its exceptional performance in clustering effectiveness and compactness. While the HGA-FACO faces challenges related to computational complexity and the necessity for initial parameter tuning, its performance limitations on small-sized or unevenly distributed datasets are acknowledged. Nevertheless, the algorithm's advancements in the field of clustering algorithms are undeniable and hold immense potential for practical applications, notably in city hotspot identification.</p></div>","PeriodicalId":50523,"journal":{"name":"Engineering Applications of Artificial Intelligence","volume":null,"pages":null},"PeriodicalIF":7.5000,"publicationDate":"2024-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A hybrid genetic-fuzzy ant colony optimization algorithm for automatic K-means clustering in urban global positioning system\",\"authors\":\"\",\"doi\":\"10.1016/j.engappai.2024.109237\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>This paper introduces an innovative automatic K-means clustering algorithm, namely HGA-FACO, which seamlessly integrates the noise algorithm, Genetic Algorithm (GA), Ant Colony Optimization (ACO), and Adaptive Fuzzy System (AFS). The rationale behind the HGA-FACO algorithm is to mitigate the shortcomings of traditional K-means, particularly the reliance on pre-determined cluster centers and the need for specifying the number of clusters in advance. By optimizing the search strategy, HGA-FACO efficiently circumvents local optima and effectively explores the global optimal solution, resulting in more accurate and stable clustering outcomes. To validate the superiority of the HGA-FACO over conventional K-Means Clustering (KMeans) and other intelligent clustering approaches such as ACO-KMeans, GA-KMeans (GAK), particle swarm optimization KMeans (PSOK), and ACO-GAK, we conducted comprehensive experiments on taxi Global Positioning System (GPS) datasets sourced from four distinct cities. Employing rigorous evaluation metrics including Silhouette Coefficient (SC), Partition Coefficient (PBM), Davies-Bouldin Index (DBI), and Sum of Squared Errors (SSE), the experimental results convincingly demonstrate that the HGA-FACO significantly outperforms its counterparts across all metrics, highlighting its exceptional performance in clustering effectiveness and compactness. While the HGA-FACO faces challenges related to computational complexity and the necessity for initial parameter tuning, its performance limitations on small-sized or unevenly distributed datasets are acknowledged. Nevertheless, the algorithm's advancements in the field of clustering algorithms are undeniable and hold immense potential for practical applications, notably in city hotspot identification.</p></div>\",\"PeriodicalId\":50523,\"journal\":{\"name\":\"Engineering Applications of Artificial Intelligence\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":7.5000,\"publicationDate\":\"2024-09-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Engineering Applications of Artificial Intelligence\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0952197624013952\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"AUTOMATION & CONTROL SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Engineering Applications of Artificial Intelligence","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0952197624013952","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"AUTOMATION & CONTROL SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

本文介绍了一种创新的自动 K-means 聚类算法,即 HGA-FACO,它无缝集成了噪声算法、遗传算法(GA)、蚁群优化(ACO)和自适应模糊系统(AFS)。HGA-FACO 算法的基本原理是减轻传统 K-means 算法的缺点,特别是对预先确定的聚类中心的依赖和事先指定聚类数量的需要。通过优化搜索策略,HGA-FACO 有效地规避了局部最优,并有效地探索了全局最优解,从而获得了更准确、更稳定的聚类结果。为了验证 HGA-FACO 相对于传统 K-Means 聚类(KMeans)和其他智能聚类方法(如 ACO-KMeans、GA-KMeans(GAK)、粒子群优化 KMeans(PSOK)和 ACO-GAK)的优越性,我们在来自四个不同城市的出租车全球定位系统(GPS)数据集上进行了综合实验。实验采用了严格的评估指标,包括轮廓系数(SC)、分区系数(PBM)、戴维斯-博尔丁指数(DBI)和平方误差总和(SSE),实验结果令人信服地表明,HGA-FACO 在所有指标上都明显优于同类算法,凸显了其在聚类效果和紧凑性方面的卓越性能。虽然 HGA-FACO 面临着计算复杂性和初始参数调整必要性方面的挑战,但它在小规模或分布不均的数据集上的性能局限性也是有目共睹的。尽管如此,该算法在聚类算法领域的进步是毋庸置疑的,并且在实际应用中,特别是在城市热点识别方面具有巨大的潜力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A hybrid genetic-fuzzy ant colony optimization algorithm for automatic K-means clustering in urban global positioning system

This paper introduces an innovative automatic K-means clustering algorithm, namely HGA-FACO, which seamlessly integrates the noise algorithm, Genetic Algorithm (GA), Ant Colony Optimization (ACO), and Adaptive Fuzzy System (AFS). The rationale behind the HGA-FACO algorithm is to mitigate the shortcomings of traditional K-means, particularly the reliance on pre-determined cluster centers and the need for specifying the number of clusters in advance. By optimizing the search strategy, HGA-FACO efficiently circumvents local optima and effectively explores the global optimal solution, resulting in more accurate and stable clustering outcomes. To validate the superiority of the HGA-FACO over conventional K-Means Clustering (KMeans) and other intelligent clustering approaches such as ACO-KMeans, GA-KMeans (GAK), particle swarm optimization KMeans (PSOK), and ACO-GAK, we conducted comprehensive experiments on taxi Global Positioning System (GPS) datasets sourced from four distinct cities. Employing rigorous evaluation metrics including Silhouette Coefficient (SC), Partition Coefficient (PBM), Davies-Bouldin Index (DBI), and Sum of Squared Errors (SSE), the experimental results convincingly demonstrate that the HGA-FACO significantly outperforms its counterparts across all metrics, highlighting its exceptional performance in clustering effectiveness and compactness. While the HGA-FACO faces challenges related to computational complexity and the necessity for initial parameter tuning, its performance limitations on small-sized or unevenly distributed datasets are acknowledged. Nevertheless, the algorithm's advancements in the field of clustering algorithms are undeniable and hold immense potential for practical applications, notably in city hotspot identification.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Engineering Applications of Artificial Intelligence
Engineering Applications of Artificial Intelligence 工程技术-工程:电子与电气
CiteScore
9.60
自引率
10.00%
发文量
505
审稿时长
68 days
期刊介绍: Artificial Intelligence (AI) is pivotal in driving the fourth industrial revolution, witnessing remarkable advancements across various machine learning methodologies. AI techniques have become indispensable tools for practicing engineers, enabling them to tackle previously insurmountable challenges. Engineering Applications of Artificial Intelligence serves as a global platform for the swift dissemination of research elucidating the practical application of AI methods across all engineering disciplines. Submitted papers are expected to present novel aspects of AI utilized in real-world engineering applications, validated using publicly available datasets to ensure the replicability of research outcomes. Join us in exploring the transformative potential of AI in engineering.
×
引用
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学术官方微信