Discovering patterns in social networks with graph matching algorithms

SBP(2013)

引用 14|浏览0
暂无评分
摘要
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.
更多
查看译文
关键词
social network,subgraph pattern,truncated search tree,discovering pattern,graph matching toolkit,subgraph pattern occurrence,trust algorithm,various subgraph pattern,social media data,gmt search,drop-down menu,visualization software,graph matching,social network analysis
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要