A Systematic Review of Using Machine Learning and Natural Language Processing in Smart Policing
Bibliographic record
Abstract
Smart policing refers to the use of advanced technologies such as artificial intelligence to enhance policing activities in terms of crime prevention or crime reduction. Artificial intelligence tools, including machine learning and natural language processing, have widespread applications across various fields, such as healthcare, business, and law enforcement. By means of these technologies, smart policing enables organizations to efficiently process and analyze large volumes of data. Some examples of smart policing applications are fingerprint detection, DNA matching, CCTV surveillance, and crime prediction. While artificial intelligence offers the potential to reduce human errors and biases, it is still essential to acknowledge that the algorithms reflect the data on which they are trained, which are inherently collected by human inputs. Considering the critical role of the police in ensuring public safety, the adoption of these algorithms demands careful and thoughtful implementation. This paper presents a systematic literature review focused on exploring the machine learning techniques employed by law enforcement agencies. It aims to shed light on the benefits and limitations of utilizing these techniques in smart policing and provide insights into the effectiveness and challenges associated with the integration of machine learning in law enforcement practices.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.005 | 0.025 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.003 | 0.003 |
| Bibliometrics | 0.012 | 0.011 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.002 | 0.003 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.002 | 0.001 |
| Insufficient payload (model declined to judge) | 0.007 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".