Reciprocal payers identification in banking logs using SAT solvers
Sandro Skansi, Branimir Dropuljić · 2016
In this paper we presented solvers for satisfiability testing (SAT) as a novel approach to finding reciprocal payers in banking logs. A term “reciprocal payers” is usually treated as general fraud by using standard techniques such as expert systems, machine learning and in recent times social network analysis. SAT as a technique for data analysis was abandoned due to the unfeasibility of SAT solvers. SAT solvers, however continued to develop in the hardware and software verification communities. We presented a proof-of-concept solution for identification of reciprocal payers (formally called a clique), which is a group of bank clients that issue payments to each other (each member to each member). We do not use real data due to client confidentiality, but the reader can see the principle. In the basic approach it is assumed that each client has only one account, and in the extended, second approach, it was allowed that a client can have more than one account.