White Papers
Using Shortest Path Algorithms to Identify Criminal Associations
Overview Frequently in criminal investigations, law enforcement agencies face the problem of identifying associations between a group of entities such as individuals and organizations. This paper presents 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.
| Publisher | University of Arizona | File Format | |
|---|---|---|---|
| Date Published | August 2002 | Downloads | 1 |
| Format | White Papers | ||
| Topics |
|
||
-
Did you find this white paper useful?
White Paper RSS
Download
Register
