2016 IEEE 22nd International Conference on Parallel and Distributed Systems (ICPADS) 2016
DOI: 10.1109/icpads.2016.0140
|View full text |Cite
|
Sign up to set email alerts
|

PFrauDetector: A Parallelized Graph Mining Approach for Efficient Fraudulent Phone Call Detection

Abstract: Abstract-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… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
9
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
4
3
2

Relationship

0
9

Authors

Journals

citations
Cited by 9 publications
(9 citation statements)
references
References 11 publications
0
9
0
Order By: Relevance
“…, n are used simultaneously. [1,2], [1,2,3], [1,2,3,4], [1,2,3,4,5], [1,2,3,4,5,6] five various multi-scale convolution kernels are selected for our experiments, and the number of convolution kernels is 150, 100, 75, 60, and 50 corresponding to them, respectively. The product of the convolution kernel of each scale and the number of kernels is equal to the output size of the hidden layer.…”
Section: Parametric Experimentsmentioning
confidence: 99%
See 1 more Smart Citation
“…, n are used simultaneously. [1,2], [1,2,3], [1,2,3,4], [1,2,3,4,5], [1,2,3,4,5,6] five various multi-scale convolution kernels are selected for our experiments, and the number of convolution kernels is 150, 100, 75, 60, and 50 corresponding to them, respectively. The product of the convolution kernel of each scale and the number of kernels is equal to the output size of the hidden layer.…”
Section: Parametric Experimentsmentioning
confidence: 99%
“…There are also researchers using deep learning methods [3] to replace artificial features with automatic features, which improves the recognition accuracy of fraudulent calls and ensures timeliness. Ying et al [4] proposed an efficient fraud phone detection framework based on parallel graph mining, which can automatically label fraudulent phone numbers to generate phone number trust values. However, the above methods rely on a large amount of user behavior data and are unable to detect the semantics of the phone content, which results in the inability to identify a new phone number.…”
Section: Introductionmentioning
confidence: 99%
“…It only constructed a classifier for the call behavior features of a fraudulent phone call, but did not analyze the phone number features of the fraudulent phone call, and the accuracy of the algorithm was only 76%. Other researchers like [7,8,19,20] chose to use Decision Tree, Naive Bayesian models, graph mining, and other approaches [21][22][23] to classify and analyze call behavior features.…”
Section: Related Workmentioning
confidence: 99%
“…These bipartite structures are captured by bipartite graphs, which are rich data models that provide full representation without information loss for interactions that naturally occur in one mode (compressed datasets as unipartite graphs [128]), or multiple modes (high order interconnections as hyper graphs [5,57,114]). A prevalent use case is where bipartite graphs capture the interactions of users with entities spanning different domains such as social networks (users-hashtags [122]), web-based services (users-websites, multimedia services, and products [58,102,105,112,117]), financial systems (users-donation campaigns [4]), transportation systems (users-registered vehicles [59]), and communication systems (users-phone calls [120]).…”
Section: Introductionmentioning
confidence: 99%