DeepAI
Log In Sign Up

FREDE: Linear-Space Anytime Graph Embeddings

06/08/2020
by   Anton Tsitsulin, et al.
6

Low-dimensional representations, or embeddings, of a graph's nodes facilitate data mining tasks. Known embedding methods explicitly or implicitly rely on a similarity measure among nodes. As the similarity matrix is quadratic, a tradeoff between space complexity and embedding quality arises; past research initially opted for heuristics and linear-transform factorizations, which allow for linear space but compromise on quality; recent research has proposed a quadratic-space solution as a viable option too. In this paper we observe that embedding methods effectively aim to preserve the covariance among the rows of a similarity matrix, and raise the question: is there a method that combines (i) linear space complexity, (ii) a nonlinear transform as its basis, and (iii) nontrivial quality guarantees? We answer this question in the affirmative, with FREDE(FREquent Directions Embedding), a sketching-based method that iteratively improves on quality while processing rows of the similarity matrix individually; thereby, it provides, at any iteration, column-covariance approximation guarantees that are, in due course, almost indistinguishable from those of the optimal row-covariance approximation by SVD. Our experimental evaluation on variably sized networks shows that FREDE performs as well as SVD and competitively against current state-of-the-art methods in diverse data mining tasks, even when it derives an embedding based on only 10

READ FULL TEXT

page 1

page 2

page 3

page 4

03/13/2018

VERSE: Versatile Graph Embeddings from Similarity Measures

Embedding a web-scale information network into a low-dimensional vector ...
08/17/2017

When data mining meets optimization: A case study on the quadratic assignment problem

This paper presents a hybrid approach called frequent pattern based sear...
04/17/2014

A New Space for Comparing Graphs

Finding a new mathematical representations for graph, which allows direc...
11/17/2022

Interpretable Dimensionality Reduction by Feature Preserving Manifold Approximation and Projection

Nonlinear dimensionality reduction lacks interpretability due to the abs...
08/25/2022

Local Intrinsic Dimensionality Measures for Graphs, with Applications to Graph Embeddings

The notion of local intrinsic dimensionality (LID) is an important advan...
12/13/2020

Improved StyleGAN Embedding: Where are the Good Latents?

StyleGAN is able to produce photorealistic images that are almost indist...