Graph search and visualization for fraudulent transaction analysis

A method, comprising:

• receiving data, wherein the data includes transaction data entries;
• generating one or more graphs using the received data;
• calculating one or more vectors for the one or more graphs, wherein each of the one or more vectors represents a respective graph embedding corresponding to at least a portion of the one or more graphs, wherein the calculated one or more vectors are aggregated with one or more previously determined graph embeddings corresponding to previous transaction data entries;
• determining that the one or more vectors belongs to at least one group of vectors based at least on the one or more vectors matching a data pattern associated with the at least one group of vectors including by building a hierarchy of clusters based at least on the aggregated one or more vectors with the one or more previously determined graph embeddings;
• and
• identifying a representative graph for each of the at least one group of vectors.

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

• receiving data, wherein the data includes transaction data entries;
• generating one or more graphs using the received data;
• calculating one or more vectors for the one or more graphs, wherein each of the one or more vectors represents a respective graph embedding corresponding to at least a portion of the one or more graphs, wherein the calculated one or more vectors are aggregated with one or more previously determined graph embeddings corresponding to previous transaction data entries;
• determining that the one or more vectors belongs to at least one group of vectors based at least on the one or more vectors matching a data pattern associated with the at least one group of vectors including by building a hierarchy of clusters based at least on the aggregated one or more vectors with the one or more previously determined graph embeddings;
• and
• identifying a representative graph for each of the at least one group of vectors.