使用真实蚂蚁行为的数据流增量聚类

N. Masmoudi, Hanene Azzag, M. Lebbah, C. Bertelle
{"title":"使用真实蚂蚁行为的数据流增量聚类","authors":"N. Masmoudi, Hanene Azzag, M. Lebbah, C. Bertelle","doi":"10.1109/NaBIC.2014.6921889","DOIUrl":null,"url":null,"abstract":"We present in this paper a new biomimetic method nammed CL-AntInc for data incremental clustering. This algorithm uses the behavior of real ants. We deal with the issue of data volume through a clustering heuristic. Dynamic graphs are constructed according to a simulation of colonial odors and pheromone mechanisms. We used numerical databases extracted from the Machine Learning Repository. The experimental results show the effectiveness of the suggested algorithm.","PeriodicalId":209716,"journal":{"name":"2014 Sixth World Congress on Nature and Biologically Inspired Computing (NaBIC 2014)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2014-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Incremental clustering of data stream using real ants behavior\",\"authors\":\"N. Masmoudi, Hanene Azzag, M. Lebbah, C. Bertelle\",\"doi\":\"10.1109/NaBIC.2014.6921889\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present in this paper a new biomimetic method nammed CL-AntInc for data incremental clustering. This algorithm uses the behavior of real ants. We deal with the issue of data volume through a clustering heuristic. Dynamic graphs are constructed according to a simulation of colonial odors and pheromone mechanisms. We used numerical databases extracted from the Machine Learning Repository. The experimental results show the effectiveness of the suggested algorithm.\",\"PeriodicalId\":209716,\"journal\":{\"name\":\"2014 Sixth World Congress on Nature and Biologically Inspired Computing (NaBIC 2014)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-10-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 Sixth World Congress on Nature and Biologically Inspired Computing (NaBIC 2014)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NaBIC.2014.6921889\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 Sixth World Congress on Nature and Biologically Inspired Computing (NaBIC 2014)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NaBIC.2014.6921889","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

本文提出了一种新的用于数据增量聚类的仿生方法CL-AntInc。这个算法使用了真实蚂蚁的行为。我们通过聚类启发式来处理数据量问题。根据群体气味和信息素机制的模拟,构建了动态图。我们使用了从机器学习存储库中提取的数值数据库。实验结果表明了该算法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Incremental clustering of data stream using real ants behavior
We present in this paper a new biomimetic method nammed CL-AntInc for data incremental clustering. This algorithm uses the behavior of real ants. We deal with the issue of data volume through a clustering heuristic. Dynamic graphs are constructed according to a simulation of colonial odors and pheromone mechanisms. We used numerical databases extracted from the Machine Learning Repository. The experimental results show the effectiveness of the suggested algorithm.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信