Detection of Mobile Phone Fraud Using Possibilistic Fuzzy C-Means Clustering and Hidden Markov Model

2016 ◽  
Vol 7 (2) ◽  
pp. 23-44 ◽  
Author(s):  
Sharmila Subudhi ◽  
Suvasini Panigrahi ◽  
Tanmay Kumar Behera

This paper presents a novel approach for fraud detection in mobile phone networks by using a combination of Possibilistic Fuzzy C-Means clustering and Hidden Markov Model (HMM). The clustering technique is first applied on two calling features extracted from the past call records of a subscriber generating a behavioral profile for the user. The HMM parameters are computed from the profile, which are used to generate some profile sequences for training. The trained HMM model is then applied for detecting fraudulent activities on incoming call sequences. A calling instance is detected as forged when the new sequence is not accepted by the trained model with sufficiently high probability. The efficacy of the proposed system is demonstrated by extensive experiments carried out with Reality Mining dataset. Furthermore, the comparative analysis performed with other clustering methods and another approach recently proposed in the literature justifies the effectiveness of the proposed algorithm.

1990 ◽  
Vol 26 (18) ◽  
pp. 1530 ◽  
Author(s):  
B.-S. Jeng ◽  
M.-W. Chang ◽  
S.-W. Sun ◽  
C.-H. Shih ◽  
T.-M. Wu

Author(s):  
Pardeep Kumar ◽  
Nitin ◽  
Vivek Sehgal ◽  
Kinjal Shah ◽  
Shiv Shankar Prasad Shukla ◽  
...  

2016 ◽  
Vol 23 (3) ◽  
pp. 571-582 ◽  
Author(s):  
Dulal Acharjee ◽  
S. P. Maity ◽  
Amitava Mukherjee

Sensors ◽  
2019 ◽  
Vol 19 (10) ◽  
pp. 2341 ◽  
Author(s):  
Cheng Wang ◽  
Hee Yong Youn

The usage of multiple flow tables (MFT) has significantly extended the flexibility and applicability of software-defined networking (SDN). However, the size of MFT is usually limited due to the use of expensive ternary content addressable memory (TCAM). Moreover, the pipeline mechanism of MFT causes long flow processing time. In this paper a novel approach called Agg-ExTable is proposed to efficiently manage the MFT. Here the flow entries in MFT are periodically aggregated by applying pruning and the Quine–Mccluskey algorithm. Utilizing the memory space saved by the aggregation, a front-end ExTable is constructed, keeping popular flow entries for early match. Popular entries are decided by the Hidden Markov model based on the match frequency and match probability. Computer simulation reveals that the proposed scheme is able to save about 45% of space of MFT, and efficiently decrease the flow processing time compared to the existing schemes.


Sign in / Sign up

Export Citation Format

Share Document