Fighting organized crimes: Using shortest-path algorithms to identify associations in criminal networks

Decision Support Systems

Volumn 38, Issue 3, 2004, Pages 473-487

  Xu, Jennifer J ^a   Chen, Hsinchun ^a  

^a UNIVERSITY OF ARIZONA   (United States)

Author keywords

Concept space; Crime investigation; Law enforcement; Link analysis; Organized crime; Shortest path algorithm

Indexed keywords

ALGORITHMS; INFORMATION ANALYSIS; LAW ENFORCEMENT; PLANNING; SOCIAL ASPECTS; SOCIETIES AND INSTITUTIONS;

CONCEPT SPACE; CRIME INVESTIGATION; CRIMINAL NETWORKS; LINK ANALYSIS; ORGANIZED CRIMES; SHORTEST-PATH ALGORITHMS;

DECISION SUPPORT SYSTEMS;

EID: 4544224894     PISSN: 01679236     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-9236(03)00117-9     Document Type: Article

References (27)

1. Ali M., Kamoun F. Neural networks for shortest path computation and routing in computer networks. IEEE Transactions on Neural Networks. 4(5):1993;941-953.
2. Anderson T., Arbetter L., Benawides A., Longmore-Etheridge A. Security works. Security Management. 38(17):1994;17-20.
3. Araujo F., Ribeiro B., Rodrigues L. A neural network for shortest path computation. IEEE Transactions on Neural Networks. 12(5):2001;1067-1073.
4. Asano T., Kirkpatrick D., Yap C. Pseudo approximation algorithms, with applications to optimal motion planning. Proceedings of the Eighteenth Annual Symposium on Computational Geometry (Barcelona, Spain). 2002;170-178.
5. Chau M., Xu J., Chen H. Extracting meaningful entities from police narrative reports. Proceedings of the National Conference on Digital Government Research (Los Angeles, CA). 2002;271-275.
6. Chen H., Lynch K.J. Automatic construction of networks of concepts characterizing document databases. IEEE Transactions on Systems, Man and Cybernetics. 22(5):1992;885-902.
7. Chinchor N.A. Overview of MUC-7/MET-2. Proceedings of the Seventh Message Understanding Conference (MUC-7):1998.
8. Coady W.F. Automated link analysis: artificial intelligence-based tool for investigators. Police Chief. 52(9):1985;22-23.
9. Cormen T.H., Leiserson C.E., Rivest R.L. Introduction to Algorithms. 1991;MIT Press, Cambridge, MA.
10. Dantzig G. On the shortest route through a network. Management Science. 6:1960;187-190.
11. Dijkstra E. A note on two problems in connection with graphs. Numerische Mathematik. 1:1959;269-271.
12. Evans J., Minieka E. Optimization Algorithms for Networks and Graphs. 1992;Marcel Dekker, New York.
13. Floyd R.W. Algorithm 97: shortest path. Communications of the ACM. 5(6):1962;345-370.
14. Goldberg H.G., Senator T.E. Restructuring databases for knowledge discovery by consolidation and link formation. Proceedings of 1998 AAAI Fall Symposium on Artificial Intelligence and Link Analysis. 1998;AAAI Press, Menlo Park, CA.
15. Goldberg H.G., Wong R.W.H. Restructuring transactional data for link analysis in the FinCen AI System. Proceedings of 1998 AAAI Fall Symposium on Artificial Intelligence and Link Analysis. 1998;AAAI Press, Menlo Park, CA.
16. Harper W.R., Harris D.H. The application of link analysis to police intelligence. Human Factors. 17(2):1975;157-164.
17. Hauck R.V., Atabakhsh H., Ongvasith P., Gupta H., Chen H. Using coplink to analyze criminal-justice data. IEEE Computer. 35(3):2002;30-37.
18. Helgason R.V., Kennington J.L., Stewart B.D. The one-to-one shortest-path problem: an empirical analysis with the two-tree dijkstra algorithm. Computational Optimization and Applications. 1:1993;47-75.
19. Klerks P. The network paradigm applied to criminal organizations: theoretical nitpicking or a relevant doctrine for investigators? Recent developments in The Netherlands. Connections. 24(3):2001;53-65.
20. Krebs V.E. Mapping networks of terrorist cells. Connections. 24(3):2001;43-52.
21. Lee R. Automatic information extraction from documents: a tool for intelligence and law enforcement analysts. Proceedings of 1998 AAAI Fall Symposium on Artificial Intelligence and Link Analysis. 1998;AAAI Press, Menlo Park, CA.
22. McAndrew D. The structural analysis of criminal networks. Canter D., Alison L. The Social Psychology of Crime: Groups, Teams, and Networks, Offender Profiling Series, Aldershot, Dartmouth. vol. III:1999.
23. Perkins C.E., Bhagwat P. Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers. Proceedings of SIGCOMM Symposium on Communications Architectures and Protocols, London, UK. 1994;212-225.
24. Sparrow M.K. The application of network analysis to criminal intelligence: an assessment of the prospects. Social Networks. 13:1991;251-274.
25. Tolle K.M., Chen H. Comparing noun phrasing techniques for use with Medical Digital Library tools. Journal of the American Society for Information Science. 51(4):2000;352-370.
26. Wang Z., Crowcroft J. Analysis of shortest-path routing algorithms in a dynamic network environment. ACM Computer Communication Review. 22(2):1992;63-71.
27. Wasserman S., Faust K. Social Network Analysis: Methods and Applications. 1994;Cambridge Univ. Press, Cambridge