专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明申请

US20070239702A1 Using connectivity distance for relevance feedback in search 有权
标题翻译：使用连接距离搜索相关反馈
公开(公告)号：US20070239702A1
公开(公告)日：2007-10-11
申请号：US11393480
申请日：2006-03-30
申请人： Serguei Vassilvitskii , Eric Brill
发明人： Serguei Vassilvitskii , Eric Brill
IPC分类号： G06F17/30
CPC分类号： G06F17/30864 , Y10S707/99933 , Y10S707/99934 , Y10S707/99935 , Y10S707/99936
摘要： A unique system and method is provided that facilitates improving relevance of search results over the initial searching ranking. The system and method involve obtaining relevancy feedback for at least one search result (user rated) and then generating a connectivity graph or web-graph (for Web searches) for the user rated result. The relative distance between results (or pages) in the graph can indicate relevancy between those results. Thus, results within a particular distance from the rated result can be considered related to the rated result and thus, relevant or irrelevant depending on the particular rating for that result. The connectivity graph can be employed to determine a re-ranking of the search results.
摘要翻译：提供了一种独特的系统和方法，其有助于提高搜索结果与初始搜索排名的相关性。该系统和方法包括获得至少一个搜索结果（用户评级）的相关性反馈，然后为用户评分结果生成连通性图或网络图（用于Web搜索）。图中的结果（或页面）之间的相对距离可以指示这些结果之间的相关性。因此，与额定结果特定距离的结果可以被认为与额定结果相关，因此，根据该结果的特定评级，相关或不相关。可以使用连通性图来确定搜索结果的重新排序。

2. 发明申请

US20100205213A1 NON-EXACT CACHE MATCHING 审中-公开
标题翻译：非精确缓存匹配
公开(公告)号：US20100205213A1
公开(公告)日：2010-08-12
申请号：US12370306
申请日：2009-02-12
申请人： Andrei Broder , Vanja Josifovski , Shanmugasundaram Ravikumar , Sandeep Pandey , Serguei Vassilvitskii , Flavio Chierichetti
发明人： Andrei Broder , Vanja Josifovski , Shanmugasundaram Ravikumar , Sandeep Pandey , Serguei Vassilvitskii , Flavio Chierichetti
IPC分类号： G06F17/30 , G06F12/08
CPC分类号： G06Q30/0251 , G06F16/24539 , G06Q10/06
摘要： The subject matter disclosed herein relates to returning cached object results based at least in part on a non-exact comparison with a query key.
摘要翻译：本文公开的主题涉及至少部分地基于与查询密钥的非精确比较来返回缓存的对象结果。

3. 发明申请

US20100094881A1 SYSTEM AND METHOD FOR INDEXING SUB-SPACES 审中-公开
标题翻译：用于索引子空间的系统和方法
公开(公告)号：US20100094881A1
公开(公告)日：2010-04-15
申请号：US12242748
申请日：2008-09-30
申请人： Chad Brower , Ramana Yerneni , Erik Vee , Serguei Vassilvitskii , Jayavel Shanmugasundaram
发明人： Chad Brower , Ramana Yerneni , Erik Vee , Serguei Vassilvitskii , Jayavel Shanmugasundaram
IPC分类号： G06F17/30 , G06Q30/00 , G06F7/08
CPC分类号： G06Q30/0241 , G06F16/9535 , G06Q30/02
摘要： The present invention is directed to systems and methods for identifying compatible advertisement contracts to satisfy an advertisement opportunity. The systems and methods include receiving a number of attribute values associated with a user accessing a network-based location. The systems and methods include sorting an index of lists for a plurality of advertisement contracts on the basis of a number of contract term values. The systems and methods include traversing the index of lists to return a set advertisement contracts compatible with the number of attribute values associated with the user. The systems and methods include selecting a given advertisement contract from the set of advertisement contracts compatible with the number of attribute values associated with the user. The systems and methods include presenting an advertisement associated with the given advertisement contract on a display viewable by the user accessing the network-based location.
摘要翻译：本发明涉及用于识别兼容的广告合同以满足广告机会的系统和方法。系统和方法包括接收与访问基于网络的位置的用户相关联的多个属性值。系统和方法包括基于合同项数量的数量来排序多个广告合同的列表索引。系统和方法包括遍历列表的索引以返回与与用户相关联的属性值的数量兼容的集合广告合同。系统和方法包括从与用户相关联的属性值的数量兼容的广告合同集合中选择给定的广告合同。所述系统和方法包括在由用户访问基于网络的位置可见的显示器上呈现与给定广告合同相关联的广告。

4. 发明申请

US20110166942A1 CONTRACT AUCTIONS FOR SPONSORED SEARCH 审中-公开
标题翻译：赞助搜索的合同拍卖
公开(公告)号：US20110166942A1
公开(公告)日：2011-07-07
申请号：US12683247
申请日：2010-01-06
申请人： Serguei Vassilvitskii , Sebastien Lahaie , Sharad Goel
发明人： Serguei Vassilvitskii , Sebastien Lahaie , Sharad Goel
IPC分类号： G06Q30/00 , G06Q20/00
CPC分类号： G06Q30/02 , G06Q30/0275 , G06Q30/08
摘要： Example methods, apparatuses, and articles of manufacture are disclosed that may be used to provide or otherwise support contract auctions for sponsored search advertising for use in auction management systems.
摘要翻译：公开了可用于提供或以其他方式支持用于拍卖管理系统中的赞助搜索广告的合同拍卖的示例性方法，装置和制品。

