Matrix factorisation and the interpretation of geodesic distance

Abstract

Given a graph or similarity matrix, we consider the problem of recovering a notion of true distance between the nodes, and so their true positions. We show that this can be accomplished in two steps: matrix factorisation, followed by nonlinear dimension reduction. This combination is effective because the point cloud obtained in the first step lives close to a manifold in which latent distance is encoded as geodesic distance. Hence, a nonlinear dimension reduction tool, approximating geodesic distance, can recover the latent positions, up to a simple transformation. We give a detailed account of the case where spectral embedding is used, followed by Isomap, and provide encouraging experimental evidence for other combinations of techniques.

References in corpus (6)

• Stochastic blockmodels and community structure in networks
• The multilayer random dot product graph
• Spectral clustering on spherical coordinates under the degree-corrected stochastic blockmodel
• Exact Recovery of Community Structures Using DeepWalk and Node2vec
• Learning 1-Dimensional Submanifolds for Subsequent Inference on Random Dot Product Graphs
• Spectral clustering under degree heterogeneity: a case for the random walk Laplacian