首页> 外文会议>International conference on neural information processing >Hierarchical Nearest Neighbor Graphs for Building Perceptual Hierarchies
【24h】

Hierarchical Nearest Neighbor Graphs for Building Perceptual Hierarchies

机译:用于构建感知层次结构的层次最近邻图

获取原文

摘要

Humans tend to organize their knowledge into hierarchies, because searches are efficient when proceeding downward in the tree-like structures. Similarly, many autonomous robots also contain some form of hierarchical knowledge. They may learn knowledge from their experiences through interaction with human users. However, it is difficult to find a common ground between robots and humans in a low level experience. Thus, their interaction must take place at the semantic level rather than at the perceptual level, and robots need to organize perceptual experiences into hierarchies for themselves. This paper presents an unsupervised method to build view-based perceptual hierarchies using hierarchical Nearest Neighbor Graphs (hNNGs), which combine most of the interesting features of both Nearest Neighbor Graphs (NNGs) and self-balancing trees. An incremental construction algorithm is developed to build and maintain the perceptual hierarchies. The paper describes the details of the data representations and the algorithms of hNNGs.
机译:人类倾向于将其知识组织为层次结构,因为在树状结构中向下进行搜索时效率很高。同样,许多自主机器人也包含某种形式的分层知识。他们可能会通过与人类用户互动来从经验中学到知识。但是,在低水平的体验中很难在机器人和人之间找到共同点。因此,它们的交互必须在语义级别而不是在感知级别进行,并且机器人需要将感知体验自身组织为层次结构。本文提出了一种无监督的方法,该方法使用分层的最近邻居图(hNNG)构建基于视图的感知层次结构,该方法结合了最近邻居图(NNG)和自平衡树的大多数有趣功能。开发了一种增量构造算法来构造和维护感知层次。本文详细介绍了hNNG的数据表示形式和算法。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号