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

1. 发明申请

US20100250332A1 System and Method for Adaptive Bidding for Display Advertising 审中-公开
标题翻译：自适应招标展示广告系统和方法
公开(公告)号：US20100250332A1
公开(公告)日：2010-09-30
申请号：US12414166
申请日：2009-03-30
申请人： Arpita Ghosh , Benjamin I.P. Rubinstein , Sergei Vassilvitskii , Martin Zinkevich
发明人： Arpita Ghosh , Benjamin I.P. Rubinstein , Sergei Vassilvitskii , Martin Zinkevich
IPC分类号： G06Q30/00 , G06N5/02
CPC分类号： G06Q30/08 , G06Q30/02 , G06Q30/0242 , G06Q30/0249 , G06Q30/0275 , G06Q30/0601
摘要： A system for performing adaptive bidding to secure Internet advertising impressions in an auction. Included are systems for analyzing advertising campaign objectives, including a campaign period, a target number of impressions, a target budget. An exemplary technique defines a bidding agent for performing the adaptive bidding seeking the minimum target spending of the budget. Objective results of the campaign such as average cost per won impression, total campaign duration relative to desired campaign period, and total expenditure relative to campaign budget can be optimized based on an empirically determined forecast. Techniques for adapting bids include statistically modeling winning bids during an exploration bidding phase, performing iterations for adjustment of the bid amounts using learn-while-bid adaptive bidding, learn-then-bid adaptive bidding, and guess-double-adjust adaptive bidding. Bidding tactics, especially those used to identify a minimum target bid and a maximum target bid used in bidding on an exchange are employed, and the results analyzed using statistical models.
摘要翻译：用于执行自适应出价以在竞价中保护互联网广告印象的系统。包括用于分析广告活动目标的系统，包括广告系列期间，目标数量的展示次数，目标预算。一个示例性技术定义了一个投标代理，用于执行适应性投标，寻求预算的最低目标支出。根据经验确定的预测，可以优化运动的客观结果，例如平均每赢得印象的成本，相对于期望的活动期间的总活动持续时间以及相对于活动预算的总支出。适应投标的技术包括在勘探招标阶段统计建模中标，通过学习 - 竞标自适应竞标，学习竞标自适应竞标，猜测双重调整自适应竞价，进行迭代调整投标金额。采用招标策略，特别是用于确定最低目标出价的标书和用于交易所投标的最高目标出价，并采用统计模型分析结果。

2. 发明申请

US20100082393A1 DISPLAY ADVERTISING CONTRACT PRICING 审中-公开
标题翻译：显示广告合同价格
公开(公告)号：US20100082393A1
公开(公告)日：2010-04-01
申请号：US12242820
申请日：2008-09-30
申请人： Sergei Vassilvitskii , Jayavel Shanmugasundaram , R. Preston McAfee , Arpita Ghosh , Erik N. Vee
发明人： Sergei Vassilvitskii , Jayavel Shanmugasundaram , R. Preston McAfee , Arpita Ghosh , Erik N. Vee
IPC分类号： G06F17/30
CPC分类号： G06Q30/02 , G06Q30/0217 , G06Q30/0273
摘要： Example embodiments described herein may relate to pricing contracts for a display advertising system utilized, for example, in Web-based advertising.
摘要翻译：本文描述的示例性实施例可以涉及例如在基于Web的广告中使用的显示广告系统的定价合同。

3. 发明申请

