公开(公告)号：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.

摘要翻译： 本发明涉及一种用于在基于网络的环境中优化用于将广告分配给合同的广告计划的系统和方法。 该系统和方法包括确定广告位置的影子价格，其中广告位置与具有定义的特征的用户相关联。 该系统和方法包括为具有所定义特征的用户确定相对于多个广告合同的广告展示的合同价格。 该系统和方法包括根据阴影价格和合同价格确定用于向给定合同分配广告的广告计划。 系统和方法包括根据基于网络的输出的广告计划呈现与给定合同相关联的给定广告。

公开(公告)号：US20130253994A1

公开(公告)日：2013-09-26

申请号：US13448883

申请日：2012-04-17

申请人： Chad Brower ,  Arpita Ghosh ,  David M. Pennock ,  Randolph Preston McAfee

发明人： Chad Brower ,  Arpita Ghosh ,  David M. Pennock ,  Randolph Preston McAfee

IPC分类号： G06Q20/22 ,  G06Q99/00

CPC分类号： G06Q20/22 ,  G06Q20/0855 ,  G06Q20/123 ,  G06Q20/29 ,  G06Q30/02

摘要： Micro-donations are received from users for various items of content published by different content providers. The micro-donations are aggregated into the user accounts and the content provider accounts until a transaction condition is satisfied. When the transaction condition is satisfied for the user account, a process to collect the micro-donation amount contributed by a respective user to different content providers is effectuated. When the transaction condition is satisfied for a content provider account, the micro-donation amount received from different users and aggregated within the content provider account is provided to the respective content provider. Various user and content provider incentives are implemented to encourage participation by the users and the content providers.

公开(公告)号：US08364627B2

公开(公告)日：2013-01-29

申请号：US13018303

申请日：2011-01-31

申请人： John Canny ,  Shi Zhong ,  Scott Gaffney ,  Chad Brower ,  Pavel Berkhin ,  George H. John

发明人： John Canny ,  Shi Zhong ,  Scott Gaffney ,  Chad Brower ,  Pavel Berkhin ,  George H. John

IPC分类号： G06F17/00 ,  G06N5/02

CPC分类号： G06Q30/02

摘要： A method of targeting receives several granular events and preprocesses the received granular events thereby generating preprocessed data to facilitate construction of a model based on the granular events. The method generates a predictive model by using the preprocessed data. The predictive model is for determining a likelihood of a user action. The method trains the predictive model. A system for targeting includes granular events, a preprocessor for receiving the granular events, a model generator, and a model. The preprocessor has one or more modules for at least one of pruning, aggregation, clustering, and/or filtering. The model generator is for constructing a model based on the granular events, and the model is for determining a likelihood of a user action. The system of some embodiments further includes several users, a selector for selecting a particular set of users from among the several users, a trained model, and a scoring module.

摘要翻译： 定向的方法接收几个粒度事件并预处理所接收的粒状事件，从而生成预处理的数据，以便于基于粒状事件构建模型。 该方法通过使用预处理数据生成预测模型。 预测模型用于确定用户动作的可能性。 该方法训练预测模型。 用于定位的系统包括粒状事件，用于接收粒度事件的预处理器，模型生成器和模型。 预处理器具有一个或多个用于修剪，聚合，聚类和/或过滤中的至少一个的模块。 模型生成器用于基于粒度事件构建模型，模型用于确定用户操作的可能性。 一些实施例的系统还包括若干用户，用于从几个用户中选择特定用户组的选择器，训练模型和评分模块。

公开(公告)号：US20100262607A1

公开(公告)日：2010-10-14

申请号：US12421974

申请日：2009-04-10

申请人： Sergei Vassilvitskii ,  Ramana Yerneni ,  Jayavel Shanmugasundaram ,  Erik Vee ,  Chad Brower ,  Steven Whang

发明人： Sergei Vassilvitskii ,  Ramana Yerneni ,  Jayavel Shanmugasundaram ,  Erik Vee ,  Chad Brower ,  Steven Whang

