Skip to main content

Revealing Abnormality Based on Hybrid Clustering and Classification Approach

(RA-HC-CA)

  • Conference paper
  • First Online:
Innovations in Bio-Inspired Computing and Applications (IBICA 2018)

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 939))

Abstract

Abnormality Detection is the process of locating abnormal instances within the data. In this work, we have applied Abnormality Detection to the domain of detection associated with Credit Card Fraud. This problem is actually attributed to demonstrating those credit card transactions which have occurred in the earlier times, with the presence of awareness related to those instances, which are actually fraud ones. Applying this model, we can use it to predict if a new transaction is a fraud based or not. In this proposed work, we have utilized a combination framework of data mining clustering algorithms so as to solve the problem of credit card fraud detection to a particular extent. The proposed work Revealing Abnormality Based on Hybrid Clustering and Classification Approach (RA-HC-CA) consists of two stages namely a clustering phase followed by a detection phase. In the clustering phase, we have employed a combined clustering approach initiated by k-means clustering algorithm followed by hierarchical clustering algorithm. Prior to Hierarchical/Agglomerative clustering, the whole data set is clustered into meaningful ‘k’ knots by k-means clustering procedure. The output of ‘k’ groups is then inputted to Agglomerative clustering algorithm to merge the already obtained ‘k’ clusters from the previous phase, into more meaningful clusters. This is continued until 70–75% of data falls on one large group, which is the Normal group. The remaining data instances may converge in various other abnormal groups. The strong assumption made here is that such clusters with less instances, than a particular threshold are considered to be groups pertaining to fraud ones. Then, so as to check for the presence of an instance as fraud one, we initially identify the proximate gathering to which it fit into. Then, within that identified cluster, LDA (Linear Discriminant Analysis) is carried out. It has been observed that the proposed approach (RA-HC-CA) achieved 80.5% accuracy in comparison with various other existing methods.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Guha, S., Rastogi, R., Shim, K.: CURE: an efficient clustering algorithm for large databases. In: SIGMOD 1998 Proceedings of the 1998 ACM SIGMOD International Conference on Management of Data, vol. 26, pp. 35–58 (2001)

    Google Scholar 

  2. Brause, R., Langsdorf, T., Hepp, M.: Neural data mining for credit card fraud detection. In: Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence (2002)

    Google Scholar 

  3. Aleskerov, E., Freisleben, B., Rao, B.: CARDWATCH: a neural network based data base mining system for credit card fraud detection. In: Proceedings of the IEEE/IAFE 1997 Computational Intelligence for Financial Engineering (2002)

    Google Scholar 

  4. Srivastava, A., Kundu, A., Sural, S., Majumdar, A.: Credit card fraud detection using hidden Markow model. IEEE Trans. Dependable Secure Comput. 5, 37–48 (2008)

    Article  Google Scholar 

  5. Raj, S.B.E., Portia, A.A.: Analysis on credit card fraud detection methods. In: International Conference on Computer, Communication and Electrical Technology (2011)

    Google Scholar 

  6. Welling, M.: Fisher linear discriminant analysis. Department of Computer Science, University of Toronto (2005)

    Google Scholar 

  7. Ashok, A., Smitha, S., Krishna, M.H.K.: Attribute reduction based anomaly detection scheme by clustering dependent oversampling PCA. In: International Conference on Advances in Computing, Communications and Informatics (2016)

    Google Scholar 

  8. Rao, V.M., Singh, Y.P.: Decision tree induction for financial fraud detection using ensemble learning technique. In: Proceeding of the International Conference on Artificial Intelligence in Computer Science and ICT (2013)

    Google Scholar 

  9. PrathibhaMol, C.P., Suresh, A., Suresh, G.: Prediction of cardiac arrhythmia type using clustering and regression approach (P-CA-CRA). In: International Conference on Advances in Computing, Communications and Informatics (ICACCI) (2017)

    Google Scholar 

  10. Harikumar, S., Surya, P.V.: K-medoid clustering for heterogeneous datasets. Proc. Comput. Sci. 70, 226–237 (2015)

    Article  Google Scholar 

  11. Harikumar, S., Dilipkumar, D.U.: Apriori algorithm for association rule mining in high dimensional data. In: International Conference on Data Science and Engineering (ICDSE), pp. 1–6. IEEE (2016)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to C. P. Prathibhamol .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Prathibhamol, C.P., Ashok, A. (2019). Revealing Abnormality Based on Hybrid Clustering and Classification Approach. In: Abraham, A., Gandhi, N., Pant, M. (eds) Innovations in Bio-Inspired Computing and Applications. IBICA 2018. Advances in Intelligent Systems and Computing, vol 939. Springer, Cham. https://doi.org/10.1007/978-3-030-16681-6_38

Download citation

Publish with us

Policies and ethics