On consistent vertex nomination schemes
From MaRDI portal
Recommendations
- On the consistency of the likelihood maximization vertex nomination scheme: bridging the gap between maximum likelihood estimation and graph matching
- Vertex nomination, consistent estimation, and adversarial modification
- Vertex nomination: the canonical sampling and the extended spectral nomination schemes
- Vertex nomination schemes for membership prediction
- Toward quantifying vertex similarity in networks
Cites work
- A Consistent Adjacency Spectral Embedding for Stochastic Blockmodel Graphs
- A nonparametric two-sample hypothesis testing problem for random graphs
- A nonparametric view of network models and Newman–Girvan and other modularities
- Asymmetric graphs
- Collective dynamics of `small-world' networks
- Consistent nonparametric regression. Discussion
- Diffusion maps
- Graph-based natural language processing and information retrieval.
- scientific article; zbMATH DE number 3150484 (Why is no real title available?)
- Information Recovery in Shuffled Graphs via Graph Matching
- Introduction to Information Retrieval
- Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
- Latent Space Approaches to Social Network Analysis
- Learning to rank on graphs
- Manifold regularization: a geometric framework for learning from labeled and unlabeled examples
- Markov Graphs
- Matchability of heterogeneous networks pairs
- Mixed membership stochastic blockmodels
- On the asymmetry of random regular graphs and random graphs
- On the consistency of the likelihood maximization vertex nomination scheme: bridging the gap between maximum likelihood estimation and graph matching
- Perfect clustering for stochastic blockmodel graphs via adjacency spectral embedding
- Random Dot Product Graph Models for Social Networks
- Recommender Systems Handbook
- Spectral clustering and the high-dimensional stochastic blockmodel
- Statistical mechanics of complex networks
- Support vector machines are universally consistent
- Universally consistent vertex classification for latent positions graphs
- Vertex nomination schemes for membership prediction
- Vertex nomination via seeded graph matching
- Vertex nomination: the canonical sampling and the extended spectral nomination schemes
Cited in
(10)- Locating names on vertices of a transaction network
- Vertex nomination, consistent estimation, and adversarial modification
- Vertex nomination: the canonical sampling and the extended spectral nomination schemes
- Universally consistent vertex classification for latent positions graphs
- Vertex nomination via seeded graph matching
- Toward quantifying vertex similarity in networks
- Vertex Nomination Between Graphs via Spectral Embedding and Quadratic Programming
- Subgraph nomination: query by example subgraph retrieval in networks
- Novel network trimming for robust vertex nomination in contaminated networks
- Vertex nomination schemes for membership prediction
This page was built for publication: On consistent vertex nomination schemes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5381123)