IPC分类号： G06F17/30 ,  G06Q30/00

CPC分类号： G06Q30/02 ,  G06F16/319 ,  G06F16/93

摘要： A method for indexing advertising contracts for rapid retrieval and matching in order to match satisfying contracts to advertising slots. The descriptions of the advertising contracts include logical predicates indicating applicability to a particular demographic. Also, the descriptions of advertising slots contain logical predicates indicating applicability to a particular demographic, thus matches can be performed using at least matches on the basis of intersecting demographics. The disclosure contains structure and techniques for receiving a set of contracts with predicates, preparing a data structure index of the set of contracts, receiving an advertising slot with predicates, and structure and techniques for retrieving from the data structure contracts that satisfy a match to the advertising slot predicates. The disclosure includes cases were the predicates are presented in conjoint forms and in disjoint forms, and techniques are provided to consider indexing and matching in cases of IN predicates and well as NOT-IN predicates.

摘要翻译： 一种为快速检索和匹配的广告合同进行索引的方法，以便将满足的合同与广告位匹配。 广告合同的描述包括指示适用于特定人口统计学的逻辑谓词。 此外，广告时隙的描述包含指示对特定人口统计的适用性的逻辑谓词，因此可以使用至少基于相关人口统计学的匹配来执行匹配。 本公开包含用于接收与谓词的一组合同的结构和技术，准备一组合同的数据结构索引，接收具有谓词的广告时隙，以及用于从符合匹配的数据结构合同的结构和技术 广告位谓词。 披露包括案例是谓词以联合形式和不相交的形式呈现，并且提供了在IN谓词和NOT-IN谓词的情况下考虑索引和匹配的技术。

公开(公告)号：US20090006363A1

公开(公告)日：2009-01-01

申请号：US11770413

申请日：2007-06-28

申请人： John Canny ,  Shi Zhong ,  Scott Gaffney ,  Chad Brower ,  Pavel Berkhin ,  George H. John

发明人： John Canny ,  Shi Zhong ,  Scott Gaffney ,  Chad Brower ,  Pavel Berkhin ,  George H. John

IPC分类号： G06F17/30

CPC分类号： G06Q30/02

摘要： A method of targeting receives several granular events and preprocesses the received granular events thereby generating preprocessed data to facilitate construction of a model based on the granular events. The method generates a predictive model by using the pre-processed data. The predictive model is for determining a likelihood of a user action. The method trains the predictive mode. A system for targeting includes granular events, a preprocessor for receiving the granular events, a model generator, and a model. The preprocessor has one or more modules for at least one of pruning, aggregation, clustering, and/or filtering. The model generator is for constructing a model based on the granular events, and the model is for determining a likelihood of a user action. The system of some embodiments further includes several users, a selector for selecting a particular set of users from among the several users, a trained model, and a scoring module.

摘要翻译： 定向的方法接收几个粒度事件并预处理所接收的粒状事件，从而生成预处理的数据，以便于基于粒状事件构建模型。 该方法通过使用预处理数据生成预测模型。 预测模型用于确定用户动作的可能性。 该方法训练预测模式。 用于定位的系统包括粒状事件，用于接收粒度事件的预处理器，模型生成器和模型。 预处理器具有一个或多个用于修剪，聚合，聚类和/或过滤中的至少一个的模块。 模型生成器用于基于粒度事件构建模型，模型用于确定用户操作的可能性。 一些实施例的系统还包括若干用户，用于从几个用户中选择特定用户组的选择器，训练模型和评分模块。

公开(公告)号：US20070233650A1

公开(公告)日：2007-10-04

申请号：US11394342

申请日：2006-03-29

申请人： Chad Brower ,  Shyam Kapur ,  Brian Coppola ,  Joshua M. Koran ,  Jignashu Parikh

发明人： Chad Brower ,  Shyam Kapur ,  Brian Coppola ,  Joshua M. Koran ,  Jignashu Parikh

