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

11. 发明申请

US20100082401A1 FORECASTING FOR ADVERTISING INVENTORY ALLOCATION 审中-公开
标题翻译：预测广告分配
公开(公告)号：US20100082401A1
公开(公告)日：2010-04-01
申请号：US12240749
申请日：2008-09-29
申请人： Erik Vee , Ramana Yerneni , Jayavel Shanmugasundaram , Sergei Vassilvitskii , Srinivasan Rajagopal
发明人： Erik Vee , Ramana Yerneni , Jayavel Shanmugasundaram , Sergei Vassilvitskii , Srinivasan Rajagopal
IPC分类号： G06Q30/00 , G06Q90/00
CPC分类号： G06Q30/02 , G06Q30/0202 , G06Q30/0277
摘要： Subject matter disclosed herein relates to a system for managing online advertising, and in particular, to pricing of advertising inventory and its allocation to advertising campaigns.
摘要翻译：本文公开的主题涉及用于管理在线广告的系统，特别涉及广告库存的定价及其对广告活动的分配。

12. 发明申请

US20110016109A1 System and Method for Automatic Matching of Highest Scoring Contracts to Impression Opportunities Using Complex Predicates and an Inverted Index 审中-公开
标题翻译：使用复杂谓词和倒置索引自动匹配最高评分合同与印象机会的系统和方法
公开(公告)号：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谓词的情况下考虑索引和匹配的技术。

13. 发明申请

US20110015999A1 SYSTEM AND METHOD FOR UTILIZING A LATTICE STORAGE STRUCTURE IN AN ADVERTISEMENT SERVING SYSTEM 审中-公开
标题翻译：广告服务系统中利用存储结构的系统与方法
公开(公告)号：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.
摘要翻译：本发明的实施例提供了用于在广告服务系统中利用格子结构的方法，系统和计算机程序产品。根据本发明的一个实施例的方法包括将一个或多个广告合同存储在格子结构中。然后接收对满足一个或多个约束的一个或多个广告的请求，并且在网格结构内，定位满足一个或多个约束的一个或多个广告合同池的最低级别。生成一组广告合同，其中广告合同集合包括从网格结构的最低级别的一个或多个广告合同。该方法还包括将广告合同中的广告合同的集合添加到网格结构的最低级别的父母的合同池中。

14. 发明申请

US20100185484A1 ALLOCATION OF INTERNET ADVERTISING INVENTORY 审中-公开
标题翻译：互联网广告分类
公开(公告)号：US20100185484A1
公开(公告)日：2010-07-22
申请号：US12355308
申请日：2009-01-16
申请人： Mark Sordo , Jayaavel Shanmugasundaram , Srinivasan Rajagopal , Erik Vee , Sergei Vassilvitskii , Donald Swanson
发明人： Mark Sordo , Jayaavel Shanmugasundaram , Srinivasan Rajagopal , Erik Vee , Sergei Vassilvitskii , Donald Swanson
IPC分类号： G06Q10/00 , G06Q30/00
CPC分类号： G06Q30/02 , G06Q10/087 , G06Q30/0201 , G06Q30/0251 , G06Q30/0263
摘要： A method and system for allocating inventory in an Internet environment is provided. A method employed by the system may include generating several inventory pools, where each inventory pool represents a number of impressions deliverable to different groups of users characterized by attributes. Impressions deliverable to users represented by each inventory pool may be allocated to each inventory pool. Impressions that correspond to multiple pools may be distributed between the multiple pools. The inventory pools may be stored to a database. Afterwards, and order may be received. The order may include parameters that define an audience and a number of impressions. The number of impressions in the order may be allocated from pools in the database.
摘要翻译：提供了一种用于在因特网环境中分配库存的方法和系统。系统使用的方法可以包括生成多个库存池，其中每个库存池代表可由可归属于特征的不同用户组可递送的多个展示。可以将每个库存池代表的用户交付的展示次数分配给每个库存池。对应于多个池的印象可以分布在多个池之间。库存池可能存储到数据库。之后，可能会收到订单。订单可能包括定义受众群体和展示次数的参数。订单中的展示次数可能会从数据库中的池分配。

15. 发明申请

