atlas

Research map / Graph learning / Graph algorithms and clustering

Out-of-sample extension of graph adjacency spectral embedding

ICML 2018 · Graph learning › Graph algorithms and clustering · approach: Graph embedding and spectral sparsification · 1 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (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 changedWhereMeasuredEffect
Use LLS OOS instead of recomputing the full-graph ASEAdjacency spectral embedding on random dot product graphs · Random dot product graphlatent-position estimation error: c n^{-1/2} \log n; O(n^{-1/2} \log n)No clear effect
Use constrained plug-in maximum likelihood instead of recomputing the full-graph ASEAdjacency spectral embedding on random dot product graphs · Random dot product graphlatent-position estimation error: cn^{-1/2} \log n; O(n^{-1/2} \log n)No clear effect
Use LLS OOS rather than full-graph ASE for many simultaneous out-of-sample verticesTwo-block random dot product graph · OOS vertex classificationclassification errorMixed
Increase the number of simultaneous OOS vertices and embed them jointly with the in-sample graphFull-graph ASE · Two-block random dot product graphclassification errorHelped

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy