Systems and methods for identifying illegitimate activities based on graph-based distance metrics
AssigneeFacebook, Inc.
InventorDaniel Adam Jenson
Life of this patent
Estimating the term…
Abstract
Systems, methods, and non-transitory computer-readable media can generate a node graph comprising a plurality of user account nodes and a plurality of edge nodes connecting the plurality of user account nodes. A distance score is calculated for each user account node of the plurality of user account nodes. It is determined that a transaction is an illegitimate transaction based on the distance scores.
Claims20
A computer-implemented method comprising:
- generating, by a computing system, a graph comprising a plurality of user account nodes, a plurality of edge nodes, and a plurality of connections connecting the plurality of user account nodes to the plurality of edge nodes, wherein a first edge node of the plurality of edge nodes represents a shared characteristic between at least two user account nodes of the plurality of user account nodes and each node of the at least two user account nodes is connected to the first edge node representing the shared characteristic;
- calculating, by the computing system, a first distance score for a first user account node of the plurality of user account nodes, wherein the first distance score represents a minimum distance from the first user account node to a nearest illegitimate node;
- and
- determining, by the computing system, that a transaction associated with the first user account node is an illegitimate transaction based on the first distance score.
A system comprising:
- at least one processor;
- and
- a memory storing instructions that, when executed by the at least one processor, cause the system to perform a method comprising:
- generating a graph comprising a plurality of user account nodes, a plurality of edge nodes, and a plurality of connections connecting the plurality of user account nodes to the plurality of edge nodes, wherein a first edge node of the plurality of edge nodes represents a shared characteristic between at least two user account nodes of the plurality of user account nodes and each node of the at least two user account nodes is connected to the first edge node representing the shared characteristic;
- calculating a first distance score for a first user account node of the plurality of user account nodes, wherein the first distance score represents a minimum distance from the first user account node to a nearest illegitimate node;
- and
- determining that a transaction associated with the first user account node is an illegitimate transaction based on the first distance score.
A non-transitory computer-readable storage medium including instructions that, when executed by at least one processor of a computing system, cause the computing system to perform a method comprising:
- generating a graph comprising a plurality of user account nodes, a plurality of edge nodes, and a plurality of connections connecting the plurality of user account nodes to the plurality of edge nodes, wherein a first edge node of the plurality of edge nodes represents a shared characteristic between at least two user account nodes of the plurality of user account nodes and each node of the at least two user account nodes is connected to the first edge node representing the shared characteristic;
- calculating a first distance score for a first user account node of the plurality of user account nodes, wherein the first distance score represents a minimum distance from the first user account node to a nearest illegitimate node;
- and
- determining that a transaction associated with the first user account node is an illegitimate transaction based on the first distance score.
Dependencies are inferred from the claim text.