Picture for Keith Levin

Keith Levin

On the role of features in vertex nomination: Content and context together are better (sometimes)

May 06, 2020
Figure 1 for On the role of features in vertex nomination: Content and context together are better (sometimes)
Figure 2 for On the role of features in vertex nomination: Content and context together are better (sometimes)
Figure 3 for On the role of features in vertex nomination: Content and context together are better (sometimes)
Figure 4 for On the role of features in vertex nomination: Content and context together are better (sometimes)
Viaarxiv icon

Limit theorems for out-of-sample extensions of the adjacency and Laplacian spectral embeddings

Sep 29, 2019
Figure 1 for Limit theorems for out-of-sample extensions of the adjacency and Laplacian spectral embeddings
Figure 2 for Limit theorems for out-of-sample extensions of the adjacency and Laplacian spectral embeddings
Figure 3 for Limit theorems for out-of-sample extensions of the adjacency and Laplacian spectral embeddings
Figure 4 for Limit theorems for out-of-sample extensions of the adjacency and Laplacian spectral embeddings
Viaarxiv icon

Recovering low-rank structure from multiple networks with unknown edge distributions

Jun 13, 2019
Figure 1 for Recovering low-rank structure from multiple networks with unknown edge distributions
Figure 2 for Recovering low-rank structure from multiple networks with unknown edge distributions
Figure 3 for Recovering low-rank structure from multiple networks with unknown edge distributions
Figure 4 for Recovering low-rank structure from multiple networks with unknown edge distributions
Viaarxiv icon

On consistent vertex nomination schemes

May 29, 2018
Figure 1 for On consistent vertex nomination schemes
Figure 2 for On consistent vertex nomination schemes
Figure 3 for On consistent vertex nomination schemes
Figure 4 for On consistent vertex nomination schemes
Viaarxiv icon

Out-of-sample extension of graph adjacency spectral embedding

Feb 17, 2018
Figure 1 for Out-of-sample extension of graph adjacency spectral embedding
Figure 2 for Out-of-sample extension of graph adjacency spectral embedding
Figure 3 for Out-of-sample extension of graph adjacency spectral embedding
Viaarxiv icon

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

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

Statistical inference on random dot product graphs: a survey

Sep 16, 2017
Figure 1 for Statistical inference on random dot product graphs: a survey
Figure 2 for Statistical inference on random dot product graphs: a survey
Figure 3 for Statistical inference on random dot product graphs: a survey
Figure 4 for Statistical inference on random dot product graphs: a survey
Viaarxiv icon

Query-by-Example Search with Discriminative Neural Acoustic Word Embeddings

Add code
Jun 12, 2017
Figure 1 for Query-by-Example Search with Discriminative Neural Acoustic Word Embeddings
Figure 2 for Query-by-Example Search with Discriminative Neural Acoustic Word Embeddings
Figure 3 for Query-by-Example Search with Discriminative Neural Acoustic Word Embeddings
Figure 4 for Query-by-Example Search with Discriminative Neural Acoustic Word Embeddings
Viaarxiv icon

On the Consistency of the Likelihood Maximization Vertex Nomination Scheme: Bridging the Gap Between Maximum Likelihood Estimation and Graph Matching

Aug 27, 2016
Figure 1 for On the Consistency of the Likelihood Maximization Vertex Nomination Scheme: Bridging the Gap Between Maximum Likelihood Estimation and Graph Matching
Figure 2 for On the Consistency of the Likelihood Maximization Vertex Nomination Scheme: Bridging the Gap Between Maximum Likelihood Estimation and Graph Matching
Figure 3 for On the Consistency of the Likelihood Maximization Vertex Nomination Scheme: Bridging the Gap Between Maximum Likelihood Estimation and Graph Matching
Figure 4 for On the Consistency of the Likelihood Maximization Vertex Nomination Scheme: Bridging the Gap Between Maximum Likelihood Estimation and Graph Matching
Viaarxiv icon

Laplacian Eigenmaps from Sparse, Noisy Similarity Measurements

Aug 16, 2016
Figure 1 for Laplacian Eigenmaps from Sparse, Noisy Similarity Measurements
Figure 2 for Laplacian Eigenmaps from Sparse, Noisy Similarity Measurements
Figure 3 for Laplacian Eigenmaps from Sparse, Noisy Similarity Measurements
Figure 4 for Laplacian Eigenmaps from Sparse, Noisy Similarity Measurements
Viaarxiv icon