公开(公告)号：US20150220530A1

公开(公告)日：2015-08-06

申请号：US14278811

申请日：2014-05-15

Applicant: GOOGLE INC.

Inventor： Seyed Vahab Mirrokni Banadaki ,  Silvio Lattanzi ,  Jonathan Ezra Feldman ,  Alessandro Epasto ,  Stefano Leonardi ,  Hugh Lynch ,  Varun Sharma

IPC: G06F17/30

CPC classification number: G06F17/30943 ,  G06F2216/03 ,  G06Q30/0241

Abstract: Systems and methods offer an efficient approach to computing similarity rankings in bipartite graphs. An example system includes at least one processor and memory storing a bipartite graph having a first set and a second set of nodes, with nodes in the first set being connected to nodes in the second set by edges. The memory also stores instructions that, when executed by the at least one processor, cause the system to assign each node in the second set to one of a plurality of categories and, for each of the plurality of categories, generate a subgraph. The subgraph comprises of a subset of nodes in the first set and edges linking the nodes in the subset, where the nodes in the subset are selected based on connection to a node in the second set that is assigned to the category. The system uses the subgraph to respond to queries.

Abstract translation: 系统和方法提供了一种有效的方法来计算二分图中的相似性排名。 示例系统包括至少一个处理器和存储具有第一组和第二组节点的二分图的存储器，其中第一组中的节点通过边缘连接到第二组中的节点。 存储器还存储指令，当由至少一个处理器执行时，使得系统将第二组中的每个节点分配给多个类别中的一个，并且对于多个类别中的每一个分类，生成子图。 子图包括第一组中的节点的子集和链接子集中的节点的边缘，其中基于与分配给该类别的第二集合中的节点的连接来选择子集中的节点。 系统使用子图来回应查询。

公开(公告)号：US20140222587A1

公开(公告)日：2014-08-07

申请号：US14049889

申请日：2013-10-09

Applicant: Google Inc.

Inventor： Jonathan Ezra Feldman ,  Daniel Magassy Percival ,  Lu Liu ,  David Shanahan ,  Alice S. Tull ,  Surojit Chatterjee ,  Neil Inala ,  Jean Steiner ,  Vinod Marur ,  Shibani Sanan ,  William Martin Halpin, JR. ,  Chrix Eric Finne ,  Nicholas Johnson

IPC: G06Q30/02

CPC classification number: G06Q30/0275

Abstract: Systems and methods for suggesting a bid adjustment value based on device type include receiving parameters for a third-party content provider's campaign to present third-party content on a first type of device. Based on the campaign's parameters, bids from peer providers that use similar campaign parameters for both the first type of device and another type of device may be identified. For example, bids from providers that use similar parameters as the campaign for both mobile and desktop devices may be identified. The identified bids from the peer providers may be used to calculate a bid adjustment value. The bid adjustment value can be provided for presentation to the third-party content provider as a suggested change to his or her bid for the first type of device, to establish a bid for the second type of device.

Abstract translation: 基于设备类型来建议出价调整值的系统和方法包括接收第三方内容提供商的活动的参数以在第一类型的设备上呈现第三方内容。 根据广告系列的参数，可以识别对第一类设备和另一类设备使用类似的广告系列参数的对等提供商的出价。 例如，可以识别使用与移动和桌面设备的广告系列类似的参数的提供商的出价。 来自同行提供者的识别出价可用于计算出价调整值。 出价调整值可以提供给第三方内容提供商，作为对其第一类型设备的出价的建议改变，以建立第二类型设备的出价。

公开(公告)号：US20170330243A1

公开(公告)日：2017-11-16

申请号：US14215824

申请日：2014-03-17

Applicant: Google Inc.

Inventor： Andrew Fuqua ,  David Vespe ,  Jonathan Ezra Feldman

IPC: G06Q30/02

CPC classification number: G06Q30/0275

Abstract: Systems, methods, and computer-readable storage media that may be used to provide bid adjustment recommendations for budget-constrained content campaigns are provided. One method includes identifying a content campaign eligible for each of a plurality of auctions that was excluded from at least some of the auctions based on a budget constraint. The method further includes simulating the auctions using one or more adjusted bid values and generating estimated results for the adjusted bid values based on the simulated auctions. The method further includes determining at least one adjusted bid value that is estimated to result in at least one of the following: (1) increased clicks under substantially the same budget constraint; (2) increased clicks at substantially the same total cost; or (3) decreased cost with substantially the same number of clicks. The method further includes providing at least one recommendation to adopt the at least one adjusted bid value.

