Research map / Graph learning / Graph algorithms and clustering
On the Consistency of the Likelihood Maximization Vertex Nomination Scheme: Bridging the Gap Between Maximum Likelihood Estimation and Graph Matching
Vince Lyzinski, Keith Levin, Donniell E. Fishkind, Carey E. Priebe
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| use known instead of unknown (smoothed estimate) model parameters | ML vertex nomination · SBM small case | mean average precision: 0.670 vs 0.680 | No clear effect |
| use ML vertex nomination instead of spectral | ML vertex nomination · SBM medium case | mean average precision: 0.954 vs 0.738 | Improved |
| use ML vertex nomination instead of spectral | ML vertex nomination · SBM small case | mean average precision: 0.670 vs 0.388 | Improved |
| use full ML instead of restricted-focus ML | ML vertex nomination · SBM small case | mean average precision: 0.670 vs 0.588 | Improved |
| use canonical instead of ML vertex nomination | canonical vertex nomination · SBM small case | mean average precision: 0.700 vs 0.670 | Improved |
| project spectral embeddings to the unit sphere (ablation) | spectral vertex nomination · SBM medium case | nomination performance | No clear effect |
| project spectral embeddings to the unit sphere (ablation) | spectral vertex nomination · Dickens word co-occurrence and political blogs | AP | Improved |
| add more seeds from 2 to 10 with estimated parameters (ablation) | ML vertex nomination · word co-occurrence network | AP | Hurt |
| use ML instead of spectral vertex nomination | ML vertex nomination · Zachary's karate club | AP | Hurt |
| add vertex features to ML vertex nomination (ablation) | feature-based ML vertex nomination · Florida Bay ecological network | AP: additional improvement of some 0.1 AP for m=8,16,32 | Improved |
| use restricted-focus ML instead of ML with unknown parameters | restricted-focus ML · political blogs | AP | Improved |
Closest papers by meaning
- On Consistent Vertex Nomination Schemes (JMLR 2019 · similarity 0.91)
- Robust Vertex Classification (TPAMI 2016 · similarity 0.86)
- Bipartite Matching in Massive Graphs: A Tight Analysis of EDCS (ICML 2024 · similarity 0.85)
- A Near-Linear Time Approximation Algorithm for Beyond-Worst-Case Graph Clustering (ICML 2024 · similarity 0.83)
- Efficient Graph Matching for Correlated Stochastic Block Models (NeurIPS 2024 · similarity 0.83)
- M3C: A Framework towards Convergent, Flexible, and Unsupervised Learning of Mixture Graph Matching and Clustering (ICLR 2024 · similarity 0.83)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