US20140006144A1 METHOD OF CALCULATING A RESERVE PRICE FOR AN AUCTION AND APPARATUS CONDUCTING THE SAME 审中-公开
标题翻译：计算用于拍卖的保留价格的方法和引导其的装置
公开(公告)号：US20140006144A1
公开(公告)日：2014-01-02
申请号：US13539273
申请日：2012-06-29
申请人： David Pardoe , Patrick R. Jordan , Prabhakar Krishnamurthy , Sergei Vassilvitskii , Erik Vee
发明人： David Pardoe , Patrick R. Jordan , Prabhakar Krishnamurthy , Sergei Vassilvitskii , Erik Vee , Mohammad Mahdian , Mercin Mejran
IPC分类号： G06Q30/02
CPC分类号： G06Q30/02 , G06Q30/08
摘要： The present application relates to systems and computer-implemented methods for calculating a suggested reserve price associated with an opportunity to realize an online advertisement. In some implementations, data associated with historical online advertisement auctions are clustered based on a reference opportunity for realizing an online advertisement, wherein each historical online advertisement auction of the cluster is associated with a first bid price of higher value and a second bid price of lower value; a dominance relationship between a distribution of the first bid prices of the cluster and a distribution of the second bid prices of the cluster is determined; a reserve price associated with the cluster based on the dominance relationship is calculated; and the reserve price is stored as a suggested reserve price to realize an online advertisement, wherein the suggested reserve price is associated with the reference opportunity that is associated with the cluster.
摘要翻译：本申请涉及用于计算与实现在线广告的机会相关联的建议的预留价格的系统和计算机实现的方法。在一些实现中，与历史在线广告拍卖相关联的数据基于用于实现在线广告的参考机会而聚集，其中集群的每个历史在线广告拍卖与较高价格的第一投标价格和较低价格的第二投标价格相关联值; 确定集群的第一投标价格分布与集群的第二投标价格分布之间的优势关系; 计算基于优势关系的与集群相关的储备价格; 储备价格作为建议的预留价格进行存储以实现在线广告，其中建议的储备价格与与集群相关联的参考机会相关联。

16. 发明授权

US08229933B2 System and method for automatic matching of contracts using a fixed-length predicate representation 有权
标题翻译：使用固定长度谓词表示自动匹配合同的系统和方法
公开(公告)号：US08229933B2
公开(公告)日：2012-07-24
申请号：US12714142
申请日：2010-02-26
申请人： Marcus Fontoura , Suhas Sadanandan , Jayavel Shanmugasundaram , Sergei Vassilvitskii , Erik Vee , Srihari Venkatesan , Jason Zien
发明人： Marcus Fontoura , Suhas Sadanandan , Jayavel Shanmugasundaram , Sergei Vassilvitskii , Erik Vee , Srihari Venkatesan , Jason Zien
IPC分类号： G06F7/00
CPC分类号： G06Q30/08
摘要： An item of inventory is described as a Boolean expression, which is converted into a multi-level, alternating AND/OR impression tree representation with leaf nodes representing conjuncts. Processing the conjuncts of the tree through a contract index results in retrieving a set of candidate contracts that match at least some but not necessarily all impression tree leaf node predicates. Next, an AND/OR contract tree representation is constructed with each contract tree leaf node having a label representing a projection onto a discrete set of ordered symbols. Contracts with projections that cover the entire range of discrete set of ordered symbols are deemed to satisfy the item of inventory. Implementation of the contract index includes retrieval techniques to support multi-valued predicates as well as confidence threshold functions using a multi-level tree representation of multi-valued predicates.
摘要翻译：库存项目被描述为一个布尔表达式，它被转换成具有代表连接的叶节点的多层交替的AND / OR印象树表示。通过合同索引处理树的结合导致检索与至少一些但不一定是所有印象树叶节点谓词匹配的一组候选契约。接下来，构建AND / OR合同树表示，每个合约树叶节点具有表示投影到一个离散的有序符号集合上的标签。具有覆盖整个有序符号的整个范围的预测的合同被视为满足库存项目。合同索引的实现包括使用多值谓词的多级树表示来支持多值谓词以及置信阈值函数的检索技术。

17. 发明申请

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

18. 发明申请

US20110213767A1 System and Method for Automatic Matching of Contracts Using a Fixed-Length Predicate Representation 有权
标题翻译：使用固定长度谓词表示自动匹配合同的系统和方法
公开(公告)号：US20110213767A1
公开(公告)日：2011-09-01
申请号：US12714142
申请日：2010-02-26
申请人： Marcus Fontoura , Suhas Sadanandan , Jayavel Shanmugasundaram , Sergei Vassilvitskii , Erik Vee , Srihari Venkatesan , Jason Zien
发明人： Marcus Fontoura , Suhas Sadanandan , Jayavel Shanmugasundaram , Sergei Vassilvitskii , Erik Vee , Srihari Venkatesan , Jason Zien
IPC分类号： G06F17/30
CPC分类号： G06Q30/08
摘要： A method for automatic matching of contracts to inventory using a fixed-length complex predicate representation. An item of inventory is described as a Boolean expression, which is converted into a multi-level, alternating AND/OR impression tree representation with leaf nodes representing conjuncts. Processing the conjuncts of the tree through a contract index results in retrieving a set of candidate contracts that match the at least some but not necessarily all impression tree leaf node predicates. Next, an AND/OR contract tree representation is constructed with each contract tree leaf node having a label representing a projection onto a discrete set of ordered symbols. Contracts with projections that cover the entire range of discrete set of ordered symbols are deemed to satisfy the item of inventory. Implementation of the contract index includes retrieval techniques to support multi-valued predicates as well as confidence threshold functions using a multi-level tree representation of multi-valued predicates.
摘要翻译：使用固定长度的复合谓词表示自动匹配合同到库存的方法。库存项目被描述为一个布尔表达式，它被转换成具有代表连接的叶节点的多层交替的AND / OR印象树表示。通过合同索引处理树的结合导致检索与至少一些但不一定是所有印象树叶节点谓词匹配的一组候选契约。接下来，构建AND / OR合同树表示，每个合约树叶节点具有表示投影到一个离散的有序符号集合上的标签。具有覆盖整个有序符号的整个范围的预测的合同被视为满足库存项目。合同索引的实现包括使用多值谓词的多级树表示来支持多值谓词以及置信阈值函数的检索技术。