IPC分类号： G06F17/30

CPC分类号： G06Q30/02

摘要： A system and method to facilitate automatic categorization of events in a network, wherein one or more keywords are retrieved from a keyword database, each retrieved keyword matching a corresponding event unit of an event input by a user over a network. A dominant keyword corresponding to a highest parameter value calculated for each retrieved keyword is then selected. Finally, the event is categorized based on one or more categories associated with the dominant keyword. The dominant keyword may be selected based on one or more keyword categories associated with each retrieved keyword and an ambiguity parameter value calculated for each keyword. Alternatively, the dominant keyword may be selected based on a highest-ranked output value calculated for each retrieved keyword. One or more categories associated with the dominant keyword are subsequently retrieved from the keyword database and the event is categorized based on the category associated with the dominant keyword.

摘要翻译： 一种促进网络中事件的自动分类的系统和方法，其中从关键字数据库检索一个或多个关键字，每个检索到的关键字匹配用户通过网络输入的事件的相应事件单元。 然后选择对应于针对每个检索到的关键字计算的最高参数值的主要关键字。 最后，事件根据与主要关键字相关联的一个或多个类别进行分类。 可以基于与每个检索到的关键字相关联的一个或多个关键字类别和为每个关键字计算的模糊度参数值来选择主要关键字。 或者，可以基于针对每个检索到的关键字计算的排名最高的输出值来选择主要关键字。 随后从关键字数据库中检索与该主要关键词相关联的一个或多个类别，并且基于与主要关键字相关联的类别对事件进行分类。

公开(公告)号：US20130253993A1

公开(公告)日：2013-09-26

申请号：US13427554

申请日：2012-03-22

申请人： Chad Brower

发明人： Chad Brower

IPC分类号： G06Q20/22 ,  G06Q99/00

CPC分类号： G06Q20/22 ,  G06Q20/0855 ,  G06Q20/123 ,  G06Q20/29 ,  G06Q30/02

摘要： Micro-donations are received from users for various items of content published by different content providers. The micro-donations are aggregated into the user accounts and the content provider accounts until a transaction condition is satisfied. When the transaction condition is satisfied for the user account, a process to collect the micro-donation amount contributed by a respective user to different content providers is effectuated. When the transaction condition is satisfied for a content provider account, the micro-donation amount received from different users and aggregated within the content provider account is provided to the respective content provider. Various user and content provider incentives are implemented to encourage participation by the users and the content providers.

摘要翻译： 从不同内容提供商发布的各种内容的用户收到微型捐赠。 微型捐款被汇总到用户帐户和内容提供商帐户中，直到满足交易条件。 当对用户帐户满足交易条件时，实现将相应用户贡献给不同内容提供者的微捐款金额的处理。 当满足内容提供商帐户的交易条件时，从各个用户收到的并且在内容提供商帐户内聚合的微量捐赠金额被提供给相应的内容提供商。 实施各种用户和内容提供商的激励措施以鼓励用户和内容提供商的参与。

公开(公告)号：US20110016109A1

公开(公告)日：2011-01-20

申请号：US12502742

申请日：2009-07-14

申请人： Sergei Vassilvitskii ,  Ramana Yerneni ,  Javavel Shanmugasundaram ,  Erik Vee ,  Chad Brower ,  Steven Whang

发明人： Sergei Vassilvitskii ,  Ramana Yerneni ,  Javavel Shanmugasundaram ,  Erik Vee ,  Chad Brower ,  Steven Whang

IPC分类号： G06F17/30 ,  G06Q30/00 ,  G06Q10/00

CPC分类号： G06Q30/08 ,  G06Q30/02 ,  G06Q30/0277

