Money laundering is a major global problem, enabling criminal organisations to hide their ill-gotten gains and to finance further operations. Prevention of money laundering is seen as a high priority by many governments, however detection of money laundering without prior knowledge of predicate crimes remains a significant challenge. Previous detection systems have tended to focus on individuals, considering transaction histories and applying anomaly detection to identify suspicious behaviour. However, money laundering involves groups of collaborating individuals, and evidence of money laundering may only be apparent when the collective behaviour of these groups is considered. In this paper we describe a detection system that is capable of analysing group behaviour, using a combination of network analysis and supervised learning. This system is designed for real-world application and operates on networks consisting of millions of interacting parties. Evaluation of the system using real-world data indicates that suspicious activity is successfully detected. Importantly, the system exhibits a low rate of false positives, and is therefore suitable for use in a live intelligence environment.
Taking the structural considerations even further, the systems described in @cite_5 @cite_16 aim to identify subgraphs within a network that closely match known typologies . In these systems, the use of fuzzy matching means that subgraphs may deviate in some way from the given typology, providing greater flexibility than a simple motif search.
@cite_5 @cite_16
2114755068 1482947703
In this paper, we present a clique-based method for mining fuzzy graph patterns of money laundering and financing terrorism. The method will contribute to a new generation of intelligent anti-money laundering systems that incorporate comprehensive information from various information sources as well as from human subject matter experts. A fuzzy degree of confidence can therefore be associated to each relation between any two actors in a graph of transactions. We reduce the problem of fuzzy subgraph isomorphism to the problem of finding a fuzzy set of maximal cliques in a fuzzy extension of a mathematical construct that is similar to Vizing's modular product of graphs. Suspicious transaction detection is used to report banking transactions that may be connected with criminal activities. Obviously, perpetrators of criminal acts strive to make the transactions as innocent-looking as possible. Because activities such as money laundering may involve complex organizational schemes, machine learning techniques based on individual transactions analysis may perform poorly when applied to suspicious transaction detection. In this paper, we propose a new machine learning method for mining transaction graphs. The method proposed in this paper builds a model of subgraphs that may contain suspicious transactions. The model used in our method is parametrized using fuzzy numbers which represent parameters of transactions and of the transaction subgraphs to be detected. Because money laundering may involve transferring money through a variable number of accounts the model representing transaction subgraphs is also parametrized with respect to some structural features. In contrast to some other graph mining methods in which graph isomorphisms are used to match data to the model, in our method we perform a fuzzy matching of graph structures.