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

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

公开(公告)号：US09183387B1

公开(公告)日：2015-11-10

申请号：US13911011

申请日：2013-06-05

Applicant: GOOGLE INC.

Inventor： Alon Altman ,  Alessandro Epasto

IPC: G06F21/56 ,  G06F21/55 ,  H04L29/06

CPC classification number: G06F21/552 ,  G06F21/554 ,  G06F21/56 ,  H04L63/1416 ,  H04L63/1425

Abstract: Detecting online attacks is described, including identifying one or more events associated with users on a social graph. For each type of event of the one or more events, generating at least one directed acyclic graph (DAG), where each node on the DAG represents a node on the social graph where an event of the type occurs and each edge on the DAG represents a propagation of the event from a first node of the edge to a second node of the edge.

Abstract translation: 描述了检测在线攻击，包括在社交图上识别与用户相关联的一个或多个事件。 对于一个或多个事件的每种类型的事件，生成至少一个有向非循环图（DAG），其中DAG上的每个节点表示社会图上的节点，其中类型的事件发生，并且DAG上的每个边缘表示 事件从边缘的第一节点传播到边缘的第二节点。