会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 6. 发明申请
    • Query Intent in Information Retrieval
    • 信息检索中的查询意图
    • US20110289063A1
    • 2011-11-24
    • US12784869
    • 2010-05-21
    • Filip RadlinskiMartin SzummerNick Craswell
    • Filip RadlinskiMartin SzummerNick Craswell
    • G06F17/30G06F17/21
    • G06F17/30864G06Q30/00
    • Inferring query intent in information retrieval is described. In an example reformulations of an initial query by a user are used to create a query neighborhood. In the example, the query neighborhood is used to identify a set of possibly related queries. First and higher order reformulations of the initial query may be used to expand the query neighborhood. In an example precision can be improved by reducing the query neighborhood to more closely related queries for example, two queries can be connected if they are often clicked for the same document. In an example two queries can be connected using a random walk and all pairs of queries that are not connected by a random walk of less than a fixed threshold are removed. The connected queries can be used to form clusters and weights can be applied in order to determine the most likely related queries.
    • 描述信息检索中的查询意图。 在一个示例中,用户初始查询的重新组合用于创建查询邻域。 在该示例中,查询邻域用于标识一组可能相关的查询。 可以使用初始查询的第一和更高阶重新格式来扩展查询邻域。 在一个示例中,可以通过将查询邻域减少到更密切相关的查询来提高精度,例如,如果经常为同一文档点击,则可以连接两个查询。 在一个示例中,可以使用随机游走连接两个查询,并且去除不通过小于固定阈值的随机游走连接的所有查询对。 连接的查询可以用于形成群集,并且可以应用权重以便确定最可能的相关查询。
    • 8. 发明授权
    • Query intent in information retrieval
    • 查询信息检索意图
    • US08380723B2
    • 2013-02-19
    • US12784869
    • 2010-05-21
    • Filip RadlinskiMartin SzummerNick Craswell
    • Filip RadlinskiMartin SzummerNick Craswell
    • G06F17/30
    • G06F17/30864G06Q30/00
    • Inferring query intent in information retrieval is described. In an example reformulations of an initial query by a user are used to create a query neighborhood. In the example, the query neighborhood is used to identify a set of possibly related queries. First and higher order reformulations of the initial query may be used to expand the query neighborhood. In an example precision can be improved by reducing the query neighborhood to more closely related queries for example, two queries can be connected if they are often clicked for the same document. In an example two queries can be connected using a random walk and all pairs of queries that are not connected by a random walk of less than a fixed threshold are removed. The connected queries can be used to form clusters and weights can be applied in order to determine the most likely related queries.
    • 描述信息检索中的查询意图。 在一个示例中,用户初始查询的重新组合用于创建查询邻域。 在该示例中,查询邻域用于标识一组可能相关的查询。 可以使用初始查询的第一和更高阶重新格式来扩展查询邻域。 在一个示例中,可以通过将查询邻域减少到更密切相关的查询来提高精度,例如,如果经常为同一文档点击,则可以连接两个查询。 在一个示例中,可以使用随机游走连接两个查询,并且去除不通过小于固定阈值的随机游走连接的所有查询对。 连接的查询可以用于形成群集,并且可以应用权重以便确定最可能的相关查询。