Volume : 4, Issue : 4, APR 2020

AN EFFECTIVE APPROACH OF FORECASTING FOR CRIME DATA

Sharmila A, Vijaya Kannan CD, Nandha Kumar K, Gnana Baskaran A

Abstract

The Crime analysis is a methodical approach for identifying and analyzing patterns and trends in crime. With the increasing origin of computerized systems, crime data analysts can help the Law enforcement officers to speed up the process of solving crimes. Using the concept of data mining, we can analyze previously unknown, useful information from an unstructured data. Predictive policing means, using analytical and predictive techniques, to identify criminal and it has been found to be pretty much effective in doing the same. Because of the increased crime rate over the years, we will have to handle a huge amount of crime data stored in warehouses which would be very difficult to be analyzed manually, and also now a day's, criminals are becoming technologically advance, so there is need to use advance technologies in order to keep police ahead of them. In this work, the main focus is on the review of Breath First Search Sensitive Hashing algorithms and techniques used for identify the criminals. Intelligent crime data analysis provides the best understanding of the dynamics of unlawful activities, discovering patterns of criminal behaviour that will be useful to understand where, when and why crimes can occur. There is a need for the advancements in the data storage collection, analysis and algorithm that can handle data and yield high accuracy. This paper demonstrates the data mining technologies which are used in criminal investigation. The contribution of this paper is to highlight the methodology used in crime data analytics. This paper summarizes the challenges arising during the analysis process, which should be removed to get the desired result.

Keywords

Net beans, JDK, LSH Record Linkage.

Article : Download PDF

Cite This Article

Article No : 7

Number of Downloads : 1

References

  1. Gandomi and M. Haider, (2015) “Beyond the hype: Big data concepts, methods, and analytics,'' Int. J. Inf. Manage., Vol. 35, no. 2, pp.137-144, Apr. 2015.
  2. Hassani, X. Huang, E. S. Silva, and M. Ghodsi (2016), "A review of data mining applications in crime," Statistical Analysis and Data Mining: The ASA Data Science Journal, Vol. 9, pp. 139-154.
  3. Aggarwal and P. Yu, (2015) “The igrid index: Reversing the dimensionality curse for similarity indexing in high dimensional space” in Proc. 6th    ACM Int. Conf. Knowl Discov. Data Mining, pp. 119–129.
  4. Al-Lawati, D. Lee, and P. McDaniel, (2016) “Blocking-aware private Crime Record linkage,” in Proc. 2nd Int. Workshop Inf. Quality Inf. Syst., pp. 59–68.
  5. Andoni and P. Indyk, (2018) “Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions,” Commun. ACM, Vol. 51, no. 1, pp. 117–122,
  6. Bonomi, L. Xiong, R. Chen, and B. C. M. Fung, (2014) “Frequent grams based embedding for privacy preserving Crime Record linkage,” in Proc. 21st ACM Int. Conf. Inf. Knowl. Manager, pp. 1597–1601.
  7. Z. Broder, M. Charikar, A. Frieze, and M. Mitzenmacher, (2016) “Minwise independent permutations,” in Proc. 30th ACM Symp. Theory Comput., pp. 327–336.
  8. Christen, (2015)”Data Matching-Concepts and Techniques for Crime RecordLinkage, Entity Resolution, and Duplicate Detection (Data-centric systems and applications)”.                                                     New   York, NY, USA: Springer.
  9. Christen, (2017) “A survey of indexing techniques for scalable Crime Record linkage and deduplication,” IEEE Trans. Knowl. Data Eng., Vol. 12, no. 9, pp. 1537-1555.
  10. Churches and P. Christen, (2016) “Some methods for blindfolded Crime Record linkage,” BMC Informat. Decision Making, Vol. 4, pp. 9.
  11. Cohen and J. Richman, (2018), “Learnin to match and cluster large high-dimensional datasets for data integration,” in Proc. ACM Int. Conf. Knowl. Discov DataMining, pp. 475–480.
  12. Dachman-Soled, T. Malkin, M. Raykova, and M. Yung, (2014) “Efficient robust private set intersection,” in Proc. 7th Int. Conf. Appl. Cryptography Netw. Security, pp 125–142.
  13. Datar, N. Immorlica, P. Indyk, an V. Mirrokni, (2014) “Locality-sensitive hashing scheme based on p-stable distributions,” in Proc. 20th Symp.Comput. Geometry, pp. 253–262.
  14. Durham, (2017) “A framework for accurate efficient private Crime Record linkage,” Ph.D. dissertation, Faculty of the Graduate School, Vanderbilt University, Nashville, TN, USA.
  15. Dwork, (2016) “Differential privacy,” in Proc. 33rd Int. Colloquium, pp. 1–12.
  16. Erkin, M. Franz, J. Guajardo, S. Katzenbeisser, I. Lagendijk, and T. Toft, (2018) “Privacy-preserving face recognition,” in Proc. 9th Int. Symp. Privacy Enhancing Technology, pp. 235–253.
  17. Faloutsos and K. Lin, (2015) “Fastmap: A fast algorithm for indexing, data-mining and visualization of traditional and multimedia datasets,” in Proc. ACM Int. Conf. Manage Data, pp. 163–174.
  18. Gabriela and F. Martin, (2017) “Cluster preserving embedding of proteins,” Dept. Comput. Sci., Center Discrete Math. Theor. Comput. Sci., Rutgers Univ., Piscataway, NJ, USA, Tech. Rep. 99-50.