首页> 外国专利> Query expansion and query-document matching using path-constrained random walks

Query expansion and query-document matching using path-constrained random walks

机译:使用路径受限的随机游走进行查询扩展和查询文档匹配

摘要

Various technologies described herein pertain to use of path-constrained random walks for query expansion and/or query document matching. Clickthrough data from search logs is represented as a labeled and directed graph. Path-constrained random walks are executed over the graph based upon an input query. The graph includes a first set of nodes that represent queries included in the clickthrough data from search logs, a second set of nodes that represent documents included in the clickthrough data from the search logs, a third set of nodes that represent words from the queries and the documents, and edges between nodes that represent relationships between queries, documents, and words. The path-constrained random walks include traversals over edges of the graph between nodes. Further, a score for a relationship between a target node and a source node representative of the input query is computed based at least in part upon the path-constrained random walks.
机译:本文描述的各种技术涉及将路径受限的随机游走用于查询扩展和/或查询文档匹配。搜索日志中的点击数据表示为带标签的有向图。基于输入查询,在图上执行路径受限的随机游走。该图包括:第一组节点,代表来自搜索日志的点击数据中包含的查询;第二组节点,代表来自搜索日志的点击数据中包含的文档;第三组节点,代表来自查询日志的单词和文档以及代表查询,文档和单词之间关系的节点之间的边缘。路径受限的随机游走包括在节点之间的图形边缘上的遍历。此外,至少部分地基于路径受限的随机游走来计算目标节点与表示输入查询的源节点之间的关系的分数。

著录项

  • 公开/公告号US9286396B2

    专利类型

  • 公开/公告日2016-03-15

    原文格式PDF

  • 申请/专利权人 MICROSOFT CORPORATION;

    申请/专利号US201313951574

  • 发明设计人 JIANFENG GAO;GU XU;JINXI XU;

    申请日2013-07-26

  • 分类号G06F17/30;

  • 国家 US

  • 入库时间 2022-08-21 14:31:31

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号