5. 发明申请

US20100082404A1 SYSTEM AND METHOD FOR UTILIZING DATE CONSTRAINTS IN AN ADVERTISEMENT SERVING SYSTEM 审中-公开
标题翻译：在广告服务系统中使用日期约束的系统和方法
公开(公告)号：US20100082404A1
公开(公告)日：2010-04-01
申请号：US12242628
申请日：2008-09-30
申请人： Chad Brower , Ramana Yerneni , Erik Vee , Serguei Vassilvitskii , Jayavel Shanmugasundaram
发明人： Chad Brower , Ramana Yerneni , Erik Vee , Serguei Vassilvitskii , Jayavel Shanmugasundaram
IPC分类号： G06Q10/00 , G06Q50/00
CPC分类号： G06Q30/02 , G06Q30/0244 , G06Q30/0254
摘要： Generally, embodiments of the present invention provide for methods, systems and computer program products for utilizing date constraints in an advertisement serving system. The method according to one embodiment of the present invention comprises receiving a request for one or more advertisements that satisfy one or more constraints. A set of advertisement contracts is generated, wherein the set of advertisement contracts comprise one or more advertisement contracts that satisfy the one or more constraints. The contractual time period for a given advertisement contract in the set of advertisement contracts is then determined. A subset of advertisement contracts is then generated, wherein the subset of advertisement contracts comprises the advertisement contracts in the set of advertisement contracts that are active on a given date. The subset of advertisement contracts is then inputted into an optimization algorithm and one or more advertisement contracts are selected by the optimization algorithm.
摘要翻译：通常，本发明的实施例提供了用于在广告服务系统中利用日期约束的方法，系统和计算机程序产品。根据本发明的一个实施例的方法包括接收对满足一个或多个约束的一个或多个广告的请求。生成一组广告合同，其中广告合同集合包括满足一个或多个约束的一个或多个广告合同。然后确定该组广告合同中的给定广告合同的合同期限。然后生成广告合同的子集，其中广告合同的子集包括在给定日期活跃的一组广告合同中的广告合同。然后将广告合同的子集输入优化算法，并通过优化算法选择一个或多个广告合同。

6. 发明授权

US07634474B2 Using connectivity distance for relevance feedback in search 有权
标题翻译：使用连接距离搜索相关反馈
公开(公告)号：US07634474B2
公开(公告)日：2009-12-15
申请号：US11393480
申请日：2006-03-30
申请人： Serguei Vassilvitskii , Eric D. Brill
发明人： Serguei Vassilvitskii , Eric D. Brill
IPC分类号： G06F17/30
CPC分类号： G06F17/30864 , Y10S707/99933 , Y10S707/99934 , Y10S707/99935 , Y10S707/99936
摘要： A unique system and method is provided that facilitates improving relevance of search results over the initial searching ranking. The system and method involve obtaining relevancy feedback for at least one search result (user rated) and then generating a connectivity graph or web-graph (for Web searches) for the user rated result. The relative distance between results (or pages) in the graph can indicate relevancy between those results. Thus, results within a particular distance from the rated result can be considered related to the rated result and thus, relevant or irrelevant depending on the particular rating for that result. The connectivity graph can be employed to determine a re-ranking of the search results.
摘要翻译：提供了一种独特的系统和方法，其有助于提高搜索结果与初始搜索排名的相关性。该系统和方法包括获得至少一个搜索结果（用户评级）的相关性反馈，然后为用户评分结果生成连通性图或网络图（用于Web搜索）。图中的结果（或页面）之间的相对距离可以指示这些结果之间的相关性。因此，与额定结果特定距离的结果可以被认为与额定结果相关，因此，根据该结果的特定评级，相关或不相关。可以使用连通性图来确定搜索结果的重新排序。

7. 发明申请

