PFrauDetector: a parallelized graph mining approach for efficient fraudulent phone call detection

PFrauDetector: a parallelized graph mining approach
for efficient fraudulent phone call detection

In recent years, fraud is becoming more rampant internationally with the development of modern technology and global communication. Due to the rapid growth in the volume of call logs, the task of fraudulent phone call detection is confronted with Big Data issues in real-world implementations. While our previous work, FrauDetector, has addressed this problem and achieved some promising results, it can be further enhanced as it focuses on the fraud detection accuracy while the efficiency and scalability are not on the top priority. Meanwhile, other known
approaches suffer from long training time and/or cannot
accurately detect fraudulent phone calls in real time. In this paper, we propose a highly- efficient parallelized graph-miningbased fraudulent phone call detection framework, namely PFrauDetector, which is able to automatically label fraudulent phone numbers with a 'fraud' tag, a crucial prerequisite for distinguishing fraudulent phone call numbers from the normal ones. PFrauDetector generates smaller, more manageable subnetworks
from the original graph and performs a parallelized
weighted HITS algorithm for significant speed acceleration in the graph learning module. It adopts a novel aggregation approach to generate the trust (or experience) value for each phone number (or user) based on their respective local values. We conduct a comprehensive experimental study based on a real dataset collected through an anti-fraud mobile application, Whoscall. The results demonstrate a significantly improved efficiency of our approach compared to FrauDetector and superior performance against other major classifier-based methods.

© 2016 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.