Google Inc.

Bryan Perozzi

Sami Ahmad Abu-El-Haija

Rami Al-Rfou′

Yingtao Tian

Alessandro Epasto

Dustin Zelle

Rami Al-Rfou

Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for a graph processing system. In one aspect, the graph processing system obtains data identifying a first node and a second node from a graph of nodes and edges. The system processes numeric embeddings of the first node and the second node using a manifold neural network to generate respective manifold coordinates of the first node and the second node. The system applies a learned edge function to the manifold coordinates of the first node and the manifold coordinates of the second node to generate an edge score that represents a likelihood that an entity represented by the first node and an entity represented by the second node have a particular relationship.

Representing graph edges using neural networks

Systems, methods, and computer readable media related to training and/or utilizing a neural network model to determine, based on a sequence of sources that each have an electronic interaction with a given electronic resource, one or more subsequent source(s) for interaction with the given electronic resource. For example, source representations of those sources can be sequentially applied (in an order that conforms to the sequence) as input to a trained recurrent neural network model, and output generated over the trained recurrent neural network model based on the applied input. The generated output can indicate, for each of a plurality of additional sources, a probability that the additional source will subsequently (e.g., next) interact with the given electronic resource. Such probabilities indicated by the output can be utilized in performance of further electronic action(s) related to the given electronic resource.

Training and/or utilizing recurrent neural network model to determine subsequent source(s) for electronic resource interaction

The present disclosure provides computing systems and methods directed to algorithms and the underlying machine learning (ML) models for evaluating similarity between graphs using graph structures and/or attributes. The systems and methods disclosed may provide advantages or improvements for comparing graphs without additional context or input from a person (e.g., the methods are unsupervised). In particular, the systems and methods of the present disclosure can operate to generate respective embeddings for one or more target graphs, where the embedding for each target graph is indicative of a respective similarity of such target graph to each of a set of source graphs, and where a pair of embeddings for a pair of target graphs can be used to assess a similarity between the pair of target graphs.

Systems and methods for determining graph similarity

The present disclosure is directed to encoding graphs. In particular, the methods and systems of the present disclosure can: receive data describing a first graph; and for each node, of one or more nodes, of the first graph, determine, based at least in part on data describing a second graph, and for each of multiple nodes of the second graph corresponding to the node of the first graph, a representation of a role of the node of the multiple nodes in a community to which the node of the multiple nodes belongs.

Growing community of inventors

Cranford, NJ, United States of America

Bryan Perozzi