摘要： A method for indexing advertising contracts for rapid retrieval and matching in order to match only the top N satisfying contracts to advertising slots. Descriptions of advertising contracts include logical predicates indicating weighted applicability to a particular demographic. Descriptions of advertising slots also contain logical predicates indicating weighted applicability to particular demographics, thus matches are performed on the basis of a weighed score of intersecting demographics. Disclosed are structure and techniques for receiving a set of contracts with weighted predicates, preparing a data structure index of the set of contracts, receiving an advertising slot with weighted predicates, and retrieving from the data structure only the top N weighted score contracts that satisfy a match to the advertising slot predicates. Various disclosed cases include predicates presented in conjoint forms and in disjoint forms, and techniques are provided to consider indexing and matching in cases of both IN predicates and NOT-IN predicates.

摘要翻译： 一种用于快速检索和匹配的广告合同索引的方法，以便仅匹配前N个满足合同的广告位。 广告合同的描述包括指示对特定人口的加权适用性的逻辑谓词。 广告时隙的描述还包含逻辑谓词，其指示对特定人口统计特征的加权适用性，因此，基于相交人口统计学的加权得分进行匹配。 公开了用于接收具有加权谓词的一组合同的结构和技术，准备一组合同的数据结构索引，接收具有加权谓词的广告时隙，并且仅从数据结构中检索满足以下条件的前N个加权得分合同 匹配广告位谓词。 各种公开的案例包括以联合形式和不相交形式呈现的谓词，并提供了在IN谓词和NOT-IN谓词的情况下考虑索引和匹配的技术。

公开(公告)号：US20110015999A1

公开(公告)日：2011-01-20

申请号：US12502330

申请日：2009-07-14

申请人： Sergei Vassilvitskii ,  Erik Vee ,  Jayavel Shanmugasundaram ,  Srinivasan Rajagopal ,  Ramana Yerneni ,  Chad Brower

发明人： Sergei Vassilvitskii ,  Erik Vee ,  Jayavel Shanmugasundaram ,  Srinivasan Rajagopal ,  Ramana Yerneni ,  Chad Brower

IPC分类号： G06Q30/00

CPC分类号： G06Q30/02 ,  G06Q30/0251 ,  G06Q30/0254 ,  G06Q30/0273

摘要： Embodiments of the present invention provide for methods, systems and computer program products for utilizing a lattice structure in an advertisement serving system. The method according to one embodiment of the present invention comprises storing one or more advertisement contracts in a lattice structure. A request for one or more advertisements that satisfy one or more constraints is then received and within the lattice structure, a lowest level of one or more pools of advertisement contracts satisfying the one ore more constraints is located. A set of advertisement contracts is generated, wherein the set of advertisement contracts comprise one or more advertisement contracts from lowest level of the lattice structure. The method further comprises adding to the set of advertisement contracts advertisement contracts from the pools of advertisement contracts that are parent to the pools of contracts in the lowest level of the lattice structure.

摘要翻译： 本发明的实施例提供了用于在广告服务系统中利用格子结构的方法，系统和计算机程序产品。 根据本发明的一个实施例的方法包括将一个或多个广告合同存储在格子结构中。 然后接收对满足一个或多个约束的一个或多个广告的请求，并且在网格结构内，定位满足一个或多个约束的一个或多个广告合同池的最低级别。 生成一组广告合同，其中广告合同集合包括从网格结构的最低级别的一个或多个广告合同。 该方法还包括将广告合同中的广告合同的集合添加到网格结构的最低级别的父母的合同池中。

公开(公告)号：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.

摘要翻译： 通常，本发明的实施例提供了用于在广告服务系统中利用日期约束的方法，系统和计算机程序产品。 根据本发明的一个实施例的方法包括接收对满足一个或多个约束的一个或多个广告的请求。 生成一组广告合同，其中广告合同集合包括满足一个或多个约束的一个或多个广告合同。 然后确定该组广告合同中的给定广告合同的合同期限。 然后生成广告合同的子集，其中广告合同的子集包括在给定日期活跃的一组广告合同中的广告合同。 然后将广告合同的子集输入优化算法，并通过优化算法选择一个或多个广告合同。