利用蚁群算法进行高效聚类

Yong Wang, Wei Zhang, Jun Chen, Jianfu Li, Li Xiao
{"title":"利用蚁群算法进行高效聚类","authors":"Yong Wang, Wei Zhang, Jun Chen, Jianfu Li, Li Xiao","doi":"10.1117/12.784045","DOIUrl":null,"url":null,"abstract":"To improve the performance of data clustering, this study proposes a novel clustering method called ABCA (ACO Based Clustering Algorithm). The presented method is based on heuristic concept and using Ant Colony Optimization algorithm (ACO) to obtain global search. The main advantage of these algorithms lies in the fact that no additional information, such as an initial partitioning of the data or the number of clusters, is needed. Since the proposed method is very efficiently, thus it can perform data clustering very quickly.","PeriodicalId":250590,"journal":{"name":"ICMIT: Mechatronics and Information Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Using ant colony optimization for efficient clustering\",\"authors\":\"Yong Wang, Wei Zhang, Jun Chen, Jianfu Li, Li Xiao\",\"doi\":\"10.1117/12.784045\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"To improve the performance of data clustering, this study proposes a novel clustering method called ABCA (ACO Based Clustering Algorithm). The presented method is based on heuristic concept and using Ant Colony Optimization algorithm (ACO) to obtain global search. The main advantage of these algorithms lies in the fact that no additional information, such as an initial partitioning of the data or the number of clusters, is needed. Since the proposed method is very efficiently, thus it can perform data clustering very quickly.\",\"PeriodicalId\":250590,\"journal\":{\"name\":\"ICMIT: Mechatronics and Information Technology\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-12-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ICMIT: Mechatronics and Information Technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1117/12.784045\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ICMIT: Mechatronics and Information Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1117/12.784045","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

为了提高数据聚类的性能,本文提出了一种新的聚类方法ABCA(基于蚁群算法的聚类算法)。该方法基于启发式概念,采用蚁群优化算法实现全局搜索。这些算法的主要优点在于不需要额外的信息,例如数据的初始分区或簇的数量。由于该方法非常有效,因此可以非常快速地进行数据聚类。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Using ant colony optimization for efficient clustering
To improve the performance of data clustering, this study proposes a novel clustering method called ABCA (ACO Based Clustering Algorithm). The presented method is based on heuristic concept and using Ant Colony Optimization algorithm (ACO) to obtain global search. The main advantage of these algorithms lies in the fact that no additional information, such as an initial partitioning of the data or the number of clusters, is needed. Since the proposed method is very efficiently, thus it can perform data clustering very quickly.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信