【24h】

Real-time Unsupervised Clustering

机译:实时无监督聚类

获取原文

摘要

In our research program, we are developing machine learning algorithms to enable a mobile robot to build a compact representation of its environment. This requires the processing of each new input to terminate in constant time. Existing machine learning algorithms are either incapable of meeting this constraint or deliver problematic results. In this paper, we describe a new algorithm for real-time unsupervised clustering, Bounded Self-Organizing Clustering. It executes in constant time for each input, and it produces clusterings that are significantly better than those created by the Self-Organizing Map, its closest competitor, on sensor data acquired from a physically embodied mobile robot.
机译:在我们的研究计划中,我们正在开发机器学习算法,使移动机器人能够构建其环境的紧凑表示。 这需要处理每个新输入以在恒定的时间内终止。 现有机器学习算法无法满足此约束或提供有问题的结果。 在本文中,我们描述了一种用于实时无监督群集的新算法,有界自组织聚类。 它以恒定的时间执行每个输入,它产生比由自组织地图,其最接近的竞争对手创建的集群,其最接近来自物理体现的移动机器人的传感器数据。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号