Discovering patterns in social networks with graph matching algorithms

  • Authors:
  • Kirk Ogaard;Heather Roy;Sue Kase;Rakesh Nagi;Kedar Sambhoos;Moises Sudit

  • Affiliations:
  • Tactical Information Fusion Branch, Computational and Information Sciences, U.S. Army Research Laboratory, Aberdeen Proving Ground, MD;Tactical Information Fusion Branch, Computational and Information Sciences, U.S. Army Research Laboratory, Aberdeen Proving Ground, MD;Tactical Information Fusion Branch, Computational and Information Sciences, U.S. Army Research Laboratory, Aberdeen Proving Ground, MD;Department of Industrial and Systems Engineering, Center for Multisource Information Fusion, University at Buffalo (SUNY), Buffalo, NY;Department of Industrial and Systems Engineering, Center for Multisource Information Fusion, University at Buffalo (SUNY), Buffalo, NY;Department of Industrial and Systems Engineering, Center for Multisource Information Fusion, University at Buffalo (SUNY), Buffalo, NY

  • Venue:
  • SBP'13 Proceedings of the 6th international conference on Social Computing, Behavioral-Cultural Modeling and Prediction
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.