|標題:||FrauDetector(+): An Incremental Graph-Mining Approach for Efficient Fraudulent Phone Call Detection|
|作者:||Ying, Josh Jia-Ching|
Tseng, Vincent S.
Department of Computer Science
|關鍵字:||Telecommunication fraud;trust value mining;fraudulent phone call detection;incremental learning;parallelized weighted HITS algorithm|
|摘要:||In recent years, telecommunication fraud has become more rampant internationally with the development of modern technology and global communication. Because of 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. Although our previous work, FrauDetector, addressed this problem and achieved some promising results, it can be further enhanced because it focuses only on fraud detection accuracy, whereas the efficiency and scalability are not top priorities. Other known approaches for fraudulent call number detection suffer from long training times or cannot accurately detect fraudulent phone calls in real time. However, the learning process of FrauDetector is too time-consuming to support real-world application. Although we have attempted to accelerate the the learning process of FrauDetector by parallelization, the parallelized learning process, namely PFrauDetector, still cannot afford the computing cost. In this article, we propose a highly efficient incremental graph-mining-based fraudulent phone call detection approach, namely FrauDetectoe , which can automatically label fraudulent phone numbers with a "fraud" tag a crucial prerequisite for distinguishing fraudulent phone call numbers from nonfraudulent ones. FratiDetectoe initially generates smaller, more manageable subnetworks from original graph and performs a parallelized weighted HITS algorithm for a significant speed increase in the graph learning module. It adopts a novel aggregation approach to generate a trust (or experience) value for each phone number (or user) based on their respective local values. After the initial procedure, we can incrementally update the trust (or experience) value for each phone number (or user) while a new fraud phone number is identified. An efficient fraud-centric hash structure is constructed to support fast real-time detection of fraudulent phone numbers in the detection module. We conduct a comprehensive experimental study based on real datasets collected through an antifraud mobile application called Whoscall. The results demonstrate a significantly improved efficiency of our approach compared with FrauDetector as well as superior performance against other major classifier-based methods.|
|期刊:||ACM TRANSACTIONS ON KNOWLEDGE DISCOVERY FROM DATA|
|Appears in Collections:||Articles|