US 12,216,710 B2
Graph search and visualization for fraudulent transaction analysis
Maria Inês Silva, Lisbon (PT); Bernardo José Amaral Nunes de Almeida Branco, Lisbon (PT); Pedro Gustavo Santos Rodrigues Bizarro, Lisbon (PT); João Tiago Barriga Negra Ascensão, Lisbon (PT); Saurabh Bajaj, San Mateo, CA (US); Maria Beatriz Malveiro Jorge, Lisbon (PT); Sandro Daniel Sabudin Nunes, Lisbon (PT); Rodolfo Cristóvão, Lisbon (PT); and Joel Carvalhais, Leiria (PT)
Assigned to Feedzai—Consultadoria e Inovação Tecnológica, S.A., (PT)
Filed by Feedzai-Consultadoria e Inovação Tecnológica, S.A., Coimbra (PT)
Filed on Oct. 26, 2020, as Appl. No. 17/080,660.
Claims priority of provisional application 62/927,041, filed on Oct. 28, 2019.
Prior Publication US 2021/0124780 A1, Apr. 29, 2021
Int. Cl. G06F 16/90 (2019.01); G06F 16/901 (2019.01); G06F 18/20 (2023.01); G06F 18/21 (2023.01); G06F 18/214 (2023.01); G06F 18/22 (2023.01); G06F 18/2413 (2023.01)
CPC G06F 16/9024 (2019.01) [G06F 18/214 (2023.01); G06F 18/217 (2023.01); G06F 18/22 (2023.01); G06F 18/24147 (2023.01); G06F 18/29 (2023.01)] 12 Claims
OG exemplary drawing
 
1. A system, comprising:
one or more processors configured to:
receive data, wherein the data includes transaction data entries;
generate one or more graphs using the received data;
calculate 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;
determine 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
identify a representative graph for each of the at least one group of vectors; and
a memory coupled to at least one of the one or more processors and configured to store the at least one group of vectors and a respective identified representative graph.