首页> 外文学位 >Pseudo-hierarchical ant-based clustering using a heterogeneous agent hierarchy and automatic boundary formation.
【24h】

Pseudo-hierarchical ant-based clustering using a heterogeneous agent hierarchy and automatic boundary formation.

机译:使用异构代理层次结构和自动边界形成的基于伪层次蚂蚁的聚类。

获取原文
获取原文并翻译 | 示例

摘要

The behavior and self-organization of ant colonies has been widely studied and served as the inspiration and source of many swarm intelligence models and related clustering algorithms. Unfortunately, most models that directly mimic ants produce too many clusters and converge too slowly. A wide range of research has attempted to address this issue through various means, but a number of problems remain: (1) Ants must still physically move from one cluster to another through intermediate locations, (2) current methods for remote relocation of an item only consider one movement at time to a particular location and do not consider patterns in movement to that location, and (3) while current methods have included effective bulk item movement, they do not provide efficient movement while still maintaining the self-organizing nature of ant-based clustering which is essential for filtering out outliers and allowing effective splitting of clusters. This thesis addresses these problems by proposing a new algorithm for ant-based clustering. In this algorithm ants maintain a movement zone around each cluster, keeping ants from spending time in locations where there is nothing to do. These movement zones around individual clusters are used to elect representatives that are responsible for all long distance movement. Each representative can, probabilistically, pass an object it has to any other representative. Since each cluster has approximately one representative at any given time, the search space for placing items over a long distance is reduce to the number of clusters. So instead of having all the ants use up time wandering around the map, one ant can be responsible for sampling all local clusters. This provides an infrastructure by which clusters can efficiently merge over long distances and better clusters for items in the wrong clusters can be found without having to travel to them. While this model does require a considerable overhead as compared with contemporary algorithms, a better convergence rate can be achieved because the efficient bulk movement of items and sampling at the cluster level.
机译:蚁群的行为和自组织已被广泛研究,并成为许多群体智能模型和相关聚类算法的灵感和来源。不幸的是,大多数直接模仿蚂蚁的模型会产生太多的簇并且收敛太慢。广泛的研究尝试通过各种方式解决此问题,但仍然存在许多问题:(1)蚂蚁仍必须通过中间位置从一个群集实际移动到另一个群集;(2)当前用于物品远程定位的方法仅考虑一次到特定位置的一次移动,而不考虑到该位置的移动方式,并且(3)尽管当前方法包括有效的散装物品移动,但它们在保持原有组织的自组织性质的同时不提供有效的移动基于蚂蚁的集群,这对于过滤异常值并允许集群有效分裂至关重要。本文通过提出一种新的基于蚁群的聚类算法来解决这些问题。在这种算法中,蚂蚁在每个簇周围保持一个运动区域,从而避免蚂蚁在无所事事的地方花费时间。这些围绕各个群集的运动区域用于选举负责所有长距离运动的代表。每个代表可以概率地将其拥有的对象传递给任何其他代表。由于每个群集在任何给定时间都具有大约一个代表,因此用于长距离放置项目的搜索空间将减少到群集的数量。因此,一只蚂蚁可以负责对所有本地集群进行采样,而不是让所有蚂蚁在地图上四处徘徊。这提供了一种基础结构,通过该基础结构,集群可以有效地长距离合并,并且可以找到错误集群中的项目的更好集群,而不必前往它们。尽管与现代算法相比,该模型确实需要大量开销,但由于在群集级别有效地批量移动商品和进行抽样,因此可以实现更好的收敛速度。

著录项

  • 作者

    Brown, Jeremy Bernard.;

  • 作者单位

    The University of Texas at Arlington.;

  • 授予单位 The University of Texas at Arlington.;
  • 学科 Computer Science.
  • 学位 M.S.
  • 年度 2009
  • 页码 106 p.
  • 总页数 106
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类 自动化技术、计算机技术;
  • 关键词

  • 入库时间 2022-08-17 11:38:31

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号