The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Depth-First Branch-and-Bound versus Local Search: A Case Study
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Expert Systems with Applications: An International Journal
Hi-index | 0.00 |
Social media data are amenable to representation by directed graphs. A node represents an entity in the social network such as a person, organization, location, or event. A link between two nodes represents a relationship such as communication, participation, or financial support. When stored in a database, these graphs can be searched and analyzed for occurrences of various subgraph patterns of nodes and links. This paper describes an interactive visual interface for constructing subgraph patterns called the Graph Matching Toolkit (GMT). GMT searches for subgraph patterns using the Truncated Search Tree (TruST) graph matching algorithm. GMT enables an analyst to draw a subgraph pattern and assign labels to nodes and links using a mouse and drop-down menus. GMT then executes the TruST algorithm to find subgraph pattern occurrences within the directed graph. Preliminary results using GMT to analyze a simulated collection of text communications containing a terrorist plot are reported.