US20100082607A1 SYSTEM AND METHOD FOR AGGREGATING A LIST OF TOP RANKED OBJECTS FROM RANKED COMBINATION ATTRIBUTE LISTS USING AN EARLY TERMINATION ALGORITHM 审中-公开
标题翻译：使用早期终止算法从排名合并属性列表中聚集顶级排名对象列表的系统和方法
公开(公告)号：US20100082607A1
公开(公告)日：2010-04-01
申请号：US12238401
申请日：2008-09-25
申请人： Kunal Punera , Shanmugasundaram Ravikumar , Torsten Suel , Serguei Vassilvitskii
发明人： Kunal Punera , Shanmugasundaram Ravikumar , Torsten Suel , Serguei Vassilvitskii
IPC分类号： G06F7/10 , G06F17/30
CPC分类号： G06F16/358 , G06F16/9535
摘要： An improved system and method for aggregating a list of top ranked objects from ranked combination lists using an early termination algorithm is provided. Ranked lists of individual object attributes may be aggregated into ranked lists of combination object attributes. The ranked lists of object attributes, including ranked lists of individual object attributes as well as ranked lists of combination object attributes, may be scanned in parallel. A fixed number of top scoring objects may be stored in a results list of top ranked objects. An upper bound of best possible aggregation scores of unseen object in the ranked lists of object attributes may be computed to incorporate the extra information given by the combination lists of attributes. If the upper bound computed is less than the score of top scoring objects in the results list, then the top scoring objects in the results list may be output.
摘要翻译：提供了一种改进的系统和方法，用于使用早期终止算法聚合来自排名组合列表的顶级对象的列表。单个对象属性的排名列表可以聚合成组合对象属性的排名列表。可以平行扫描对象属性的排名列表，包括单个对象属性的排名列表以及组合对象属性的排名列表。固定数量的顶级评分对象可以存储在排名最高的对象的结果列表中。可以计算排序的对象属性列表中未被看见的对象的最佳可能聚集分数的上限，以包含属性组合列表给出的额外信息。如果计算的上限小于结果列表中的最高评分对象的得分，则可以输出结果列表中的最高评分对象。

8. 发明申请

US20100082412A1 SYSTEM AND METHOD FOR OPTIMIZING AN ADVERTISEMENT PLAN FOR ALLOCATING ADVERTISEMENTS TO A CONTRACT IN A NETWORK-BASED ENVIRONMENT 审中-公开
标题翻译：用于优化广告计划的系统和方法，用于将广告分配给基于网络的环境中的合同
公开(公告)号：US20100082412A1
公开(公告)日：2010-04-01
申请号：US12242696
申请日：2008-09-30
申请人： Chad Brower , Ramana Yerneni , Erik Vee , Serguei Vassilvitskii , Jayavel Shanmugasundaram , Danny Zhang , Srinivasan Rajagopal
发明人： Chad Brower , Ramana Yerneni , Erik Vee , Serguei Vassilvitskii , Jayavel Shanmugasundaram , Danny Zhang , Srinivasan Rajagopal
IPC分类号： G06Q30/00
CPC分类号： G06Q30/02 , G06Q30/0241
摘要： The present invention is directed to a system and method for optimizing an advertisement plan for allocating advertisements to a contract in a network-based environment. The system and method includes determining a shadow price for an advertisement placement where the advertisement placement is associated with a user having defined characteristics. The system and method includes determining a contract price for the advertisement placement relative to a plurality of advertisement contracts for the user having the defined characteristics. The system and method includes determining an advertisement plan for allocating an advertisement to a given contract on the basis of the shadow price and the contract price. The system and method includes presenting a given advertisement associated with the given contract according to the advertisement plan on network-based output.
摘要翻译：本发明涉及一种用于在基于网络的环境中优化用于将广告分配给合同的广告计划的系统和方法。该系统和方法包括确定广告位置的影子价格，其中广告位置与具有定义的特征的用户相关联。该系统和方法包括为具有所定义特征的用户确定相对于多个广告合同的广告展示的合同价格。该系统和方法包括根据阴影价格和合同价格确定用于向给定合同分配广告的广告计划。系统和方法包括根据基于网络的输出的广告计划呈现与给定合同相关联的给定广告。

9. 发明申请

US20100082399A1 SYSTEMS AND METHODS FOR DISTRIBUTING ADVERTISEMENTS IN A NETWORK-BASED ENVIRONMENT 审中-公开
标题翻译：在网络环境中分配广告的系统和方法
公开(公告)号：US20100082399A1
公开(公告)日：2010-04-01
申请号：US12240549
申请日：2008-09-29
申请人： Arpita Ghosh , Serguei Vassilvitskii
发明人： Arpita Ghosh , Serguei Vassilvitskii
IPC分类号： G06F17/30 , G06Q30/00 , G06Q40/00 , G06Q10/00 , G06Q90/00
CPC分类号： G06Q30/02 , G06Q30/0247 , G06Q30/0255 , G06Q30/0275 , G06Q40/04
摘要： The present invention is directed to a system and method for distributing advertisements in a network-based advertisement campaign. The method and system includes determining a number of advertisement placements for a contract within a contract time interval where the advertisement placements may be presented to users having defined characteristics. The method and system includes reviewing forecasting information regarding user traffic, including forecasting information for predicting a volume of users having the defined characteristics. The method and system includes, in response to the forecasting information, procuring advertisement placements consistent with the contract during the contract time interval and distributing the advertisements in a network-based output.
摘要翻译：本发明涉及一种用于在基于网络的广告活动中分发广告的系统和方法。所述方法和系统包括在合同时间间隔内确定合同的广告布置的数量，其中可以向具有定义的特征的用户呈现广告布局。该方法和系统包括查看关于用户业务的预测信息，包括用于预测具有所定义特征的用户量的预测信息。该方法和系统包括响应于预测信息，在合同时间间隔期间采购与合同一致的广告布局，并将广告分布在基于网络的输出中。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式