Uncovering Vulnerabilities with Graph Databases
Graph databases offer sophisticated methods to uncover fraud and vulnerabilities.
Join the DZone community and get the full member experience.Join For Free
banks and insurance companies lose billions of dollars every year to fraud.
traditional methods of fraud detection fail to minimize these losses since they perform discrete analyses that are susceptible to false positives (and false negatives). knowing this, increasingly sophisticated fraudsters have developed a variety of ways to exploit the weaknesses of discrete analysis.
graph databases , on the other hand, offer new methods of uncovering fraud rings and other complex scams with a high level of accuracy through advanced contextual link analysis, and they are capable of stopping advanced fraud scenarios in real time.
in this “graph databases in the enterprise” series, we’ll explore the most impactful and profitable use cases of graph database technologies at the world’s leading organizations. this week, we’ll take a closer look at fraud detection.
the key challenges in fraud detection
between the enormous amounts of data available for analysis and today’s experienced fraud rings (and solo fraudsters), fraud detection professionals are beset with challenges. here are some of their biggest:
- complex link analysis to discover fraud patterns uncovering fraud rings requires you to traverse data relationships with high computational complexity – a problem that’s exacerbated as a fraud ring grows.
- detect and prevent fraud as it happens to prevent a fraud ring, you need real-time link analysis on an interconnected dataset, from the time a false account is created to when a fraudulent transaction occurs.
- evolving and dynamic fraud rings fraud rings are continuously growing in shape and size, and your application needs to detect these fraud patterns in this highly dynamic and emerging environment.
overcoming fraud detection challenges with graph databases
while no fraud prevention measures are perfect, significant improvements occur when you look beyond individual data points to the connections that link them .
understanding the connections between data, and deriving meaning from these links, doesn’t necessarily mean gathering new data. you can draw significant insights from your existing data simply by reframing the problem in a new way: as a graph .
unlike most other ways of looking at data, graphs are designed to express relatedness. graph databases uncover patterns that are difficult to detect using traditional representations such as tables. an increasing number of companies use graph databases to solve a variety of connected data problems, including fraud detection .
example: e-commerce fraud
as our lives become increasingly digital, a growing number of financial transactions are conducted online. fraudsters have adapted quickly to this trend and have devised clever ways to defraud online payment systems.
while this type of activity can and does involve criminal rings, even a single well-informed fraudster can create a large number of synthetic identities and to carry out sizeable schemes.
consider an online transaction with the following identifiers: user id, ip address, geo location, a tracking cookie and a credit card number. typically, the relationships between these identifiers should be (almost) one-to-one. some variations naturally account for shared machines, families sharing a single credit card number, individuals using multiple computers and the like.
however, as soon as the relationships between these variables exceed a reasonable number, fraud should be considered as a strong possibility. the more interconnections exist amongst identifiers, the greater the cause for concern. large and tightly-knit graphs are very strong indicators that fraud is taking place.
see the graphic below for an example:
a graph of a series of transactions from different ip addresses with a likely fraud event occurring from ip1, which has carried out multiple transactions with five different credit cards.
by putting checks into place and associating them with the appropriate event triggers, such schemes can be uncovered before they are able to inflict significant damage.
triggers can include events such as logging in, placing an order or registering a credit card – any of which can cause the transaction to be evaluated against the fraud graph. fan-out might be skipped, but complex graphs can be flagged as a possible instance of fraud.
when it comes to graph-based fraud detection , you need to augment your fraud detection capability with link analysis. that being said, two points are clear:
- as business processes become faster and more automated, the time margins for detecting fraud are narrowing, increasing the need for a real-time solution.
- traditional technologies are not designed to detect elaborate fraud rings. graph databases add value through analysis of connected data points.
graph databases are the ideal enabler for efficient and manageable fraud detection solutions. from fraud rings and collusive groups, to educated criminals operating on their own, graph databases uncover a variety of important fraud patterns – and all in real time.
written by jim webber and ian robinson for neo4j.
Published at DZone with permission of Andreas Kollegger, DZone MVB. See the original article here.
Opinions expressed by DZone contributors are their own.