US20110270676A1 Probabilistic Linking Approach for Serving Impressions in Guaranteed Delivery Advertising 审中-公开
标题翻译：在保证投放广告中提供展示的概率链接方法
公开(公告)号：US20110270676A1
公开(公告)日：2011-11-03
申请号：US12771196
申请日：2010-04-30
申请人： Sergei Vassilvitskii , Jayavel Shanmugasundaram , Sumanth Jagannath , Erik Vee , Martin Zinkevich
发明人： Sergei Vassilvitskii , Jayavel Shanmugasundaram , Sumanth Jagannath , Erik Vee , Martin Zinkevich
IPC分类号： G06Q30/00 , G06N5/02
CPC分类号： G06Q30/02 , G06Q30/0251
摘要： A computer-implemented method and display advertising server network for serving impression opportunities to a frequency-capped guaranteed delivery contract in a system for delivery of display advertising to a user. The method includes steps for receiving, from a computer, an event predicate and a user ID corresponding to the user, retrieving, from an index engine, a set of eligible frequency-capped contracts, wherein an eligible contract comprises at least one target predicate matching at least a portion of the event predicate, and probabilistically selecting for serving, in a computer, the booked contract having a frequency cap specification, only when the selected frequency-capped contract can be served to the user without violating the frequency cap specification. Exemplary embodiments include generating a pseudo-random number sequence, and then selecting a particular pseudo-random number from the series of pseudo-random numbers, the selected particular pseudo-random number being based on the user ID, a visit count, a URL.
摘要翻译：一种计算机实现的方法和显示广告服务器网络，用于向系统中的用于向用户传送显示广告的频率上限的保证递送合同提供展示机会。该方法包括从计算机接收与用户相对应的事件谓词和用户ID的步骤，从索引引擎检索一组合格的频率上限合同，其中符合条件的合同包括至少一个目标谓词匹配至少部分事件谓词，并且在计算机中概率地选择用于服务具有频率上限规范的预约合同，只有当所选择的频率上限的合同可以在不违反频率上限规范的情况下被提供给用户时。示例性实施例包括生成伪随机数序列，然后从所述一系列伪随机数中选择特定的伪随机数，所选择的特定伪随机数基于用户ID，访问次数，URL。

4. 发明申请

US20100185485A1 ALLOCATION OF INTERNET ADVERTISING INVENTORY 审中-公开
标题翻译：互联网广告分类
公开(公告)号：US20100185485A1
公开(公告)日：2010-07-22
申请号：US12355371
申请日：2009-01-16
申请人： Erik Vee , Donald Swanson , Jayavel Shanmugasundaram , Mark Sordo , Srinivasan Rajagopal , Martin Zinkevich , Sergei Vassilvitskii
发明人： Erik Vee , Donald Swanson , Jayavel Shanmugasundaram , Mark Sordo , Srinivasan Rajagopal , Martin Zinkevich , Sergei Vassilvitskii
IPC分类号： G06Q30/00 , G06Q10/00
CPC分类号： G06Q30/02 , G06Q30/0251 , G06Q30/0254
摘要： A method and system for allocating inventory in an Internet environment is provided. A method employed by the system may include generating samples of representatives that represent impression inventory, where each sample represents a number of users to which impressions are deliverable. An order may be received. The order may include a number of impressions to book and target audience information. A cushion of impressions needed to guarantee delivery of the number of impressions ordered may be determined. The number of impressions ordered plus the cushion may be allocated from the samples. A contract including the target audience information, the number of impressions, and the cushion may be stored to a database.
摘要翻译：提供了一种用于在因特网环境中分配库存的方法和系统。系统使用的方法可以包括生成代表展示广告资源的代表的样本，其中每个样本表示可展示展示的用户数量。可能会收到订单。该订单可能包含许多展示以预订和定位受众群体信息。可以确定为保证交付订购的展示次数所需的印象缓冲。可以从样品中分配订购的印象数以及缓冲。可以将包含目标受众信息，展示次数和缓冲的合同存储到数据库。

5. 发明申请

US20110246307A1 Mass-Based Approach for Serving Impressions in Guaranteed Delivery Advertising 审中-公开
标题翻译：在保证投放广告中提供印象的基于质量的方法
公开(公告)号：US20110246307A1
公开(公告)日：2011-10-06
申请号：US12751693
申请日：2010-03-31
申请人： Martin Zinkevich , Jayavel Shanmugasundaram , Sergei Vassilvitskii , Erik Vee
发明人： Martin Zinkevich , Jayavel Shanmugasundaram , Sergei Vassilvitskii , Erik Vee
IPC分类号： G06Q30/00
CPC分类号： G06Q30/0264 , G06Q30/02
摘要： A computer-implemented Internet advertising method for serving impression opportunities in a system for delivery of display advertising. The likelihood that a booked contract could be served by a future forecasted user visit is calculated as a probability mass, and associated with the booked contract. The relative sizes of the probability masses of a plurality of eligible contracts is used as a selector in conjunction with a selected pseudo-random number. In exemplary embodiments, a server is configured for receiving an event predicate as a result of a user visit to a web site. Based on the received event predicate, a set of eligible contracts is assembled. Each eligible contract is assigned to exactly one interval selected from a range, the size of the interval corresponding to the probability mass of the eligible contract. The generated pseudo-random number is used for selecting an interval, which operation selects an eligible advertisement for display.
摘要翻译：一种用于在用于传送显示广告的系统中的印象机会的计算机实现的互联网广告方法。未来预测的用户访问可能提供预订合同的可能性计算为概率质量，并与预定的合同相关联。将多个合格契约的概率质量的相对大小与所选择的伪随机数一起用作选择器。在示例性实施例中，服务器被配置为作为用户访问网站的结果来接收事件谓词。根据收到的事件谓词，汇总了一组符合条件的合同。每个符合条件的合同都被分配到从一个范围中选择的一个间隔，该范围是与合格合同的概率质量相对应的间隔的大小。生成的伪随机数用于选择间隔，该间隔选择合格的广告进行显示。

