Graph decomposition for fraudulent transaction analysis

A method, comprising:

• initializing nodes and edges of a data graph for analysis using a computer;
• performing message passing between at least a portion of the nodes of the data graph to determine a corresponding measure of interest for each node of at least a portion of the data graph, wherein neighborhood expansion is performed based at least in part on:
• (i) the measure of interest including an edge interest score and (ii) an expansion interest associated with at least one neighbor of a node, wherein the edge interest score is determined using an edge interest function that is monotonically increasing on the edge interest score;
• receiving an identification of one or more nodes of interest in the data graph;
• performing message passing between at least a portion of the nodes of the data graph using at least the determined measures of interest to identify a corresponding subgraph of interest for each of the one or more nodes of interest in the data graph;
• and
• performing an analysis action using the one or more identified subgraphs of interest.

A computer program product embodied in a non-transitory computer readable medium and comprising computer instructions for:

• initializing nodes and edges of a data graph for analysis using a computer;
• performing message passing between at least a portion of the nodes of the data graph to determine a corresponding measure of interest for each node of at least a portion of the data graph, wherein neighborhood expansion is performed based at least in part on:
• (i) the measure of interest including an edge interest score and (ii) an expansion interest associated with at least one neighbor of a node, wherein the edge interest score is determined using an edge interest function that is monotonically increasing on the edge interest score;
• receiving an identification of one or more nodes of interest in the data graph;
• performing message passing between at least a portion of the nodes of the data graph using at least the determined measures of interest to identify a corresponding subgraph of interest for each of the one or more nodes of interest in the data graph;
• and
• performing an analysis action using the one or more identified subgraphs of interest.