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

1. 发明申请

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.
摘要翻译：提供了一种用于在因特网环境中分配库存的方法和系统。系统使用的方法可以包括生成代表展示广告资源的代表的样本，其中每个样本表示可展示展示的用户数量。可能会收到订单。该订单可能包含许多展示以预订和定位受众群体信息。可以确定为保证交付订购的展示次数所需的印象缓冲。可以从样品中分配订购的印象数以及缓冲。可以将包含目标受众信息，展示次数和缓冲的合同存储到数据库。

2. 发明申请

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。

3. 发明申请

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.
摘要翻译：一种用于在用于传送显示广告的系统中的印象机会的计算机实现的互联网广告方法。未来预测的用户访问可能提供预订合同的可能性计算为概率质量，并与预定的合同相关联。将多个合格契约的概率质量的相对大小与所选择的伪随机数一起用作选择器。在示例性实施例中，服务器被配置为作为用户访问网站的结果来接收事件谓词。根据收到的事件谓词，汇总了一组符合条件的合同。每个符合条件的合同都被分配到从一个范围中选择的一个间隔，该范围是与合格合同的概率质量相对应的间隔的大小。生成的伪随机数用于选择间隔，该间隔选择合格的广告进行显示。

4. 发明申请

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.
摘要翻译：一种用于在联网环境中分配库存的方法包括：接收购买多个显示印象的请求，所述请求包括目标参数和对应于广告可以向用户显示的最大次数的频率约束。该方法还包括在一组用户样本中分配所请求的显示展示次数，其中分配给该组用户样本中的任何一个用户样本的展示次数受到频率约束的约束。定义如何在用户样本之间分配展示的分配信息被存储到用户样本数据库。

5. 发明申请

US20100318413A1 ALLOCATION OF INTERNET ADVERTISING INVENTORY 审中-公开
标题翻译：互联网广告分类
公开(公告)号：US20100318413A1
公开(公告)日：2010-12-16
申请号：US12482184
申请日：2009-06-10
申请人： Martin Zinkevich , WenJing Ma , Ramana Yerneni , Jayavel Shanmugasundaram , R. Preston McAfee , Erik Vee
发明人： Martin Zinkevich , WenJing Ma , Ramana Yerneni , Jayavel Shanmugasundaram , R. Preston McAfee , Erik Vee
IPC分类号： G06Q30/00 , G06F17/00 , G06F17/30 , G06F17/11
CPC分类号： G06Q30/06 , G06Q30/02 , G06Q30/0241 , G06Q30/0283
摘要： A method for determining a price of a contract for booking advertising space in a networked environment includes receiving, via a web server, a request to book a number of impressions from available impression inventory, where each impression corresponds to the delivery of an advertisement to a browser. The method also includes assembling user samples that represent a total amount of impression inventory, where each user sample represents a number of internet users, calculating a value associated with each piece of remaining impression inventory of the total impression inventory, and evaluating the value of all remaining impression inventory before and after allocation to a contract by maximizing and equation subject to a set of constraints. The base price for the contract corresponds to the difference between the value of the inventory before and after allocation.
摘要翻译：一种用于确定在网络环境中预约广告空间的合同的价格的方法包括经由网络服务器接收从可用的展示广告资源预订多次展示的请求，其中每个展示对应于向广告的传送到浏览器该方法还包括组装用户样本，其表示总体曝光库存量，其中每个用户样本代表多个互联网用户，计算与总展示广告资源的每个剩余展示广告资源相关联的值，以及评估所有展示广告资源的价值通过最大限度地分配到合同之前和之后的剩余展示广告资源和受制于一组约束的公式。合同的基价对应于分配前后的库存价值之间的差额。

6. 发明申请

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.
摘要翻译：用于执行自适应出价以在竞价中保护互联网广告印象的系统。包括用于分析广告活动目标的系统，包括广告系列期间，目标数量的展示次数，目标预算。一个示例性技术定义了一个投标代理，用于执行适应性投标，寻求预算的最低目标支出。根据经验确定的预测，可以优化运动的客观结果，例如平均每赢得印象的成本，相对于期望的活动期间的总活动持续时间以及相对于活动预算的总支出。适应投标的技术包括在勘探招标阶段统计建模中标，通过学习 - 竞标自适应竞标，学习竞标自适应竞标，猜测双重调整自适应竞价，进行迭代调整投标金额。采用招标策略，特别是用于确定最低目标出价的标书和用于交易所投标的最高目标出价，并采用统计模型分析结果。

7. 发明申请