6. 发明申请

US20100318432A1 ALLOCATION OF INTERNET ADVERTISING INVENTORY 审中-公开
标题翻译：互联网广告分类
公开(公告)号：US20100318432A1
公开(公告)日：2010-12-16
申请号：US12482198
申请日：2009-06-10
申请人： Martin Zinkevich , Deepak K. Agarwal , Erik Vee , Peiji Chen , Long Ji Lin , Danny Zhang , Sergei Vassilvitskii , Jayavel Shanmugasundaram , Ramana Yerneni
发明人： Martin Zinkevich , Deepak K. Agarwal , Erik Vee , Peiji Chen , Long Ji Lin , Danny Zhang , Sergei Vassilvitskii , Jayavel Shanmugasundaram , Ramana Yerneni
IPC分类号： G06Q30/00
CPC分类号： G06Q30/0241 , G06Q30/02 , G06Q30/0275
摘要： A method for allocating inventory in a networked environment includes receiving a request to purchase a number of display impressions, the request including targeting parameters and a frequency constraint corresponding to a maximum number of times the advertisement can be displayed to a user. The method also includes allocating the requested number of display impressions across a set of user samples, where the number of impressions allocated to any one user sample in the set of user samples is constrained by the frequency constraint. Allocation information that defines how the impressions are allocated among the user samples is stored to a user sample database.
摘要翻译：一种用于在联网环境中分配库存的方法包括：接收购买多个显示印象的请求，所述请求包括目标参数和对应于广告可以向用户显示的最大次数的频率约束。该方法还包括在一组用户样本中分配所请求的显示展示次数，其中分配给该组用户样本中的任何一个用户样本的展示次数受到频率约束的约束。定义如何在用户样本之间分配展示的分配信息被存储到用户样本数据库。

7. 发明申请

US20130166395A1 SYSTEM AND METHOD FOR CREATING A DELIVERY ALLOCATION PLAN IN A NETWORK-BASED ENVIRONMENT 审中-公开
标题翻译：在基于网络的环境中创建交付分配计划的系统和方法
公开(公告)号：US20130166395A1
公开(公告)日：2013-06-27
申请号：US13333241
申请日：2011-12-21
申请人： Sergei Vassilvitskii , Chandrashekhar Nagarajan , Peiji Chen , Jian Yang , John Tomlin , Vijay Bharadwaj , Erik Vee , WenJing Ma
发明人： Sergei Vassilvitskii , Chandrashekhar Nagarajan , Peiji Chen , Jian Yang , John Tomlin , Vijay Bharadwaj , Erik Vee , WenJing Ma
IPC分类号： G06Q30/02
CPC分类号： G06Q30/0244
摘要： The present application provides systems and corresponding methods for creating a delivery allocation plan in a network-based environment. The methods may include receiving and storing advertising contracts and data related to the advertising contracts; constructing a bipartite graph based on the received contract data; annotating each demand node; and receiving impression data and other eligible contract data. Thereafter, the method may include for each impression, calculating a first supply value and for each contract, calculating a first demand value. The first demand value may be used to calculate a second supply value and a delivery allocation may be calculated using the second supply value and the second demand value for each contract.
摘要翻译：本申请提供在基于网络的环境中创建传送分配计划的系统和相应方法。方法可以包括接收和存储与广告合同相关的广告合同和数据; 基于收到的合同数据构建二分图; 注释每个需求节点; 并接收展示数据和其他合格的合同数据。此后，该方法可以包括对于每个印象，计算第一供应值，并且对于每个合约，可以计算第一需求值。可以使用第一需求值来计算第二供应值，并且可以使用第二供应值和每个合同的第二需求值来计算交货分配。

8. 发明申请

