skip to main content
10.1145/2043932.2043965acmconferencesArticle/Chapter ViewAbstractPublication PagesrecsysConference Proceedingsconference-collections
research-article

CrimeWalker: a recommendation model for suspect investigation

Published:23 October 2011Publication History

ABSTRACT

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.

References

  1. A. J. Reiss. Co-offending and criminal careers. Crime and Justice: A Review of Research, 1988.Google ScholarGoogle Scholar
  2. A. J. Reiss, and D. P. Farrington, Advancing knowledge about co-offending: Results from a prospective longitudinal survey of London males. Journal of Criminal Law and Criminology 82 (2), 1991.Google ScholarGoogle ScholarCross RefCross Ref
  3. R. V. Hauck, H. Atabakhsh, P. Ongvasith, H. Gupta and H. Chen. Using Coplink to analyze criminal-justice data. IEEE Computer, Vol. 35, No. 3: 3037, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. J. M. McGloin et al. Investigating the stability of co-offending and co-offenders among a sample of youthful offenders. Criminology 46 (1), 2008.Google ScholarGoogle Scholar
  5. P. L. Brantingham, M. Ester, R. Frank, U. Glässer and M. A. Tayebi. Co-offending Network Mining. In Uffe Kock Wiil (Ed.), Counterterrorism and Open Source Intelligence, Lecture Notes in Social Networks, Vol. 2, Springer, 2011.Google ScholarGoogle Scholar
  6. J. J. Xu and H. Chen. CrimeNet Explorer: A Framework for Criminal Network Knowledge Discovery. ACM Transactions on Information Systems, Vol 23 No 2. pp. 201--226, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. M. A. Tayebi, L. Bekker, U. Glässer and V. Dabbaghian. Locating Central Actors in Co-offending Networks. In Proc. ASONAM Conference, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. K. Baumgartner, S. Ferrari and G. Palermo. Constructing Bayesian networks for criminal profiling from limited data. Knowledge-Based Systems, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. S. Ferrari, K. C. Baumgartner, G. Palermo, R. Bruzzone and M. Strano. Network Models of Criminal Behavior: Comparing Bayesian and Neural Networks for Decision Support in Criminal Investigations. IEEE Control Systems Magazine, 2008.Google ScholarGoogle Scholar
  10. A. Block. East SideWest Side: Organizing Crime in New York City. 19301950, 2nd ed., New Brunswick, NJ: Transaction 1994.Google ScholarGoogle Scholar
  11. J. J. Xu and H. Chen Fighting organized crimes: using shortest-path algorithms to identify associations in criminal networks. Decision Support Systems, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Z. Xia. Fighting criminals: Adaptive inferring and choosing the next investigative objects in the criminal network. Knowledge-Based Systems, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. M. Jamali and M. Ester. A Matrix Factorization Technique with Trust Propagation for Recommendation in Social Networks. In Proc. third ACM conference on Recommender systems, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. M. Jamali and M. Ester. TrustWalker: a random walk model for combining trust-based and item-based recommendation. In Proc. 15th ACM SIGKDD Conference, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. M. Jamali and M. Ester. Using a trust network to improve top-N recommendation. In Proc. third ACM conference on Recommender systems, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. M. N. Smith and P. J. H. King. Incrementally Visualising Criminal Networks. In Proc. Sixth International Conference on Information Visualisation, 2002.Google ScholarGoogle Scholar
  17. S. Kaza , and H. Chen. Effect of inventor status on intra organizational innovation evolution. In Proc. Hawaii International Conference on System Sciences, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. J. J. Xu, and H. Chen. Untangling Criminal Networks: A Case Study. In Proc. ISI Conference, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. R. Agrawal, T. Imielinski and A. Swami. Mining association rules between sets of items in large databases. In Proc. of the ACM SIGMOD Conf. on Management of Data, May 1993. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. P. Hajek, I. Havel and M. Chytil. The guha method of automatic hypotheses determination. Computing, 1:293--308, 1966.Google ScholarGoogle ScholarCross RefCross Ref
  21. R. Agrawal and R. Srikant, Fast algorithms for mining association rules. In Proc. 20th VLDB Conference, 1994. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. J. Han, J. Pei, Y. Yin and R. Mao. Mining frequent patterns without candidate generation. Data Mining and Knowledge Discovery, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. X. Fu, J. Budzik, and K. J. Hammond. Mining navigation history for recommendation. In Proc. 2000 Conference on Intelligent User Interfaces, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. W. Lin , S. A. Alvarez and C. Ruiz. Efficient Adaptive-Support Association Rule Mining for Recommender Systems. Data Mining and Knowledge Discovery, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. R. Boba, Crime analysis and crime mapping. Thousand Oaks, Sage Publication Inc., 2005.Google ScholarGoogle Scholar
  26. D. Mcandrew. The structural analysis of criminal networks. In the Social Psychology of Crime: Groups, Teams, and Networks. In D. Canter and L. Alison (Ed.), Dartmouth Publishing, Aldershot, 1999.Google ScholarGoogle Scholar
  27. P. Lazarsfeld and R. Merton. Freedom and Control in Modern Society. In M. Berger, T. Abel and C. Page (Ed.), Van Nostrand, New York, 1954.Google ScholarGoogle Scholar
  28. M. McPherson, L. Smith-Lovin and J. M. Cook. Birds of a feather: Homophily in social networks. Annual Review of Sociology, 2001.Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. CrimeWalker: a recommendation model for suspect investigation

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Conferences
      RecSys '11: Proceedings of the fifth ACM conference on Recommender systems
      October 2011
      414 pages
      ISBN:9781450306836
      DOI:10.1145/2043932

      Copyright © 2011 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 23 October 2011

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article

      Acceptance Rates

      Overall Acceptance Rate254of1,295submissions,20%

      Upcoming Conference

      RecSys '24
      18th ACM Conference on Recommender Systems
      October 14 - 18, 2024
      Bari , Italy

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader