Multilayered Approach for Identity Crime Detection system

Abstract

Identity crime is well known, prevalent, and costly, and credit application scam is a specific case of identity crime. The methods communal detection (CD) and spike detection (SD) are unsupervised algorithms. CD finds real social relationships to reduce the suspicion score, and is tamper resistant to synthetic social relationships. It is the white list-oriented approach on a fixed set of attributes. SD finds spikes in duplicates to increase the suspicion score, and is probe-resistant for attributes. It is the attribute-oriented approach on a variable-size set of attributes. Together, CD and SD can detect more types of attacks, better account for changing legal behaviour, and remove the redundant attributes the work here is motivated by identity crime detection or more specifically, credit application fraud detection (Phua et al. 2005), also known as white-collar crime. Data stream mining involves detecting real-time patterns to produce accurate suspicion scores which are indicative of anomalies. At the same time, the detection system has to handle continuous and rapid examples also known as records tuples, and instances where the recent examples have no class-labels.

Country : India

1 Ashwini Mote2 Nitu Pariyal

  1. Student, MGM College of Engineering, Nanded, Maharashtra, India
  2. Professor, CSE Department, MGM College of Engineering, Nanded, Maharashtra, India

IRJIET, Volume 2, Issue 3, May 2018 pp. 27-30

References

  1. Clifton Phau, Member IEEE, Kate Smith-Miles, Senior Member IEEE, Vincent Cheng-Siong Lee, and Ross Gayler “Resilient Identity Crime Detection”, IEEE Transactions on, vol.24, no.3, 2012.
  2. A.K. Racheal Praveena, Dr.G.Venkata RamiReddi C.K     Suresh Babu, “A Secure Mechanism for Resilient Of Data Mining Based Fraud Detection”, International               Journal on Computer Science and Network Solution, ISSN: 2345-3397, Volume: 1, No3, Nov 2013.
  3. R. Bolton and D. Hand, “Unsupervised Profiling Methods for Fraud Detection”, Statistical Science, vol. 17, no. 3 pp.235-255, 2001.
  4. Zakia Ferdaousi and Akira Maeda A.J., “Anomaly Detection Using Unsupervised Profiling Methods in Time Series Data”, 525-8577, Japan.
  5. P.Christen and K. Goiser, “Quality and Complexity Measures for Data Linkage and Deduplication”, Quality Mearures in Data Mining F.Guillet and H.Hamilton, eds.,vol 43, Springer, doi 10.1007/978-3-540-44918-8, 2007.
  6. Bifet and R. Kirkby.Massive Online Analysis, Technical.Univ. of Waikato, 2009.
  7. Cortes, D. Pregibon, and C. Volinsky, “Computational Methods for Dynamic Graphs”, J. Computational and Graphical Statistics, vol.12, no.4, pp.950-970, 2003.
  8. T. Fawcett, “An Introduction to ROC Analysis,” Pattern Recognition Letters, vol. 27, pp. 861-874, 2006, doi:10.1016/j.patrec.2005.10.010.
  9. O. Kursun, A. Koufakou, B. Chen, M.Georgiopoulos, K.Reynolds, and R. Eaglin, “A Dictionary Based Approach to Fast and Accurate Name Matching in Large Law Enforcement Databases,” Proc. IEEE Int’l Conf. (ISI ‘06),pp.72-82, doi:10.1007/11760146, 2006.
  10. J. Jonas, “Non-Obvious Relationship Awareness,” Proc. Identity mashup, 2006.
  11. M. Kantarcioglu, W. Jiang, and B. Malin, “A Privacy –       Preserving Framework for Integrating Person-Specific databases,” proc. UNESCO Chair in Data privacy Int’1 Conf. Privacy in Statistical Databases(PSD’08), pp.298- 314, doi:10.1007/978-3-540- 87471-3_25, 2006.
  12. J. Kleinberg, Data Stream Management: Processing High-Speed Data Streams, Springer, 2005.