Abstract

AbstractThis paper investigates thematic classification of homicides for the purpose of behavioural investigative analysis (e.g. offender profiling). Previous research has predominantly used smallest space analysis (SSA) to conceptualise and classify offences into thematic groups based on crime scene behaviour data. This paper introduces a combined approach utilising multiple correspondence analysis (MCA), cluster analysis (CA), and discriminant function analysis (DFA) to define and differentiate crime scenes into expressive or instrumental and impersonal or personal crimes. MCA is used to derive the latent structural dimensions in the crime data and produce quantitative scores for each offence along these dimensions. Two‐step CA was then utilised to classify offences. Offence dimensional scores were then used to predict cluster membership under DFA, producing cluster centroids corresponding to MCA dimensions. Centroids were plotted on the MCA correspondence map to simultaneously conceptualise crime classification and the latent structure of the Serbian crime data. Classification of offences based on MCA dimensional scores were 91.5% accurate. This MCA–CA–DFA approach may reduce some of the more subjective aspects of SSA methodology used in classification, whilst producing a product more amenable to objective and cumulative review. Implications for offender profiling research utilising SSA and this approach are discussed. Copyright © 2014 John Wiley & Sons, Ltd.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.