会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • 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.
    • 描述信息检索中的查询意图。 在一个示例中,用户初始查询的重新组合用于创建查询邻域。 在该示例中,查询邻域用于标识一组可能相关的查询。 可以使用初始查询的第一和更高阶重新格式来扩展查询邻域。 在一个示例中,可以通过将查询邻域减少到更密切相关的查询来提高精度,例如,如果经常为同一文档点击,则可以连接两个查询。 在一个示例中,可以使用随机游走连接两个查询,并且去除不通过小于固定阈值的随机游走连接的所有查询对。 连接的查询可以用于形成群集,并且可以应用权重以便确定最可能的相关查询。
    • 2. 发明申请
    • 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.
    • 描述信息检索中的查询意图。 在一个示例中,用户初始查询的重新组合用于创建查询邻域。 在该示例中,查询邻域用于标识一组可能相关的查询。 可以使用初始查询的第一和更高阶重新格式来扩展查询邻域。 在一个示例中,可以通过将查询邻域减少到更密切相关的查询来提高精度,例如,如果经常为同一文档点击,则可以连接两个查询。 在一个示例中,可以使用随机游走连接两个查询,并且去除不通过小于固定阈值的随机游走连接的所有查询对。 连接的查询可以用于形成群集,并且可以应用权重以便确定最可能的相关查询。
    • 7. 发明申请
    • Using Aggregate Location Metadata to Provide a Personalized Service
    • 使用聚合位置元数据提供个性化服务
    • US20120317104A1
    • 2012-12-13
    • US13158483
    • 2011-06-13
    • Filip RadlinskiPaul N. BennettRyen W. WhiteEmine Yilmaz
    • Filip RadlinskiPaul N. BennettRyen W. WhiteEmine Yilmaz
    • G06F17/30G06F15/18
    • G06F16/9535G06F16/9537
    • Functionality is described herein which generates a plurality of item models based on the aggregate behavior of users, such as the aggregate behavior of the users in selecting network-accessible sites and/or issuing particular queries. In one implementation, each item model estimates a probabilistic distribution of locations for an individual, given that the individual selects a particular item (e.g., a particular site or query). The functionality can use the item models to provide a personalized service to an end user. For example, in one scenario, the functionality can generate a plurality of location-based features based on the item models. The functionality can then learn a ranking model based on the location-based features. In a real-time phase of operation, a query processing system uses the ranking model to personalize search results for an end user.
    • 这里描述了基于用户的聚合行为(例如用户选择网络可访问站点和/或发出特定查询的聚合行为)生成多个项目模型的功能。 在一个实现中,假定个人选择特定项目(例如,特定站点或查询),每个项目模型估计个体的位置的概率分布。 功能可以使用项目模型为最终用户提供个性化服务。 例如,在一种情况下,功能可以基于项目模型生成多个基于位置的特征。 然后,功能可以基于基于位置的功能来学习排名模型。 在实时操作阶段,查询处理系统使用排名模型来个性化最终用户的搜索结果。
    • 9. 发明授权
    • Measuring duplication in search results
    • 测量搜索结果中的重复
    • US08825641B2
    • 2014-09-02
    • US12942553
    • 2010-11-09
    • Filip RadlinskiPaul Nathan BennettEmine Yilmaz
    • Filip RadlinskiPaul Nathan BennettEmine Yilmaz
    • G06F17/30
    • G06F17/30G06F17/30696G06F17/30864
    • Measuring duplication in search results is described. In one example, duplication between a pair of results provided by an information retrieval system in response to a query is measured. History data for the information retrieval system is accessed and query data retrieved, which describes the number of times that users have previously selected either or both of the pair of results, and a relative presentation sequence of the pair of results when displayed at each selection. From the query data, a fraction of user selections is determined in which a predefined combination of one or both of the pair of results were selected for a predefined presentation sequence. From the fraction, a measure of duplication between the pair of results is found. In further examples, the information retrieval system uses the measure of duplication to determine an overall redundancy value for a result set, and controls the result display accordingly.
    • 描述了搜索结果中的重复测量。 在一个示例中,测量由信息检索系统响应于查询提供的一对结果之间的重复。 访问信息检索系统的历史数据,并且检索查询数据,该数据描述了用户先前选择了该对结果中的一个或两个的次数,以及在每次选择时显示该对结果的相对呈现序列。 从查询数据中,确定一小部分用户选择,其中针对预定义的呈现序列选择了一对或两者的预定组合。 从分数中可以发现一对结果之间的重复度。 在其他示例中,信息检索系统使用复制度来确定结果集的总体冗余度值,并相应地控制结果显示。