COLLEGE DIRECTORY       :      VISIT ELLER      :      LOG IN 
Eller College of Management
Eller College Home > MIS > Artificial Intelligence Laboratory > Research > Data Warehousing - Coplink*/BorderSafe/RISC
Artificial Intelligence Laboratory

Data Warehousing - Coplink*/BorderSafe/RISC

* The COPLINK system was initially developed by the University of Arizona Artificial Intelligence Lab with funding from the National Institute of Justice and the National Science Foundation since 1997. With additional venture funding and product development, Knowledge Computing Corporation (KCC) currently distributes, maintains, and updates the commercially available COPLINK Solution Suite.

Demo: COPLINK Hyperbolic Tree Visualization

Introduction

An officer searches for all entities related to the suspect: Eddie Tipton. All entities related to this suspect are displayed (fig. 3a). The thickness of the arcs indicates the weight (closeness) of the relationship. The color indicates the entity type. These types can be seen at the bottom of fig. 3c (green: person, pink: address, brown: vehicle, black: crime type, blue: organization). A witness has seen this suspect drive in a Ford truck 1994. Another witness thinks this suspect knows a person whose last name is "Antrikin". The officer then enters these two terms in the list of search terms (terms may also be selected from the hyperbolic tree using the mouse button). The screen shown in fig. 3b is displayed showing all entities associated with each of these search terms. The officer notices another suspect's name (Trusillo Manuel) appearing as one of the relationships. By selecting that entity, the tree expands an additional level (fig. 3c) and displays all entities related to it. The officer may choose to view the hyperbolic tree using filters given on the bottom of the screen (see fig. 3c). These include filters on different entity types as well as a slider that allows the viewing of a given number of results (in fig. 3c the officer has used the slider to view the top 15 results according to the weight of the relationships). The officer can better view one section of the tree by moving it to the center

Figure 3a
Fig. 3a: hyperbolic tree with one search term.
Figure 3b
Fig. 3b: hyperbolic tree with three search terms.
Figure 3c
Fig. 3c: multi-level hyperbolic tree

Return to Parameters

For additional information, please contact us.