A Comparative Study on Crime in Denver City Based on Machine Learning and Data Mining

• URL: http://arxiv.org/abs/2001.02802v1
• Date: Thu, 9 Jan 2020 01:36:11 GMT
• Title: A Comparative Study on Crime in Denver City Based on Machine Learning and Data Mining
• Authors: Md. Aminur Rab Ratul
• Abstract summary: I analyzed a real-world crime and accident dataset of Denver county, USA, from January 2014 to May 2019. This project aims to predict and highlights the trends of occurrence that will, in return, support the law enforcement agencies and government to discover the preventive measures. The outcomes are captured using two popular test methods: train-test split, and k-fold crossvalidation.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: To ensure the security of the general mass, crime prevention is one of the most higher priorities for any government. An accurate crime prediction model can help the government, law enforcement to prevent violence, detect the criminals in advance, allocate the government resources, and recognize problems causing crimes. To construct any future-oriented tools, examine and understand the crime patterns in the earliest possible time is essential. In this paper, I analyzed a real-world crime and accident dataset of Denver county, USA, from January 2014 to May 2019, which containing 478,578 incidents. This project aims to predict and highlights the trends of occurrence that will, in return, support the law enforcement agencies and government to discover the preventive measures from the prediction rates. At first, I apply several statistical analysis supported by several data visualization approaches. Then, I implement various classification algorithms such as Random Forest, Decision Tree, AdaBoost Classifier, Extra Tree Classifier, Linear Discriminant Analysis, K-Neighbors Classifiers, and 4 Ensemble Models to classify 15 different classes of crimes. The outcomes are captured using two popular test methods: train-test split, and k-fold cross-validation. Moreover, to evaluate the performance flawlessly, I also utilize precision, recall, F1-score, Mean Squared Error (MSE), ROC curve, and paired-T-test. Except for the AdaBoost classifier, most of the algorithms exhibit satisfactory accuracy. Random Forest, Decision Tree, Ensemble Model 1, 3, and 4 even produce me more than 90% accuracy. Among all the approaches, Ensemble Model 4 presented superior results for every evaluation basis. This study could be useful to raise the awareness of peoples regarding the occurrence locations and to assist security agencies to predict future outbreaks of violence in a specific area within a particular time.

Related papers

• CrimeAlarm: Towards Intensive Intent Dynamics in Fine-grained Crime Prediction [18.978423228112856]
  This paper proposes a fine-grained sequential crime prediction framework, CrimeAlarm, that equips with a novel mutual distillation strategy inspired by curriculum learning. Experiments show that CrimeAlarm outperforms state-of-the-art methods in terms of NDCG@5, with improvements of 4.51% for the NYC16 and 7.73% for the CHI18 in accuracy measures.
  arXiv  Detail & Related papers  (2024-04-10T05:44:28Z)
• A Comparative Analysis of Multiple Methods for Predicting a Specific Type of Crime in the City of Chicago [0.9799637101641152]
  We aim to answer the question: "How well can we predict theft using spatial and temporal features?" XBoost showed the best results with an F1-score of 0.86.
  arXiv  Detail & Related papers  (2023-04-26T11:35:06Z)
• Backdoor Attacks on Crowd Counting [63.90533357815404]
  Crowd counting is a regression task that estimates the number of people in a scene image. In this paper, we investigate the vulnerability of deep learning based crowd counting models to backdoor attacks.
  arXiv  Detail & Related papers  (2022-07-12T16:17:01Z)
• A Unified Evaluation of Textual Backdoor Learning: Frameworks and Benchmarks [72.7373468905418]
  We develop an open-source toolkit OpenBackdoor to foster the implementations and evaluations of textual backdoor learning. We also propose CUBE, a simple yet strong clustering-based defense baseline.
  arXiv  Detail & Related papers  (2022-06-17T02:29:23Z)
• Spatial-Temporal Hypergraph Self-Supervised Learning for Crime Prediction [60.508960752148454]
  This work proposes a Spatial-Temporal Hypergraph Self-Supervised Learning framework to tackle the label scarcity issue in crime prediction. We propose the cross-region hypergraph structure learning to encode region-wise crime dependency under the entire urban space. We also design the dual-stage self-supervised learning paradigm, to not only jointly capture local- and global-level spatial-temporal crime patterns, but also supplement the sparse crime representation by augmenting region self-discrimination.
  arXiv  Detail & Related papers  (2022-04-18T23:46:01Z)
• Towards Adversarial Patch Analysis and Certified Defense against Crowd Counting [61.99564267735242]
  Crowd counting has drawn much attention due to its importance in safety-critical surveillance systems. Recent studies have demonstrated that deep neural network (DNN) methods are vulnerable to adversarial attacks. We propose a robust attack strategy called Adversarial Patch Attack with Momentum to evaluate the robustness of crowd counting models.
  arXiv  Detail & Related papers  (2021-04-22T05:10:55Z)
• The effect of differential victim crime reporting on predictive policing systems [84.86615754515252]
  We show how differential victim crime reporting rates can lead to outcome disparities in common crime hot spot prediction models. Our results suggest that differential crime reporting rates can lead to a displacement of predicted hotspots from high crime but low reporting areas to high or medium crime and high reporting areas.
  arXiv  Detail & Related papers  (2021-01-30T01:57:22Z)
• Distribution-Free, Risk-Controlling Prediction Sets [112.9186453405701]
  We show how to generate set-valued predictions from a black-box predictor that control the expected loss on future test points at a user-specified level. Our approach provides explicit finite-sample guarantees for any dataset by using a holdout set to calibrate the size of the prediction sets.
  arXiv  Detail & Related papers  (2021-01-07T18:59:33Z)
• Prediction of Homicides in Urban Centers: A Machine Learning Approach [0.8312466807725921]
  This research presents a machine learning model to predict homicide crimes, using a dataset that uses generic data. Analyses were performed with simple and robust algorithms on the created dataset. Results are considered as a baseline for the proposed problem.
  arXiv  Detail & Related papers  (2020-08-16T19:13:53Z)
• Crime Prediction Using Spatio-Temporal Data [8.50468505606714]
  Supervised learning technique is used to predict crimes with better accuracy. The proposed system is feed with a criminal-activity data set of twelve years of San Francisco city.
  arXiv  Detail & Related papers  (2020-03-11T16:19:19Z)
• A Rule-Based Model for Victim Prediction [1.8199326045904993]
  This paper aims to compare the list of focused deterrence strategy with the VIPAR score list regarding their predictive power for the future shooting victimizations. We use age, past criminal history, and peer influence as the main predictors of future violence. Our empirical results show that VIPAR scores predict 25.8% of future shooting victims and 32.2% of future shooting suspects, whereas focused deterrence list predicts 13% of future shooting victims and 9.4% of future shooting suspects.
  arXiv  Detail & Related papers  (2020-01-06T04:29:59Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.