118 citations · 1.3k across the 129 of their papers we have counts for
11 papers · 1 filter
Active Community Detection in Massive Graphs
Heng Wang, Da Zheng, Randal Burns +1
A canonical problem in graph mining is the detection of dense communities. This problem is exacerbated for a graph with a large order and size -- the number of vertices and edges -…
A Model-based Semi-Supervised Clustering Methodology
Jordan Yoder, Carey E. Priebe
We consider an extension of model-based clustering to the semi-supervised case, where some of the data are pre-labeled. We provide a derivation of the Bayesian Information Criterio…
Manifold Matching using Shortest-Path Distance and Joint Neighborhood Selection
Cencheng Shen, Joshua T. Vogelstein, Carey E. Priebe
Matching datasets of multiple modalities has become an important task in data analysis. Existing methods often rely on the embedding and transformation of each single modality with…
An Automated Images-to-Graphs Framework for High Resolution Connectomics
William Gray Roncal, Dean M. Kleissas, Joshua T. Vogelstein +8
Reconstructing a map of neuronal connectivity is a critical challenge in contemporary neuroscience. Recent advances in high-throughput serial section electron microscopy (EM) have…
A nonparametric two-sample hypothesis testing problem for random dot product graphs
Minh Tang, Avanti Athreya, Daniel L. Sussman +2
We consider the problem of testing whether two finite-dimensional random dot product graphs have generating latent positions that are independently drawn from the same distribution…
FlashGraph: Processing Billion-Node Graphs on an Array of Commodity SSDs
Da Zheng, Disa Mhembere, Randal Burns +3
Graph analysis performs many random reads and writes, thus, these workloads are typically performed in memory. Traditionally, analyzing large graphs requires a cluster of machines…