US20130111005A1 Online Active Learning in User-Generated Content Streams 有权
标题翻译：用户生成的内容流中的在线主动学习
公开(公告)号：US20130111005A1
公开(公告)日：2013-05-02
申请号：US13282285
申请日：2011-10-26
申请人： Wei Chu , Martin Zinkevich , Lihong Li , Achint Oommen Thomas , Belle Tseng
发明人： Wei Chu , Martin Zinkevich , Lihong Li , Achint Oommen Thomas , Belle Tseng
IPC分类号： G06F15/16 , G06N5/02 , G06F11/00
CPC分类号： H04L51/12 , G06F11/00 , G06F15/16 , G06N5/02 , G06N7/005 , G06Q50/20
摘要： Software for online active learning receives content posted to an online stream at a website. The software converts the content into an elemental representation and inputs the elemental representation into a probit model to obtain a predictive probability that the content is abusive. The software also calculates an importance weight based on the elemental representation. And the software updates the probit model using the content, the importance weight, and an acquired label if a condition is met. The condition depends on an instrumental distribution. The software removes the content from the online stream if a condition is met. The condition depends on the predictive probability, if an acquired label is unavailable.
摘要翻译：用于在线主动学习的软件会收到发布到网站上的在线流的内容。软件将内容转换为元素表示，并将元素表示输入到概率模型中，以获得内容滥用的预测概率。该软件还基于元素表示计算重要性权重。并且如果满足条件，则软件使用内容，重要性权重以及获取的标签来更新概率模型。条件取决于工具分配。如果满足条件，该软件将从在线流中删除内容。如果获取的标签不可用，则条件取决于预测概率。

8. 发明授权

US09967218B2 Online active learning in user-generated content streams 有权
公开(公告)号：US09967218B2
公开(公告)日：2018-05-08
申请号：US13282285
申请日：2011-10-26
申请人： Wei Chu , Martin Zinkevich , Lihong Li , Achint Oommen Thomas , Belle Tseng
发明人： Wei Chu , Martin Zinkevich , Lihong Li , Achint Oommen Thomas , Belle Tseng
IPC分类号： G06F15/16 , G06N5/02 , G06F11/00 , H04L12/58 , G06N7/00 , G06Q50/20
CPC分类号： H04L51/12 , G06F11/00 , G06F15/16 , G06N5/02 , G06N7/005 , G06Q50/20
摘要： Software for online active learning receives content posted to an online stream at a website. The software converts the content into an elemental representation and inputs the elemental representation into a probit model to obtain a predictive probability that the content is abusive. The software also calculates an importance weight based on the elemental representation. And the software updates the probit model using the content, the importance weight, and an acquired label if a condition is met. The condition depends on an instrumental distribution. The software removes the content from the online stream if a condition is met. The condition depends on the predictive probability, if an acquired label is unavailable.

9. 发明授权

US09519682B1 User trustworthiness 有权
标题翻译：用户可信赖性
公开(公告)号：US09519682B1
公开(公告)日：2016-12-13
申请号：US13117037
申请日：2011-05-26
申请人： Jay Pujara , Vishwanath Tumkur Ramarao , Xiaopeng Xi , Martin Zinkevich , Anirban Dasgupta , Belle Tseng , Wei Chu , Jyh-Shin Gareth Shue
发明人： Jay Pujara , Vishwanath Tumkur Ramarao , Xiaopeng Xi , Martin Zinkevich , Anirban Dasgupta , Belle Tseng , Wei Chu , Jyh-Shin Gareth Shue
IPC分类号： G06F11/00 , G06F17/30 , G06Q10/10 , H04H20/28 , H04H60/82 , G06F12/14
CPC分类号： G06F17/3053 , G06Q10/10 , H04H20/28 , H04H60/82
摘要： Embodiments are directed towards generating a unified user account trustworthiness system through user account trustworthiness scores. A trusted group of user accounts may be identified for a given action by grouping a plurality of user accounts into tiers based on a trustworthiness score of each user account for the given action. The tiers and/or trustworthiness scores may be employed to classify an item, such as a message as spam or non-spam, based on input from the user accounts. The trustworthiness scores may also be employed to determine if a user account is a robot account or a human account. The trusted group for a given action may dynamically evolve over time by regrouping the user accounts based on modified trustworthiness scores. A trustworthiness score of an individual user account may be modified based on input received from the individual user account and input from other user accounts.
摘要翻译：实施例旨在通过用户帐户可信度得分来生成统一的用户帐户可信赖性系统。可以基于针对给定动作的每个用户帐户的可信度分数将多个用户帐户分组成层，可以为给定动作识别可信赖的用户帐户组。层级和/或可信赖性分数可以用于基于来自用户帐户的输入来将项目（诸如作为垃圾邮件或非垃圾邮件）的消息分类。还可以使用可信度分数来确定用户帐户是机器人帐户还是人类账户。给定动作的受信任组可以通过基于修改的可信度得分重新分组用户账户而随着时间的推移而动态演变。可以基于从单个用户帐户接收的输入和来自其他用户帐户的输入来修改个人用户帐户的可信度分数。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式