If it Bleeds, it Leads: A Computational Approach to Covering Crime in Los Angeles

• URL: http://arxiv.org/abs/2206.07115v1
• Date: Tue, 14 Jun 2022 19:06:13 GMT
• Title: If it Bleeds, it Leads: A Computational Approach to Covering Crime in Los Angeles
• Authors: Alexander Spangher and Divya Choudhary
• Abstract summary: We present a machine-in-the-loop system that covers individual crimes by learning the prototypical coverage archetypes from classical news articles on crime to learn their structure. We hope our work can lead to systems that use these components together to form the skeletons of news articles covering crime.
• Score: 79.4098551457605
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Developing and improving computational approaches to covering news can increase journalistic output and improve the way stories are covered. In this work we approach the problem of covering crime stories in Los Angeles. We present a machine-in-the-loop system that covers individual crimes by (1) learning the prototypical coverage archetypes from classical news articles on crime to learn their structure and (2) using output from the Los Angeles Police department to generate "lede paragraphs", first structural unit of crime-articles. We introduce a probabilistic graphical model for learning article structure and a rule-based system for generating ledes. We hope our work can lead to systems that use these components together to form the skeletons of news articles covering crime. This work was done for a class project in Jonathan May's Advanced Natural Language Processing Course, Fall, 2019.

Related papers

• SCStory: Self-supervised and Continual Online Story Discovery [53.72745249384159]
  SCStory helps people digest rapidly published news article streams in real-time without human annotations. SCStory employs self-supervised and continual learning with a novel idea of story-indicative adaptive modeling of news article streams.
  arXiv  Detail & Related papers  (2023-11-27T04:50:01Z)
• Can Sensitive Information Be Deleted From LLMs? Objectives for Defending Against Extraction Attacks [73.53327403684676]
  We propose an attack-and-defense framework for studying the task of deleting sensitive information directly from model weights. We study direct edits to model weights because this approach should guarantee that particular deleted information is never extracted by future prompt attacks. We show that even state-of-the-art model editing methods such as ROME struggle to truly delete factual information from models like GPT-J, as our whitebox and blackbox attacks can recover "deleted" information from an edited model 38% of the time.
  arXiv  Detail & Related papers  (2023-09-29T17:12:43Z)
• Crime Prediction using Machine Learning with a Novel Crime Dataset [0.0]
  Bangladesh has a high crime rate due to poverty, population growth, and many other socio-economic issues. For law enforcement agencies, understanding crime patterns is essential for preventing future criminal activity. This paper introduces a novel crime dataset that contains temporal, geographic, weather, and demographic data about 6574 crime incidents of Bangladesh.
  arXiv  Detail & Related papers  (2022-11-03T01:55:52Z)
• 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)
• Breaking Writer's Block: Low-cost Fine-tuning of Natural Language Generation Models [62.997667081978825]
  We describe a system that fine-tunes a natural language generation model for the problem of solving Writer's Block. The proposed fine-tuning obtains excellent results, even with a small number of epochs and a total cost of USD 150.
  arXiv  Detail & Related papers  (2020-12-19T11:19:11Z)
• 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)
• Modeling Subjective Assessments of Guilt in Newspaper Crime Narratives [9.589175887215585]
  SuspectGuilt is a Corpus of annotated crime stories from English-language newspapers in the U.S. For SuspectGuilt, annotators read short crime articles and provided text-level ratings concerning the guilt of the main suspect. We use SuspectGuilt to train and assess predictive models, and show that these models benefit from genre pretraining and joint supervision.
  arXiv  Detail & Related papers  (2020-06-17T01:21:19Z)
• Imitation Attacks and Defenses for Black-box Machine Translation Systems [86.92681013449682]
  Black-box machine translation (MT) systems have high commercial value and errors can be costly. We show that MT systems can be stolen by querying them with monolingual sentences and training models to imitate their outputs. We propose a defense that modifies translation outputs in order to misdirect the optimization of imitation models.
  arXiv  Detail & Related papers  (2020-04-30T17:56:49Z)
• Perfecting the Crime Machine [1.266953082426463]
  This study explores using different machine learning techniques and to predict crime related statistics, specifically crime type in Philadelphia. We use crime location and time as main features, extract different features from the two features that our raw data has, and build models that would work with large number of class labels. We report that the Random Forest as the best performing model to predict crime type with an error log loss of 2.3120.
  arXiv  Detail & Related papers  (2020-01-14T23:25:40Z)

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.