For past GTA3 workshops, please visit our archive page.
Networks are natural analytic tools in modeling adversarial activities (e.g., smuggling, illegal arms dealing, illicit drug production) in different contexts. However, such activities are often covert and embedded across multiple domains. They are generally not detectable and recognizable from the perspective of an isolated network, and only become apparent when multiple networks are analyzed in a joint manner. Thus, one of the main research topics in modeling adversarial activities is to develop effective techniques to align and fuse information from different networks into a unified representation for global analysis. Based on the combined network representation, an equally important research topic is on detecting and matching indicating patterns to recognize the underlining adversarial activities in the integrated network.
Two key challenge problems involved in the modeling process include:
The focus of this workshop is to gather together the researchers from all relevant fields to share their experience and opinions on addressing the two fundamental graph mining problems – “Connecting the dots” and “Finding a needle in a haystack”, in the context of adversarial activity analytics.
In addition, this workshop also aims to provide a forum for discussing research challenges and novel approaches in synthesizing realistic networks that those observed in the real-worlds. Numerous approaches have been proposed in the past for generating networks (e.g., exponential random graphs, stochastic Kronecker graphs). However, few research has been conducted on systematically injecting and embedding subtle signals (e.g., covert activities) to these “background” networks. In addition, new methods for generating synthetic data in other domains (e.g., Computer Vision) with deep generative models (e.g., Variational Autoencoders, Generative Adversarial Networks) have grown in prominence. Naturally, the question arises as to whether these new methods can be adapted to the graph domains and how they compare in capability to the current state-of-the-art.
Including but not limited to:
This workshop (co-located with the 2018 IEEE International Conference on Big Data) aims to bring together a cross-disciplinary audience of researchers from both academia and industry to share experience techniques, resources and best practices, and to exchange perspectives and future directions. We expect the workshop to develop a community of interested researchers and facilitate their future collaborations. A best paper will be selected and announced in our workshop based on the collective feedback from our reviewers.
Submissions to the workshop will be subject to a single-blind peer review process, with each submission reviewed by at least two program committee members in addition to an organizer. Accepted papers will be given either an oral or poster presentation slot, and will be published in the IEEE Big Data workshop proceedings.
Papers must be submitted in PDF format according to IEEE Computer Society Proceedings Manuscript Formatting Guidelines to (Formatting Instructions, Templates) to fit within 8 pages (long papers), 4 pages (short papers) or 2 pages (demo papers) including any diagrams, references and appendices. Submissions must be self-contained and in English. After uploading your submission, please check the copy stored on the site.
Submissions should be made using the Online Submission System provided by IEEE BigData.
An Empirical Assessment of the Complexity and Realism of Synthetic Social Contact Networks
Kiran Karra, Samarth Swarup, Justus Graham
A Chronological Edge-Driven Approach to Temporal Subgraph Isomorphism
Patrick Mackey, Katherine Porterfield, Erin Fitzhenry, Sutanay Choudhury, George Chin
From Gamergate to FIFA: Identifying Polarized Groups in Online Social Media
Dana Warmsley, Jiejun Xu, and Tsai-Ching Lu
Filtering Methods for Subgraph Matching on Multiplex Networks
Jacob Moorman, Qinyi Chen, Thomas Tu, Zachary Boyd, Andrea Bertozzi
Multi-Channel Large Network Simulation Including Adversarial Activity
Joseph Cottam, Sumit Purohit, Patrick Mackey, George Chin
"Call Microsoft Now!!": Using Web-Scale Graph Analytics to Counter Technical Support Scams
Jonathan Larson, Bryan Tower, Duane Hadfield, Darren Edge, Christopher White
Trimming the Hairball: Edge Cutting Strategies for Making Dense Graphs Usable
Darren Edge, Jonathan Larson, Markus Mobius, Christopher White
|01:25pm - 01:30pm|||||Opening Remarks|
|01:30pm - 02:20pm|||||Keynote: Vertex Nomination, and an Adversary, and Countering that Adversary - Prof. Carey Priebe|
|02:20pm - 03:10pm|||||Keynote: Mathematics of Crime - Prof. Andrea Bertozzi|
|03:10pm - 03:25pm|||||An Empirical Assessment of the Complexity and Realism of Synthetic Social Contact Networks - Kiran Karra, Samarth Swarup, Justus Graham|
|03:25pm - 03:40pm|||||A Chronological Edge-Driven Approach to Temporal Subgraph Isomorphism - Patrick Mackey, Katherine Porterfield, Erin Fitzhenry, Sutanay Choudhury, George Chin Jr.|
|03:40pm - 04:00pm|||||Coffee Break|
|04:00pm - 04:50pm|||||Keynote: Tensor MAU - Dr. Christopher White|
|04:50pm - 05:05pm|||||From Gamergate to FIFA: Identifying Polarized Groups in Online Social Media - Dana Warmsley, Jiejun Xu, Tsai-Ching Lu|
|05:05pm - 05:20pm|||||Filtering Methods for Subgraph Matching on Multiplex Networks - Jacob D. Moorman, Qinyi Chen, Thomas K. Tu, Zachary M. Boyd, Andrea L. Bertozzi|
|05:20pm - 05:35pm|||||Multi-Channel Large Network Simulation Including Adversarial Activity - Joseph A. Cottam, Sumit Purohit, Patrick Mackey, George Chin Jr.|
|05:35pm - 05:50pm|||||Using Web-Scale Graph Analytics to Counter Technical Support Scams - Jonathan Larson, Bryan Tower, Duane Hadfield, Darren Edge, Christopher White|
|05:50pm - 06:05pm|||||Trimming the Hairball: Edge Cutting Strategies for Making Dense Graphs Usable - Darren Edge, Jonathan Larson, Markus Mobius, Christopher White|
|06:05pm - 06:10pm|||||Closing Remarks|