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 processing an attributed graph that comprises a training dataset of labelled nodes and an unlabeled dataset of unlabeled nodes. The method and system includes selecting, using logistic regression, which candidate node from a plurality of possible candidate nodes included in the unlabeled dataset will minimize a risk if that candidate node is added to the training dataset; obtaining a label for the selected candidate node from a classification resource; and adding the selected candidate node and the obtained label to the training dataset as a labelled node to provide an enhanced training dataset.

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 detecting potentially perturbed nodes in a graph that comprises potentially perturbed nodes and clean nodes, comprising: calculating, for each of a plurality of nodes of the graph, a discrepancy value in respect of the node, wherein the discrepancy value for each node indicates a statistical discrepancy for classification probabilities associated with the node and classification probabilities associated with neighbouring nodes; fitting a statistical distribution for the discrepancy values for the clean nodes; determining a detection threshold for potentially perturbed nodes based on the statistical distribution; and identifying nodes having a discrepancy value greater than the detection threshold as potentially perturbed nodes.