Leveraging Non-linear Dimension Reduction and Random Walk Co-occurrence for Node Embedding

Fuente: arXiv
Saved in:
Bibliographic Details
Main Author: DeWolfe, Ryan
Format: Preprint
Published: 2026
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866917299718455296
author DeWolfe, Ryan
author_facet DeWolfe, Ryan
contents Leveraging non-linear dimension reduction techniques, we remove the low dimension constraint from node embedding and propose COVE, an explainable high dimensional embedding that, when reduced to low dimension with UMAP, slightly increases performance on clustering and link prediction tasks. The embedding is inspired by neural embedding methods that use co-occurrence on a random walk as an indication of similarity, and is closely related to a diffusion process. Extending on recent community detection benchmarks, we find that a COVE UMAP HDBSCAN pipeline performs similarly to the popular Louvain algorithm.
format Preprint
id arxiv_https___arxiv_org_abs_2602_24069
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Leveraging Non-linear Dimension Reduction and Random Walk Co-occurrence for Node Embedding
DeWolfe, Ryan
Machine Learning
Social and Information Networks
Leveraging non-linear dimension reduction techniques, we remove the low dimension constraint from node embedding and propose COVE, an explainable high dimensional embedding that, when reduced to low dimension with UMAP, slightly increases performance on clustering and link prediction tasks. The embedding is inspired by neural embedding methods that use co-occurrence on a random walk as an indication of similarity, and is closely related to a diffusion process. Extending on recent community detection benchmarks, we find that a COVE UMAP HDBSCAN pipeline performs similarly to the popular Louvain algorithm.
title Leveraging Non-linear Dimension Reduction and Random Walk Co-occurrence for Node Embedding
topic Machine Learning
Social and Information Networks
url https://arxiv.org/abs/2602.24069