公开(公告)号：US20170330219A1

公开(公告)日：2017-11-16

申请号：US14146468

申请日：2014-01-02

Applicant: Google Inc.

Inventor： Jonathan Ezra Feldman ,  Jeremy Lee Whelchel ,  Deepti Bhatnagar ,  Mike Schulman ,  David Vespe ,  Hugh Anthony Lynch

IPC: G06Q30/02

CPC classification number: G06Q30/0243

Abstract: Systems, methods, and computer-readable storage media that may be used to generate competitor-specific bidding recommendations are provided. One method includes identifying, at a computerized analysis system, at least one competitor of a content provider within a plurality of content auctions for displaying content items. The method further includes calculating, at the analysis system, at least one bidding action estimated to improve performance of the content provider in future content auctions with respect to the at least one competitor from a current level to a goal level of the performance metric. The method further includes providing a recommendation to the content provider to implement the at least one bidding action.

公开(公告)号：US10152557B2

公开(公告)日：2018-12-11

申请号：US14278811

申请日：2014-05-15

Applicant: GOOGLE INC.

Inventor： Seyed Vahab Mirrokni Banadaki ,  Silvio Lattanzi ,  Jonathan Ezra Feldman ,  Alessandro Epasto ,  Stefano Leonardi ,  Hugh Lynch ,  Varun Sharma

IPC: G06F17/30 ,  G06F17/00 ,  G06Q30/02

Abstract: Systems and methods offer an efficient approach to computing similarity rankings in bipartite graphs. An example system includes at least one processor and memory storing a bipartite graph having a first set and a second set of nodes, with nodes in the first set being connected to nodes in the second set by edges. The memory also stores instructions that, when executed by the at least one processor, cause the system to assign each node in the second set to one of a plurality of categories and, for each of the plurality of categories, generate a subgraph. The subgraph comprises of a subset of nodes in the first set and edges linking the nodes in the subset, where the nodes in the subset are selected based on connection to a node in the second set that is assigned to the category. The system uses the subgraph to respond to queries.

公开(公告)号：US20170323380A1

公开(公告)日：2017-11-09

申请号：US14134441

申请日：2013-12-19

Applicant: Google Inc.

Inventor： Christopher Brian Alberti ,  David Vespe ,  Jonathan Ezra Feldman

IPC: G06Q30/08

CPC classification number: G06Q30/08

Abstract: Systems and methods for identifying competitors using content extensions in content items in content items associated with their content placement campaigns are described. A processor identifies one or more competing entities from auctions in which the first entity places a bid. The competing entities are associated with content items having a first type of content extension that received impressions in at least one identified auction. The processor computes an overlap rate based on a number of auctions in which both a content item having the first type of content extension of the identified competing entity and a content item of the first entity received impressions and a number of auctions in which a content item having the first type of content extension of the identified competing entity received an impression and the first entity competed. The processor ranks the competing entities based on the computed overlap rate.

公开(公告)号：US20140222586A1

公开(公告)日：2014-08-07

申请号：US13797597

申请日：2013-03-12

Applicant: Google Inc.

Inventor： Jonathan Ezra Feldman ,  Daniel Magassy Percival ,  Lu Liu ,  David Shanahan ,  Alice S. Tull ,  Surojit Chatterjee ,  Neil Inala ,  Jean Steiner ,  Vinod Marur ,  Shibani Sanan ,  William Martin Halpin, JR. ,  Chrix Eric Finne ,  Nicholas Johnson

IPC: G06Q30/02

CPC classification number: G06Q30/0275

Abstract: Systems and methods for suggesting a bid adjustment value based on device type include receiving parameters for a third-party content provider's campaign to present third-party content on a first type of device. Based on the campaign's parameters, bids from peer providers that use similar campaign parameters for both the first type of device and another type of device may be identified. For example, bids from providers that use similar parameters as the campaign for both mobile and desktop devices may be identified. The identified bids from the peer providers may be used to calculate a bid adjustment value. The bid adjustment value can be provided for presentation to the third-party content provider as a suggested change to his or her bid for the first type of device, to establish a bid for the second type of device.