Out-of-sample Extension for Latent Position Graphs

05/21/2013
by   Minh Tang, et al.
0

We consider the problem of vertex classification for graphs constructed from the latent position model. It was shown previously that the approach of embedding the graphs into some Euclidean space followed by classification in that space can yields a universally consistent vertex classifier. However, a major technical difficulty of the approach arises when classifying unlabeled out-of-sample vertices without including them in the embedding stage. In this paper, we studied the out-of-sample extension for the graph embedding step and its impact on the subsequent inference tasks. We show that, under the latent position graph model and for sufficiently large n, the mapping of the out-of-sample vertices is close to its true latent position. We then demonstrate that successful inference for the out-of-sample vertices is possible.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/17/2018

Out-of-sample extension of graph adjacency spectral embedding

Many popular dimensionality reduction procedures have out-of-sample exte...
research
12/05/2012

Universally consistent vertex classification for latent positions graphs

In this work we show that, using the eigen-decomposition of the adjacenc...
research
11/23/2013

Robust Vertex Classification

For random graphs distributed according to stochastic blockmodels, a spe...
research
09/29/2019

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

Graph embeddings, a class of dimensionality reduction techniques designe...
research
07/29/2012

Universally Consistent Latent Position Estimation and Vertex Classification for Random Dot Product Graphs

In this work we show that, using the eigen-decomposition of the adjacenc...
research
07/29/2021

Improved Reconstruction of Random Geometric Graphs

Embedding graphs in a geographical or latent space, i.e., inferring loca...
research
09/20/2021

Network Clustering by Embedding of Attribute-augmented Graphs

In this paper we propose a new approach to detect clusters in undirected...

Please sign up or login with your details

Forgot password? Click here to reset