New k-NN Classifier Leverages Gromov-Wasserstein Distances for Graphs

By PulseAugur Editorial · [2 sources] · 2026-06-09 01:33

Researchers have developed a $k$-nearest neighbors ($k$-NN) classification method utilizing Gromov--Wasserstein (GW) and fused Gromov--Wasserstein (fGW) distances. This approach allows for direct comparison of graphs with varying numbers of nodes and can incorporate node features. The study proves the universal consistency of these GW-based $k$-NN classifiers for both general graphs and node-attributed graphs, with experimental results showing strong performance. AI

RANK_REASON This is a research paper detailing a new methodology for graph comparison and classification.

Read on arXiv stat.ML →

paper
other

AI-generated summary · Google Gemini · from 2 sources. How we write summaries →

COVERAGE [2]

arXiv stat.ML TIER_1 English(EN) · Kaitlyn Hohmeier, Nicolas Fraiman, Caroline Moosmueller · 2026-06-10 04:00

$k$-Nearest Neighbors in Gromov--Wasserstein Space

arXiv:2606.10295v1 Announce Type: new Abstract: The Gromov--Wasserstein (GW) distance provides a framework for comparing metric measure spaces, regardless of their underlying structure or geometry. For network-based data, it enables direct comparisons of graphs with different num…
arXiv stat.ML TIER_1 English(EN) · Caroline Moosmueller · 2026-06-09 01:33

$k$-Nearest Neighbors in Gromov--Wasserstein Space

The Gromov--Wasserstein (GW) distance provides a framework for comparing metric measure spaces, regardless of their underlying structure or geometry. For network-based data, it enables direct comparisons of graphs with different numbers of nodes, without requiring an embedding or…

COVERAGE [2]

$k$-Nearest Neighbors in Gromov--Wasserstein Space

$k$-Nearest Neighbors in Gromov--Wasserstein Space

RELATED ENTITIES

RELATED TOPICS