首页> 外文会议>10th IEEE International Conference on Data Mining Workshops >Quantum Path Integral Inspired Query Sequence Suggestion for User Search Task Simplification
【24h】

Quantum Path Integral Inspired Query Sequence Suggestion for User Search Task Simplification

机译:简化用户搜索任务的量子路径积分启发式查询序列建议

获取原文

摘要

Query suggestion algorithms, which aim to suggest a set of similar but independent queries to users, have been widely studied to simplify user searches. However, in many cases, the users will accomplish their search tasks through a sequence of search behaviors instead of by one single query, which may make the classical query suggestion algorithms fail to satisfy end users in terms of task completion. In this paper, we propose a quantum path integral inspired algorithm for personalized user search behavior prediction, through which we can provide sequential query suggestions to assist the users complete their search tasks step by step. In detail, we consider the sequential search behavior of a user as a trajectory of a particle that moves in a query space. The query space is represented by a graph with each node is a query, which is named as query-path graph. Inspired by the quantum theorems, each edge in query-path graph is represented by both amplitude and phase respectively. Using this graph, we modify the quantum path integral algorithm to predict a userȁ9;s follow-up trajectory based on her behavioral history in this graph. We empirically show that the proposed algorithm can well predict the user search behavior and outperform classical query suggestion algorithms for user search task completion using the search log of a commercial search engine.
机译:查询建议算法旨在向用户建议一组相似但独立的查询,已经广泛研究以简化用户搜索。但是,在许多情况下,用户将通过一系列搜索行为而不是通过单个查询来完成其搜索任务,这可能使传统的查询建议算法无法在任务完成方面满足最终用户的需求。在本文中,我们提出了一种用于个性化用户搜索行为预测的量子路径积分启发算法,通过该算法,我们可以提供顺序查询建议,以帮助用户逐步完成搜索任务。详细地说,我们将用户的顺序搜索行为视为在查询空间中移动的粒子的轨迹。查询空间由一个图表示,每个节点都是一个查询,称为查询路径图。受量子定理的启发,查询路径图中的每个边分别由幅度和相位表示。使用该图,我们修改了量子路径积分算法,以根据用户在该图中的行为历史来预测用户的9跟踪轨迹。我们的经验表明,所提出的算法可以很好地预测用户的搜索行为,并且比使用商业搜索引擎的搜索日志完成用户搜索任务完成的经典查询建议算法要好。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号