MétaCan
Menu
Back to cohort
Record W2157926639 · doi:10.1177/0093854811435210

Computerized Crime Linkage Systems

2012· article· en· W2157926639 on OpenAlex
Craig Bennell, Brent Snook, Sarah MacDonald, John C. House, Paul Taylor

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueCriminal Justice and Behavior · 2012
Typearticle
Languageen
FieldSocial Sciences
TopicCrime Patterns and Interventions
Canadian institutionsMemorial University of NewfoundlandCarleton University
Fundersnot available
KeywordsLinkage (software)Computer securityComputer scienceData scienceValue (mathematics)Value systemsPsychologyCriminologySociologyMachine learning

Abstract

fetched live from OpenAlex

Computerized crime linkage systems are meant to assist the police in determining whether crimes have been committed by the same offender. In this article, the authors assess these systems critically and identify four assumptions that affect the effectiveness of these systems. These assumptions are that (a) data in the systems can be coded reliably, (b) data in the systems are accurate, (c) violent serial offenders exhibit consistent but distinctive patterns of behavior, and (d) analysts have the ability to use the data in the systems to link crimes accurately. The authors argue that there is no compelling empirical support for any of the four assumptions, and they outline a research agenda for testing each assumption. Until evidence supporting these assumptions becomes available, the value of linkage systems will remain open to debate.

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.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Qualitative · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.360
Threshold uncertainty score0.511

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

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.

Opus teacher head0.117
GPT teacher head0.399
Teacher spread0.282 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it