US20110179019A1 SYSTEM AND METHOD FOR FINDING UNEXPECTED, BUT RELEVANT CONTENT IN AN INFORMATION RETRIEVAL SYSTEM 有权
标题翻译：发现信息检索系统的系统和方法，但相关内容
公开(公告)号：US20110179019A1
公开(公告)日：2011-07-21
申请号：US12688364
申请日：2010-01-15
申请人： Sihem Amer-Yahia , Sergei Vassilvitskii , Cong Yu
发明人： Sihem Amer-Yahia , Sergei Vassilvitskii , Cong Yu
IPC分类号： G06F17/30
CPC分类号： 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查询和推荐系统中的信息检索方法，推荐系统用户可能不熟悉的项目。在具有用于多个项目的多个用户的评级的推荐系统中，基于项目属性或用户活动将项目分配给一个或多个数据区域。为每个数据区域识别源区域。对于给定的用户，识别用户和用户的社交网络不熟悉的数据区域。在给定的数据区域内，使用在数据区域的源区域中输入与用户类似的评级的其他用户提供的评级来评估项目对这些区域内的用户的相关性。建议用户接收到最高相关性分数的项目。

9. 发明申请

US20140006171A1 METHOD OF OFFLINE EXPERIMENTATION ENVIRONMENT AND APPARATUS CONDUCTING THE SAME 审中-公开
标题翻译：离线实验环境的方法和引导其的设备
公开(公告)号：US20140006171A1
公开(公告)日：2014-01-02
申请号：US13539266
申请日：2012-06-29
申请人： Patrick R. Jordan , Prabhakar Krishnamurthy , David Pardoe , Chris Leggetter , Sergei Vassilvitskii , Chris Bartels
发明人： Patrick R. Jordan , Prabhakar Krishnamurthy , David Pardoe , Chris Leggetter , Sergei Vassilvitskii , Chris Bartels
IPC分类号： G06Q30/02
CPC分类号： G06Q30/0241 , G06Q30/0275 , G06Q30/08 , G06Q50/01
摘要： The present application relates to systems and computer-implemented methods for calculating a suggested market variable associated with an auction of an online advertisement realization opportunity. In some implementations, an optimization procedure may be operated, wherein the optimization procedure may comprise sending an initial market variable associated with one or more auctions to bidding agents; receiving from each of the bidding agents a response market variable associated with the initial market variable; determining according to an auction bidding rule a winning market variable from the response market variables; and substituting the initial market variable with the wining market variable. The optimization procedure may be operated repeatedly until the winning market variable stabilizes. Then the stabilized market variable may be sent to an advertiser as the suggested market variable.
摘要翻译：本申请涉及用于计算与在线广告实现机会的拍卖相关联的建议的市场变量的系统和计算机实现的方法。在一些实现中，可以操作优化过程，其中优化过程可以包括向投标代理发送与一个或多个拍卖相关联的初始市场变量; 从每个招标代理人接收与初始市场变量相关的应对市场变量; 根据拍卖竞价规则确定来自响应市场变量的获胜市场变量; 以市场变化为代价替代初始市场变量。优化过程可以重复操作，直到获胜市场变量稳定。然后，稳定的市场变量可以作为建议的市场变量发送给广告商。

10. 发明申请

US20100125506A1 EXTENDED GENERALIZED SECOND PRICE AUCTION FOR SPONSORED SEARCH WITH RESERVE PRICES 审中-公开
标题翻译：扩展的第二次价格拍卖，用于保留价格的赞助搜索
公开(公告)号：US20100125506A1
公开(公告)日：2010-05-20
申请号：US12274464
申请日：2008-11-20
申请人： Sergei Vassilvitskii , Colin Brady , Rica Gonen
发明人： Sergei Vassilvitskii , Colin Brady , Rica Gonen
IPC分类号： G06Q30/00
CPC分类号： G06Q30/08 , G06Q30/02 , G06Q30/0273 , G06Q30/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.
摘要翻译：提供搜索引擎和赞助商搜索拍卖，可以在搜索结果页面上使用与不同广告位相对应的不同预留价格。在一个实现中，搜索引擎包括查询处理器和赞助的搜索拍卖。查询处理器被配置为从与用户相关联的电子设备接收查询，以确定对应于搜索结果页面的多个广告时隙的多个预留价格，并且确定广告时隙的多个投标价格对应于多个投标者的搜索结果页面。赞助搜索拍卖被配置为考虑到与搜索结果页面的广告时隙相关联的多个预留价格，将搜索者或搜索结果页面的每个广告时段的空值（例如，无广告）分配。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式