• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>Annual conference of the International Speech Communication Association;INTERSPEECH 2011 >Determining What Questions To Ask, with the Help of Spectral Graph Theory
【24h】

Determining What Questions To Ask, with the Help of Spectral Graph Theory

机译：借助频谱图理论确定要问的问题

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

This paper considers questions and the objects being asked about to be a graph and formulates the knowledge goal of a question-asking agent in terms of connecting this graph. The game of twenty questions can be thought of as a testbed of such a question-asking agent's knowledge. If the agent's knowledge of the domain were completely specified, the goal of question-asking would be to find the answer as quickly as possible and could follow a decision tree approach to narrow down the candidate answers. However, if the agent's knowledge is incomplete, it must have a secondary goal for the questions it plans: to complete its knowledge. We claim that this secondary goal of a question asking agent can be formulated in terms of spectral graph theory. In particular, disconnected portions of the graph must be connected in a principled way. We show how the eigenvalues of a graph Laplacian of the the question-object adjacency graph can identify whether a set of knowledge contains disconnected components and the zero elements of the powers of the question-object adjacency graph provide a way to identify these questions. We illustrate the approach using an emotion description task.
机译：本文将问题和要询问的对象视为一个图形，并根据连接该图形来制定问题代理的知识目标。二十个问题的游戏可以看作是这种提问者知识的试验床。如果完全指定了代理对领域的了解，则提问的目标将是尽快找到答案，并可以遵循决策树方法来缩小候选答案的范围。但是，如果代理人的知识不完整，则它必须对计划中的问题有第二个目标：完成其知识。我们声称可以根据频谱图理论来制定提问者的次要目标。特别是，图表的未连接部分必须以原则方式连接。我们展示了问题-对象邻接图的图拉普拉斯算子的特征值如何识别一组知识是否包含不连续的分量以及问题-对象邻接图的幂的零元素提供了一种识别这些问题的方法。我们使用情感描述任务来说明这种方法。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号