CrimeWalker: a recommendation model for suspect investigation

Law enforcement and intelligence agencies have long realized that analysis of co-offending networks, networks of offenders who have committed crimes together, is invaluable for crime investigation, crime reduction and prevention. Investigating crime can be a challenging and difficult task, especially in cases with many potential suspects and inconsistent witness accounts or inconsistencies between witness accounts and physical evidence. We present here a novel approach to crime suspect recommendation based on partial knowledge of offenders involved in a crime incident and a known co-offending network. To solve this problem, we propose a random walk based method for recommending the top-K potential suspects. By evaluating the proposed method on a large crime dataset for the Province of British Columbia, Canada, we show experimentally that this method outperforms baseline random walk and association rule-based methods. Additionally, results obtained for public domain data from experiments for co-author recommendation on a DBLP co-authorship network are consistent with those on the crime dataset. Compared to the crime dataset, the performance of all competitors is much better on the DBLP dataset, confirming that crime suspect recommendation is an inherently harder task.

[1]  Peter J. H. King,et al.  Incrementally visualising criminal networks , 2002, Proceedings Sixth International Conference on Information Visualisation.

[2]  S. Ferrari,et al.  Network models of criminal behavior , 2008, IEEE Control Systems.

[3]  A. Reiss, Co-Offending and Criminal Careers , 1988, Crime and Justice.

[4]  Ramakrishnan Srikant,et al.  Fast algorithms for mining association rules , 1998, VLDB 1998.

[5]  Hsinchun Chen,et al.  Untangling Criminal Networks: A Case Study , 2003, ISI.

[6]  D. Farrington,et al.  Advancing Knowledge About Co-Offending: Results from a Prospective Longitudinal Survey of London Males , 1991 .

[7]  Sergio A. Alvarez,et al.  Efficient Adaptive-Support Association Rule Mining for Recommender Systems , 2004, Data Mining and Knowledge Discovery.

[8]  Hsinchun Chen,et al.  CrimeNet explorer: a framework for criminal network knowledge discovery , 2005, TOIS.

[9]  Kristian J. Hammond,et al.  Mining navigation history for recommendation , 2000, IUI '00.

[10]  Das Amrita,et al.  Mining Association Rules between Sets of Items in Large Databases , 2013 .

[11]  Martin Ester,et al.  A matrix factorization technique with trust propagation for recommendation in social networks , 2010, RecSys '10.

[12]  M. McPherson,et al.  Birds of a Feather: Homophily in Social Networks , 2001 .

[13]  Morroe Berger,et al.  Freedom and control in modern society , 1954 .

[14]  R. Boba Crime analysis and crime mapping , 2005 .

[15]  Petr Hájek,et al.  The GUHA method of automatic hypotheses determination , 1966, Computing.

[16]  ZhengYou Xia Fighting criminals: Adaptive inferring and choosing the next investigative objects in the criminal network , 2008, Knowl. Based Syst..

[17]  D. Mcandrew The Structural Analysis of Criminal Networks , 2021, The Social Psychology of Crime.

[18]  Martin Ester,et al.  Co-offending Network Mining , 2011, Counterterrorism and Open Source Intelligence.

[19]  Uwe Glässer,et al.  Locating Central Actors in Co-offending Networks , 2011, 2011 International Conference on Advances in Social Networks Analysis and Mining.

[20]  Hsinchun Chen,et al.  Effect of Inventor Status on Intra-Organizational Innovation Evolution , 2009, 2009 42nd Hawaii International Conference on System Sciences.

[21]  C. Lawrence The Social Psychology of Crime: Groups, Teams and Networks , 2000 .

[22]  G. Palermo,et al.  Constructing Bayesian networks for criminal profiling from limited data , 2008, Knowl. Based Syst..

[23]  Jian Pei,et al.  Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach , 2006, Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06).

[24]  Hsinchun Chen,et al.  Using Coplink to Analyze Criminal-Justice Data , 2002, Computer.

[25]  Martin Ester,et al.  Using a trust network to improve top-N recommendation , 2009, RecSys '09.

[26]  Jian Pei,et al.  Mining frequent patterns without candidate generation , 2000, SIGMOD '00.

[27]  Hsinchun Chen,et al.  Fighting organized crimes: using shortest-path algorithms to identify associations in criminal networks , 2004, Decis. Support Syst..

[28]  Martin Ester,et al.  TrustWalker: a random walk model for combining trust-based and item-based recommendation , 2009, KDD.

[29]  Ramakrishnan Srikant,et al.  Fast Algorithms for Mining Association Rules in Large Databases , 1994, VLDB.

[30]  Christopher J. Sullivan,et al.  INVESTIGATING THE STABILITY OF CO-OFFENDING AND CO-OFFENDERS AMONG A SAMPLE OF YOUTHFUL OFFENDERS* , 2008 .