19. 发明申请

US20110213660A1 System and Method for Automatic Matching of Contracts in an Inverted Index to Impression Opportunities Using Complex Predicates with Multi-Valued Attributes 审中-公开
标题翻译：使用具有多值属性的复数谓词将反向索引中的合同自动匹配到印象机会的系统和方法
公开(公告)号：US20110213660A1
公开(公告)日：2011-09-01
申请号：US12714051
申请日：2010-02-26
申请人： Marcus Fontoura , Suhas Sadanandan , Jayavel Shanmugasundaram , Sergei Vassilvitskii , Erik Vee , Srihari Venkatesan , Jason Zien
发明人： Marcus Fontoura , Suhas Sadanandan , Jayavel Shanmugasundaram , Sergei Vassilvitskii , Erik Vee , Srihari Venkatesan , Jason Zien
IPC分类号： G06Q30/00 , G06N5/02
CPC分类号： G06Q30/02 , G06Q30/0254
摘要： A method for automatic matching of contracts to inventory using a fixed-length complex predicate representation. An item of inventory is described as a Boolean expression, which is converted into a multi-level, alternating AND/OR impression tree representation with leaf nodes representing conjuncts. Processing the conjuncts of the tree through a contract index results in retrieving a set of candidate contracts that match the at least some but not necessarily all impression tree leaf node predicates. Next, an AND/OR contract tree representation is constructed with each contract tree leaf node having a label representing a projection onto a discrete set of ordered symbols. Contracts with projections that cover the entire range of discrete set of ordered symbols are deemed to satisfy the item of inventory. Implementation of the contract index includes retrieval techniques to support multi-valued predicates as well as confidence threshold functions using a multi-level tree representation of multi-valued predicates.
摘要翻译：使用固定长度的复合谓词表示自动匹配合同到库存的方法。库存项目被描述为一个布尔表达式，它被转换成具有代表连接的叶节点的多层交替的AND / OR印象树表示。通过合同索引处理树的结合导致检索与至少一些但不一定是所有印象树叶节点谓词匹配的一组候选契约。接下来，构建AND / OR合同树表示，每个合约树叶节点具有表示投影到一个离散的有序符号集合上的标签。具有覆盖整个有序符号的整个范围的预测的合同被视为满足库存项目。合同索引的实现包括使用多值谓词的多级树表示来支持多值谓词以及置信阈值函数的检索技术。

20. 发明申请

US20110213659A1 System and Method for Automatic Matching of Contracts in an Inverted Index to Impression Opportunities Using Complex Predicates and Confidence Threshold Values 审中-公开
标题翻译：使用复数谓词和置信阈值自动匹配反向索引中的合同的印象机会的系统和方法
公开(公告)号：US20110213659A1
公开(公告)日：2011-09-01
申请号：US12714046
申请日：2010-02-26
申请人： Marcus Fontoura , Subas Sadanandan , Jayavel Shanmugasundaram , Sergei Vassilvitskii , Erik Vee , Srihari Venkatesan , Jason Zien
发明人： Marcus Fontoura , Subas Sadanandan , Jayavel Shanmugasundaram , Sergei Vassilvitskii , Erik Vee , Srihari Venkatesan , Jason Zien
IPC分类号： G06Q30/00
CPC分类号： G06Q30/02 , G06Q30/0254 , G06Q30/0273
摘要： A method for automatic matching of contracts to inventory using a fixed-length complex predicate representation. An item of inventory is described as a Boolean expression, which is converted into a multi-level, alternating AND/OR impression tree representation with leaf nodes representing conjuncts. Processing the conjuncts of the tree through a contract index results in retrieving a set of candidate contracts that match the at least some but not necessarily all impression tree leaf node predicates. Next, an AND/OR contract tree representation is constructed with each contract tree leaf node having a label representing a projection onto a discrete set of ordered symbols. Contracts with projections that cover the entire range of discrete set of ordered symbols are deemed to satisfy the item of inventory. Implementation of the contract index includes retrieval techniques to support multi-valued predicates as well as confidence threshold functions using a multi-level tree representation of multi-valued predicates.
摘要翻译：使用固定长度的复合谓词表示自动匹配合同到库存的方法。库存项目被描述为一个布尔表达式，它被转换成具有代表连接的叶节点的多层交替的AND / OR印象树表示。通过合同索引处理树的结合导致检索与至少一些但不一定是所有印象树叶节点谓词匹配的一组候选契约。接下来，构建AND / OR合同树表示，每个合约树叶节点具有表示投影到一个离散的有序符号集合上的标签。具有覆盖整个有序符号的整个范围的预测的合同被视为满足库存项目。合同索引的实现包括使用多值谓词的多级树表示来支持多值谓词以及置信阈值函数的检索技术。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式