Abstract:
System and method for processing a graph that defines a set of nodes and a set of edges, the nodes each having an associated set of node attributes, the edges each representing a relationship that connects two respective nodes, comprising: generating a first node embedding for each node by: generating, for the node and each of a plurality of neighbour nodes, a respective first edge attribute defining a respective relationship type between the node and the neighbour node based on the node attributes of the node and the node attributes of the neighbour node; generating a first neighborhood vector that aggregates information from the generated first edge attributes and the node attributes of the neighbour nodes; generating the first node embedding based on the node attributes of the node and the generated first neighborhood vector.
Abstract:
Method and system for predicting labels for nodes in an observed graph, including deriving a plurality of random graph realizations of the observed graph; learning a predictive function using the random graph realizations; predicting label probabilities for nodes of the random graph realizations using the learned predictive function; and averaging the predicted label probabilities to predict labels for the nodes of the observed graph.
Abstract:
System and method for processing an observed bipartite graph that has a plurality of user nodes, a plurality of item nodes, and an observed graph topology that defines edges connecting at least some of the user nodes to some of the item nodes such that at least some nodes have node neighbourhoods comprising edge connections to one or more other nodes. A plurality of random graph topologies are derived that are realizations of the observed graph topology by replacing the node neighbourhoods of at least some nodes with the node neighbourhoods of other nodes. A non-linear function is trained using the plurality of user nodes, plurality of item nodes and plurality of random graph topologies to learn user node embeddings and item node embeddings for the plurality of user nodes and plurality of item nodes, respectively.
Abstract:
System and method for processing an observed bipartite graph that has a plurality of user nodes, a plurality of item nodes, and an observed graph topology that defines edges connecting at least some of the user nodes to some of the item nodes such that at least some nodes have node neighbourhoods comprising edge connections to one or more other nodes. A plurality of random graph topologies are derived that are realizations of the observed graph topology by replacing the node neighbourhoods of at least some nodes with the node neighbourhoods of other nodes. A non-linear function is trained using the plurality of user nodes, plurality of item nodes and plurality of random graph topologies to learn user node embeddings and item node embeddings for the plurality of user nodes and plurality of item nodes, respectively.
Abstract:
Method and system for predicting labels for nodes in an observed graph, including deriving a plurality of random graph realizations of the observed graph; learning a predictive function using the random graph realizations; predicting label probabilities for nodes of the random graph realizations using the learned predictive function; and averaging the predicted label probabilities to predict labels for the nodes of the observed graph.
Abstract:
Technologies are described herein for providing users of a messaging application with controls that perform one or more selected actions with a message. Any number of default custom action controls may be displayed in a gallery. The selection of a custom action control performs various actions to an active message. New custom action controls may be created and existing controls modified to provide any number of desired actions. Dialogs provide user-friendly interfaces that allow a user to assign the desired functionality to a custom action control. The custom action controls may be organized into groups and shared between messaging applications and computers.
Abstract:
Technologies are described herein for providing users of a messaging application with controls that perform one or more selected actions with a message. Any number of default custom action controls may be displayed in a gallery. The selection of a custom action control performs various actions to an active message. New custom action controls may be created and existing controls modified to provide any number of desired actions. Dialogs provide user-friendly interfaces that allow a user to assign the desired functionality to a custom action control. The custom action controls may be organized into groups and shared between messaging applications and computers.
Abstract:
System, method, and computer readable medium for operating a computer system to process a graph, including receiving a prediction request for a subject node of the graph; obtaining a sparse node approximation for the subject node, the sparse node approximation defining a weighted combination of a subset of nodes of the graph as receptive nodes for the subject node; applying a neural network based transformation function based on the sparse node approximation to generate a node representation for the subject node; performing a prediction task based on the generated node representation to generate a prediction for the subject node; and outputting the prediction.
Abstract:
Probabilistic spatiotemporal forecasting comprising acquiring a time series of observed states from a real-world system, each observed state corresponding to a respective time-step in the time series and including a set of data observations of the real-world system for the respective time-step. For each of a plurality of the time steps in the time series of observed states, a hidden state is generated for the time-step based on an observed state for a prior time-step and an approximated posterior distribution generated for a hidden state for the prior time-step. The use of an approximated posterior distribution can enable improved forecasting in complex, high dimensional settings.
Abstract:
A recommendation system (RS) for processing an input dataset that identifies a set of users, a set of items, and user-item interaction data about historic interactions between users in the set of users and items in the set of items. The RS is configured to: generate, based on a user-item interaction dataset, a user-user similarity dataset and an item-item similarity dataset, filter the user-user similarity dataset based on a user similarity threshold vector that includes a respective user similarity threshold value for each user, filter the item-item similarity dataset based on an item similarity threshold vector including a respective item similarity threshold value for each item generate a set of user neighbour embeddings based on the filtered user-user similarity dataset, and generating a set of item neighbour embeddings based on the filtered item-item similarity dataset. The RS is also configured to generate a set of relevance scores based on the user neighbour embeddings and the item neighbour embeddings and generating a list of one or more recommended items for each user.