MIT Lincoln Laboratory GRAPH EXPLOITATION SYMPOSIUM

Size: px

Start display at page:

Download "MIT Lincoln Laboratory GRAPH EXPLOITATION SYMPOSIUM"

Domenic Johnson
5 years ago
Views:

1 GraphEx-16 Graph Exploitation GRAPH EXPLOITATION SYMPOSIUM WIN May 2016 MAC GES-7 Issued: 6 January 2017 Approved for public release: distribution unlimited. This material is based upon work supported by the Assistant Secretary of Defense for Research and Engineering under Air Force Contract No. FA C-0002 and/or FA D Any opinions, findings, conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the Assistant Secretary of Defense for Research and Engineering Massachusetts Institute of Technology. Delivered to the US Government with Unlimited Rights, as defined in DFARS Part or 7014 (Feb 2014). Notwithstanding any copyright notice, U.S. Government rights in this work are defined by DFARS or DFARS as detailed above. Use of this work other than as specifically authorized by the U.S. Government may violate any copyrights that exist in this work.

2 PREFACE Graph Exploitation The GraphEx brought together leading experts from universities, industry, and government to explore the state of the art and define a future roadmap in network science. The event was limited to a small group of invited attendees. The symposium took place at the MIT Endicott House. Highlights The two-day technical program topics of interest included: Modeling noise and uncertainty Multi-modal and heterogeneous networks Algorithms and processing architectures for large-scale data Models and techniques for dynamic graphs Anomaly, subgraph, and community detection Network visualization and visual analytics Challenge problems for the next decade Group Photograph of the GraphEx attendees Report Documentation and Contract Acknowledgment Pages

3 ACKNOWLEDGMENTS Organizers Chairs Sanjeev Mohindra William Streilein Technical Co-Chairs Rajmonda Caceres Benjamin Miller Technical Committee Edoardo Airoldi Nadya Bliss Robert Bond Kevin Carter Jordan Crouser Kara Greenfield Benjamin Landon Christopher Long David Martinez Kyle O Brien Ali Pinar Steven Smith Administrative Contact Joan Meehan-Dion Annette Abruzzese 244 Wood Street Lexington, MA Voice: Fax: graphex@ll.mit.edu Harvard University Arizona State University Microsoft Smith College U.S. Department of Defense Sandia National Laboratories

4 AGENDA 18 May Day 1 Keynote A.O. Hero III University of Michigan Foundational Principles of Large Scale Graph Mining* 02 Higher-Order Organization of Complex D. Gleich Purdue University Networks* 03 Inside the Atoms: Mining a Network of H. Tong Arizona State University Networks and Beyond - 18 May May Poster Session 04 Edge-Exchangeable Graphs, Sparsity, and T. Broderick Massachusetts Institute Power Laws of Technology 05 A Bayesian Idealization of Entity Resolution J. Ferry Metron on Networks 06 Cooperative Computing for Autonomous J. Saia University of New Mexico Data Centers 07 Secure Multi-Party Computation of E. Shen Probabilistic Threat Propagation 08 Banquet Speaker S. Aral MIT Sloan School of Peer Effects, Social Multipliers and Cascades of Management Human Behavior* *Presentation not included in proceedings.

5 AGENDA 19 May Day 2 Keynote P. Burkhardt Research Directorate, Easy Graph Algorithms under Hard Constraints NSA 02 Dynamic Graph Visualization and Exploration* C. Goerg University of Colorado, Denver 03 Interactive Viaualization of Complex Networks* N.H. Riche Microsoft 04 Data Mining Meets HCI: Interactive Visual Tools P. Chau Georgia Tech for Large Graphs - 18 May May Poster Session 05 Hypergraph Exploitation for Data Sciences M. Wolf Sandia National Laboratories 06 Searching for Meaning in the Era of Big Data T. Tran DARPA and IoT 07 BigDAWG: A Polystore System to Support T. Mattson Intel Complex Analytics on Heterogeneous Data 08 An Advanced Graph Processor Prototype V. Gleyzer *Presentation not included in proceedings.

6 - 18 May May Poster Session AGENDA Poster Session 01 Entity Embedding-Based Anomaly Detection T. Chen Northeastern University for Heterogeneous Categorical Events* 02 Task-Based Timescale Detection in B. Fish Univ. of Illinois at Chicago/ Dynamic Networks 03 Network-Based Content Discovery T. Greer and Classification 04 Ideology Detection for Twitter Users via Y. Gu Northeastern University Heterogeneous Types of Links 05 Cross-Domain Entity Resolution in Social Media L. Li MIT Lincoln Laboratoy 06 Sampling and Link Prediction on Large Graphs L. Milechin 07 Fast Algorithms for Finding Dense Subgraphs E. Sariyuce Sandia National with Hierarchy Laboratories 08 Increasing the Size of Partially Observed S. Soundarajan Syracuse University Networks* 09 Unbiased Estimation of Casual Effects D. Sussman Harvard University under Network Interference 10 Enhanced Detectability of Community Structure D. Taylor University of North in Multilayer Networks through Layer Aggregation Carolina 11 Causal Inference with Partially Revealed P. Toulis Harvard University Network Interference 12 Observational Studies on Networks: Entangled A. Volfovsky Harvard University Treatments and Calculating Propensity Scores *Poster not included in proceedings.

The Future of Advanced (Secure) Computing

The Future of Advanced (Secure) Computing The Future of Advanced (Secure) Computing This material is based upon work supported by the Assistant Secretary of Defense for Research and Engineering under Air