118 citations · 1.3k across the 129 of their papers we have counts for
144 papers
Out-of-Sample Embedding with Proximity Data: Projection versus Restricted Reconstruction
Michael W. Trosset, Kaiyi Tan, Minh Tang +1
The problem of using proximity (similarity or dissimilarity) data for the purpose of "adding a point to a vector diagram" was first studied by J.C. Gower in 1968. Since then, a num…
Gotta match 'em all: Solution diversification in graph matching matched filters
Zhirui Li, Ben Johnson, Daniel L. Sussman +2
We present a novel approach for finding multiple noisily embedded template graphs in a very large background graph. Our method builds upon the graph-matching-matched-filter techniq…
Independence testing for inhomogeneous random graphs
Yukun Song, Carey E. Priebe, Minh Tang
Testing for independence between graphs is a problem that arises naturally in social network analysis and neuroscience. In this paper, we address independence testing for inhomogen…
Synergistic Graph Fusion via Encoder Embedding
Cencheng Shen, Carey E. Priebe, Jonathan Larson +1
In this paper, we introduce a method called graph fusion embedding, designed for multi-graph embedding with shared vertex sets. Under the framework of supervised learning, our meth…
Graph Encoder Ensemble for Simultaneous Vertex Embedding and Community Detection
Cencheng Shen, Youngser Park, Carey E. Priebe
In this paper, we introduce a novel and computationally efficient method for vertex embedding, community detection, and community size determination. Our approach leverages a norma…
Dynamic Network Sampling for Community Detection
Cong Mu, Youngser Park, Carey E. Priebe
We propose a dynamic network sampling scheme to optimize block recovery for stochastic blockmodel (SBM) in the case where it is prohibitively expensive to observe the entire graph.…