Cited By
View all- Schroeder JXu JChen H(2003)CrimeLink explorerProceedings of the 1st NSF/NIJ conference on Intelligence and security informatics10.5555/1792094.1792111(168-180)Online publication date: 2-Jun-2003
Using shortest path algorithms to identify criminal associations
Pages 1 - 7
Abstract
Frequently in criminal investigations, law enforcement agencies face the problem of identifying associations between a group of entities such as individuals and organizations. In this paper we present a link analysis technique to solve such a problem. This approach uses shortest path algorithms to find the strongest associations between two or more given entities. The experimental results have demonstrated that our approach is potentially useful in terms of quality and efficiency. Specifically, we found that the two-tree Priority-First Search algorithm in most cases was the fastest algorithm to find shortest paths and the paths found consisted of meaningful criminal associations around 80 percent of the time.
References
[1]
Anderson, T., Arbetter, L., Benawides, A., and Longmore-Etheridge A. (1994). Security works. Security Management, 38(17), 17--20.
[2]
Dijkstra, E. (1959). A. note on two problems in connexion with graphs. Numerische Mathematik, 1, 269--271.
[3]
Evans, J. and Minieka, E. (1992). Optimization Algorithms for Networks and Graphs, 2nd ed., Marcel Dekker, New York.
[4]
Horn, R. D, Birdwell, J. D., and Leedy, L. W. (1997). Link discovery tool. Proceedings of the Counterdrug Technology Assessment Center and Counterdrug Technology Assessment Center's ONDCP/CTAC International Symposium, Chicago, IL. August 18--22, 1997.
[5]
Helgason, R. V., Kennington, J. L., and Stewart, B. D. (1993). The one-to-one shortest-path problem: Am empirical analysis with the two-tree Dijkstra algorithm. Computational Optimization and Applications, 1, 47--75.
[6]
Chen H., and Lynch, K. J. (1992). Automatic construction of networks of concepts characterizing document databases. IEEE Transactions on Systems, Man and Cybernetics, 22(5), 885--902.
[7]
Cormen, T. H, Leiserson, C., E., and Rivest, R. L. (1991). Introduction to Algorithms. Cambridge, MA: The M. I. T. Press.
[8]
Goldberg, H. G., and Senator, T. E. (1998). Restructuring databases for knowledge discovery by consolidation and link formation. In Proceedings of 1998 AAAI Fall Symposium on Artificial Intelligence and Link Analysis (Menlo Park CA, 1998). AAAI Press.
[9]
Goldberg, H. G. and Wong, R. W. H. (1998). Restructuring transactional data for link analysis in the FinCEN AI system. In Proceedings of 1998 AAAI Fall Symposium on Artificial Intelligence and Link Analysis (Menlo Park CA, 1998). AAAI Press.
[10]
Hauck, R. V., Atabakhsh, H., Ongvasith, P., Gupta, H., and Chen, H. (2002). COPLINK concept space: An application for criminal intelligence analysis. IEEE Computer Digital Government Special Issue, 35(3), 30--37.
[11]
Lee, R. (1998). Automatic information extraction from documents: A tool for intelligence and law enforcement analysts. In Proceedings of 1998 AAAI Fall Symposium on Artificial Intelligence and Link Analysis (Menlo Park CA, 1998). AAAI Press.
[12]
Sparrow, M. (1991). The application of network analysis to criminal intelligence: An assessment of the prospects. Social Networks, 13, 251--274.
[13]
Tolle, K. M., and Chen, H. (2000). Comparing noun phrasing techniques for use with medical digital library tools. Journal of the American Society for Information Science, 51(4), 352--370.
Index Terms
- Using shortest path algorithms to identify criminal associations
Recommendations
Generalization of Shortest Path Map
ITNG '10: Proceedings of the 2010 Seventh International Conference on Information Technology: New GenerationsWe consider the problem of constructing shortest path maps in two dimensions under angle constraint. Shortest path maps are used for planning short length paths from a fixed source point s to varying goal points. In the standard shortest path map the ...
A Multiple Pairs Shortest Path Algorithm
The multiple pairs shortest path problem (MPSP) arises in many applications where the shortest paths and distances between only some specific pairs of origin-destination (OD) nodes in a network are desired. The traditional repeated single-source shortest ...
Acceleration of shortest path and constrained shortest path computation
WEA'05: Proceedings of the 4th international conference on Experimental and Efficient AlgorithmsWe study acceleration methods for point-to-point shortest path and constrained shortest path computations in directed graphs, in particular in road and railroad networks. Our acceleration methods are allowed to use a preprocessing of the network data to ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
May 2002
1234 pages
Publisher
Digital Government Society of North America
Publication History
Published: 19 May 2002
Check for updates
Qualifiers
- Article
Conference
dg.o '02
Acceptance Rates
Overall Acceptance Rate 150 of 271 submissions, 55%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 306Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 12 Dec 2024
Other Metrics
Citations
Cited By
View all- Schroeder JXu JChen H(2003)CrimeLink explorerProceedings of the 1st NSF/NIJ conference on Intelligence and security informatics10.5555/1792094.1792111(168-180)Online publication date: 2-Jun-2003
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in