arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1706.01574cs.IRcs.AI
收藏

基于贝叶斯非参数方法的搜索任务和子任务层次结构提取

Extracting Hierarchies of Search Tasks & Subtasks via a Bayesian Nonparametric Approach

University College London(伦敦大学学院);The Alan Turing Institute(艾伦·图灵研究所)

Rishabh Mehrotra, Emine Yilmaz

摘要:

大量的搜索查询源于一些现实世界的信息需求或任务。为了改善最终用户的搜索体验,重要的是要有准确的任务表示。因此,大量的研究已经致力于提取任务的适当表示,以便使搜索系统能够帮助用户完成他们的任务,以及为最终用户提供更好的查询建议,更好的推荐,满意度预测,并改善个性化的任务。大多数现有的任务提取方法集中在表示任务的平面结构。然而,任务通常倾向于有多个子任务与它们相关联,并且任务的更自然的表示将是层次结构,其中每个任务可以由多个(子)任务组成。为此,我们提出了一个有效的贝叶斯非参数模型提取层次结构的任务\&子任务。我们评估我们的方法的基础上,现实世界的查询日志数据,通过定量和众包实验,并强调考虑任务/子任务层次结构的重要性。

英文摘要:

A significant amount of search queries originate from some real world information need or tasks. In order to improve the search experience of the end users, it is important to have accurate representations of tasks. As a result, significant amount of research has been devoted to extracting proper representations of tasks in order to enable search systems to help users complete their tasks, as well as providing the end user with better query suggestions, for better recommendations, for satisfaction prediction, and for improved personalization in terms of tasks. Most existing task extraction methodologies focus on representing tasks as flat structures. However, tasks often tend to have multiple subtasks associated with them and a more naturalistic representation of tasks would be in terms of a hierarchy, where each task can be composed of multiple (sub)tasks. To this end, we propose an efficient Bayesian nonparametric model for extracting hierarchies of such tasks \& subtasks. We evaluate our method based on real world query log data both through quantitative and crowdsourced experiments and highlight the importance of considering task/subtask hierarchies.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