Picture for Carey Priebe

Carey Priebe

Johns Hopkins University

Edge-Parallel Graph Encoder Embedding

Add code
Feb 06, 2024
Viaarxiv icon

Bilingual Lexicon Induction for Low-Resource Languages using Graph Matching via Optimal Transport

Add code
Oct 25, 2022
Viaarxiv icon

An Analysis of Euclidean vs. Graph-Based Framing for Bilingual Lexicon Induction from Word Embedding Spaces

Add code
Sep 26, 2021
Figure 1 for An Analysis of Euclidean vs. Graph-Based Framing for Bilingual Lexicon Induction from Word Embedding Spaces
Figure 2 for An Analysis of Euclidean vs. Graph-Based Framing for Bilingual Lexicon Induction from Word Embedding Spaces
Figure 3 for An Analysis of Euclidean vs. Graph-Based Framing for Bilingual Lexicon Induction from Word Embedding Spaces
Figure 4 for An Analysis of Euclidean vs. Graph-Based Framing for Bilingual Lexicon Induction from Word Embedding Spaces
Viaarxiv icon

Spectral clustering in the weighted stochastic block model

Add code
Oct 12, 2019
Figure 1 for Spectral clustering in the weighted stochastic block model
Figure 2 for Spectral clustering in the weighted stochastic block model
Figure 3 for Spectral clustering in the weighted stochastic block model
Figure 4 for Spectral clustering in the weighted stochastic block model
Viaarxiv icon

Vertex Classification on Weighted Networks

Add code
Jun 07, 2019
Figure 1 for Vertex Classification on Weighted Networks
Figure 2 for Vertex Classification on Weighted Networks
Figure 3 for Vertex Classification on Weighted Networks
Figure 4 for Vertex Classification on Weighted Networks
Viaarxiv icon

Sparse Representation Classification via Screening for Graphs

Add code
Jun 04, 2019
Figure 1 for Sparse Representation Classification via Screening for Graphs
Figure 2 for Sparse Representation Classification via Screening for Graphs
Figure 3 for Sparse Representation Classification via Screening for Graphs
Viaarxiv icon

Vertex nomination: The canonical sampling and the extended spectral nomination schemes

Add code
Feb 14, 2018
Figure 1 for Vertex nomination: The canonical sampling and the extended spectral nomination schemes
Figure 2 for Vertex nomination: The canonical sampling and the extended spectral nomination schemes
Figure 3 for Vertex nomination: The canonical sampling and the extended spectral nomination schemes
Figure 4 for Vertex nomination: The canonical sampling and the extended spectral nomination schemes
Viaarxiv icon

Robust Vertex Classification

Add code
Apr 22, 2015
Figure 1 for Robust Vertex Classification
Figure 2 for Robust Vertex Classification
Figure 3 for Robust Vertex Classification
Figure 4 for Robust Vertex Classification
Viaarxiv icon

Perfect Clustering for Stochastic Blockmodel Graphs via Adjacency Spectral Embedding

Add code
Jan 15, 2015
Figure 1 for Perfect Clustering for Stochastic Blockmodel Graphs via Adjacency Spectral Embedding
Figure 2 for Perfect Clustering for Stochastic Blockmodel Graphs via Adjacency Spectral Embedding
Viaarxiv icon

Techniques for clustering interaction data as a collection of graphs

Add code
Jan 10, 2015
Figure 1 for Techniques for clustering interaction data as a collection of graphs
Figure 2 for Techniques for clustering interaction data as a collection of graphs
Figure 3 for Techniques for clustering interaction data as a collection of graphs
Figure 4 for Techniques for clustering interaction data as a collection of graphs
Viaarxiv icon