Publications

Results 51–75 of 137

Search results

Jump to search filters

Modeling Complex Relationships in Large-Scale Data using Hypergraphs (LDRD Final Report)

Dunlavy, Daniel M.; Wang, Fulton; Wolf, Michael; Ellingwood, Nathan D.

This SAND report documents the findings of the LDRD project, "Modeling Complex Relationships in Large-Scale Data using Hypergraphs". The project ran from October 2017 through September 2019. The focus of the project was the development and application of hypergraph data analytics to Sandia relational data applications. In this project, we attempted to apply a hypergraph data analysis method—specifically, hypergraph eigenvector centrality—to Sandia mission problems to identify influential entities (people, location, times, etc.) in the data. Unfortunately, the application data led to graph and hypergraph representations containing disconnected components. To date, there are no well-established techniques for applying eigenvector centrality to such graphs and hypergraphs. In this report, we present several heuristics for computing eigenvector centrality for disconnected graphs. We believe this is an important start to understanding how to approach the similar problem for hypergraphs, but this project concluded before we made progress on that problem. The ideas, methods, and suggestions presented here can be used for further research into this challenging problem. We also present our ideas for generating graphs with known degree and centrality distributions. The goal in presenting this work is to identify a procedure for analyzing such graphs once the problem of addressing disconnected components has been addressed. When working with a single data set, this generator can be used to create many instances of graphs that can be used to analyze the robustness of the centrality computations for the original data set. Although the results did not match perfectly in the case of the Facebook Ego dataset used in the experiments presented here, this again represents a good start in the direction of a graph generator for such problems. We note that there are potential trade-offs between how the degree and centrality distributions are fit to the original data and suggested several possible avenues for follow-on research efforts.

More Details
TYPE SAND Report YEAR 2019
DOIOSTI

Embedding Python for In-Situ Analysis

Dunlavy, Daniel M.; Shead, Timothy M.; Aditya, Konduri; Kolla, Hemanth; Kegelmeyer, William P.; Davis, Warren L.

We describe our work to embed a Python interpreter in S3D, a highly scalable parallel direct numerical simulation reacting flow solver written in Fortran. Although S3D had no in-situ capability when we began, embedding the interpreter was surprisingly easy, and the result is an extremely flexible platform for conducting machine-learning experiments in-situ.

More Details
TYPE SAND Report YEAR 2018
DOIOSTI

Using Machine Learning in Adversarial Environments

Davis, Warren L.; Dunlavy, Daniel M.; Vorobeychik, Yevgeniy; Butler, Karin; Forsythe, Chris; Letter, Matthew; Murchison, Nicole; Nauer, Kevin

Cyber defense is an asymmetric battle today. We need to understand better what options are available for providing defenders with possible advantages. Our project combines machine learning, optimization, and game theory to obscure our defensive posture from the information the adversaries are able to observe. The main conceptual contribution of this research is to separate the problem of prediction, for which machine learning is used, and the problem of computing optimal operational decisions based on such predictions, coupled with a model of adversarial response. This research includes modeling of the attacker and defender, formulation of useful optimization models for studying adversarial interactions, and user studies to measure the impact of the modeling approaches in realistic settings.

More Details
TYPE SAND Report YEAR 2016
DOIOSTI
Results 51–75 of 137
Results 51–75 of 137
Top