Building Fraud Communities
You've learned the algorithms. Now let's put them together.
In this lesson, you'll create iFull definition for relationship (opens in a new tab)A named, directed connection between two nodes. Every relationship has a type, a start node and an end node. that encode fraud hypotheses, use iFull definition for degree centrality (opens in a new tab)A score for each node equal to its number of outgoing relationships. to filter noise, and run iFull definition for weakly connected components (opens in a new tab)Groups of nodes in which every node is reachable from every other, once relationship direction is ignored. The GDS algorithm that finds them takes the same name. to identify communities of connected suspects.
Join GraphAcademy to keep learning
Create your account to unlock 80+ hours of hands-on Neo4j courses, track your progress, and earn a certificate when you complete the course.
Sign in or register