会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 24. 发明申请
    • SYSTEM AND METHOD FOR FINDING UNEXPECTED, BUT RELEVANT CONTENT IN AN INFORMATION RETRIEVAL SYSTEM
    • 发现信息检索系统的系统和方法,但相关内容
    • US20110179019A1
    • 2011-07-21
    • US12688364
    • 2010-01-15
    • Sihem Amer-YahiaSergei VassilvitskiiCong Yu
    • Sihem Amer-YahiaSergei VassilvitskiiCong Yu
    • G06F17/30
    • G06F17/30867
    • An improved method for information retrieval in web query and recommendation systems, where items that are likely unfamiliar to the users of the system, but potentially relevant, are recommended. In a recommendation system having ratings by a plurality of users for a plurality of items, items are assigned to one or more data regions based on item attributes or user activity. Source regions are identified for each of the data regions. For a given user, data regions with which both the user and the user's social network are unfamiliar are identified. Within a given data region, the relevance of items to the user within such regions is evaluated using ratings provided by other users who have entered ratings similar to the user in source regions for the data region. Items receiving the highest relevance score are recommended to the user.
    • 一种改进的Web查询和推荐系统中的信息检索方法,推荐系统用户可能不熟悉的项目。 在具有用于多个项目的多个用户的评级的推荐系统中,基于项目属性或用户活动将项目分配给一个或多个数据区域。 为每个数据区域识别源区域。 对于给定的用户,识别用户和用户的社交网络不熟悉的数据区域。 在给定的数据区域内,使用在数据区域的源区域中输入与用户类似的评级的其他用户提供的评级来评估项目对这些区域内的用户的相关性。 建议用户接收到最高相关性分数的项目。
    • 26. 发明申请
    • EXTENDED GENERALIZED SECOND PRICE AUCTION FOR SPONSORED SEARCH WITH RESERVE PRICES
    • 扩展的第二次价格拍卖,用于保留价格的赞助搜索
    • US20100125506A1
    • 2010-05-20
    • US12274464
    • 2008-11-20
    • Sergei VassilvitskiiColin BradyRica Gonen
    • Sergei VassilvitskiiColin BradyRica Gonen
    • G06Q30/00
    • G06Q30/08G06Q30/02G06Q30/0273G06Q30/0601
    • Search engines and sponsored search auctions are provided that enable the use of different reserve prices corresponding to different advertisement slots on a search results page. In one implementation, a search engine includes a query processor and a sponsored search auction. The query processor is configured to receive a query from an electronic device associated with a user, to determine a plurality of reserve prices corresponding to a plurality of advertisement slots of a search results page, and to determine a plurality of bid prices for the advertisement slots of the search results page corresponding to a plurality of bidders. The sponsored search auction is configured to allocate a bidder or a null (e.g., no advertisement) to each advertisement slot of the search results page, taking into account the plurality of reserve prices associated with the advertisement slots of the search results page.
    • 提供搜索引擎和赞助商搜索拍卖,可以在搜索结果页面上使用与不同广告位相对应的不同预留价格。 在一个实现中,搜索引擎包括查询处理器和赞助的搜索拍卖。 查询处理器被配置为从与用户相关联的电子设备接收查询,以确定对应于搜索结果页面的多个广告时隙的多个预留价格,并且确定广告时隙的多个投标价格 对应于多个投标者的搜索结果页面。 赞助搜索拍卖被配置为考虑到与搜索结果页面的广告时隙相关联的多个预留价格,将搜索者或搜索结果页面的每个广告时段的空值(例如,无广告)分配。
    • 28. 发明申请
    • Learning Accounts
    • 学习帐户
    • US20130268374A1
    • 2013-10-10
    • US13441672
    • 2012-04-06
    • Kishore PapineniPreston McAfeeJohn LangfordSergei Vassilvitskii
    • Kishore PapineniPreston McAfeeJohn LangfordSergei Vassilvitskii
    • G06Q30/02
    • G06Q30/02
    • Techniques are provided for use in an auction in which selected content items, or advertisements, of content providers, or advertisers, are selected and served, and in which, for an item served in response to a serving opportunity, contingent upon occurrence of a specified user action, an associated provider's account is charged a first sum and an associated publisher's account is credited a second sum. Performance of particular content items may be explored, such as ones for which little or no historical performance information may be available. Content item selection may be based at least in part on an objective of acquiring learning information that can be used in prediction of future performance of the content item. The associated provider's account may be charged a sum that reflects a learning value component, but the associated publisher's account may be credited a sum that does not reflect a learning value component.
    • 技术被提供用于拍卖中,其中内容提供商或广告商的所选择的内容项目或广告被选择和服务,并且其中针对响应于服务机会而服务的项目,取决于发生指定的 用户操作,相关联的提供商的帐户将收取第一笔款项,相关联的发布商的帐户将被记入第二笔款项。 可以探索特定内容项目的性能,例如可能没有或没有历史性能信息可用的性能。 内容项目选择可以至少部分地基于获取可用于预测内容项目的未来表现的学习信息的目标。 相关提供商的帐户可能会收取一笔反映学习价值组成部分的金额,但相关发布商的帐户可能会记入不反映学习价值组成部分的金额。
    • 29. 发明授权
    • System and method for finding unexpected, but relevant content in an information retrieval system
    • 在信息检索系统中发现意外但相关内容的系统和方法
    • US08204878B2
    • 2012-06-19
    • US12688364
    • 2010-01-15
    • Sihem Amer-YahiaSergei VassilvitskiiCong Yu
    • Sihem Amer-YahiaSergei VassilvitskiiCong Yu
    • G06F17/30
    • G06F17/30867
    • An improved method for information retrieval in web query and recommendation systems, where items that are likely unfamiliar to the users of the system, but potentially relevant, are recommended. In a recommendation system having ratings by a plurality of users for a plurality of items, items are assigned to one or more data regions based on item attributes or user activity. Source regions are identified for each of the data regions. For a given user, data regions with which both the user and the user's social network are unfamiliar are identified. Within a given data region, the relevance of items to the user within such regions is evaluated using ratings provided by other users who have entered ratings similar to the user in source regions for the data region. Items receiving the highest relevance score are recommended to the user.
    • 一种改进的Web查询和推荐系统中的信息检索方法,推荐系统用户可能不熟悉的项目。 在具有用于多个项目的多个用户的评级的推荐系统中,基于项目属性或用户活动将项目分配给一个或多个数据区域。 为每个数据区域识别源区域。 对于给定的用户,识别用户和用户的社交网络不熟悉的数据区域。 在给定的数据区域内,使用在数据区域的源区域中输入与用户类似的评级的其他用户提供的评级来评估项目对这些区域内的用户的相关性。 建议用户接收到最高相关性分数的项目。
    • 30. 发明授权
    • Learning-based strategies for message-initiated constraint-based routing
    • 基于消息发起的基于约束的路由的基于学习的策略
    • US07577108B2
    • 2009-08-18
    • US10453174
    • 2003-06-03
    • Ying ZhangMarkus P. J. FromherzYi ShangSergei VassilvitskiiLara S. Crawford
    • Ying ZhangMarkus P. J. FromherzYi ShangSergei VassilvitskiiLara S. Crawford
    • H04L12/28
    • H04L45/16H04L45/08H04L45/12H04L45/123Y10S370/913
    • A method is presented for a learning-based strategy utilized within message-initiated constraint-based routing for digital message communication among nodes in an ad-hoc network, in which each node includes attributes. The method includes determining local attributes for each of the nodes and defining constraints on the attributes. Each node is provided access to the attributes of each neighboring node. Each message transmitted over the network has a message type, which includes a destination specification, route specification, and objective specification. Constraint checking and cost estimation checking are performed for each message type. Cost estimation is utilized to converge on an optimal message path. The message that is routed within the network includes the address of a sending node, the address of the source node, route constraints, destination constraints, the number of route constraints, the number of destination constraints, message identification number, sequence identification number, and routing objectives.
    • 提出了一种在消息发起的基于约束的路由中用于在ad-hoc网络中的节点之间的数字消息通信中使用的基于学习的策略的方法,其中每个节点包括属性。 该方法包括确定每个节点的本地属性并且定义关于属性的约束。 提供每个节点访问每个相邻节点的属性。 通过网络发送的每个消息都有一个消息类型,其中包括目的地规范,路由规范和客观规范。 对每种消息类型执行约束检查和成本估算检查。 成本估算用于收敛于最佳消息路径。 在网络中路由的消息包括发送节点的地址,源节点的地址,路由约束,目的约束,路由约束的数量,目的约束的数量,消息标识号,序列识别号和 路由目标。