8 citations · 17 across the 12 of their papers we have counts for
3 papers · 1 filter
Higher-Order Spectral Clustering for Geometric Graphs
Konstantin Avrachenkov, Andrei Bobu, Maximilien Dreveton
The present paper is devoted to clustering geometric graphs. While the standard spectral clustering is often not effective for geometric graphs, we present an effective generalizat…
Community recovery in non-binary and temporal stochastic block models
Konstantin Avrachenkov, Maximilien Dreveton, Lasse Leskelä
This article studies the estimation of latent community memberships from pairwise interactions in a network of nodes, where the observed interactions can be of arbitrary type,…
Almost exact recovery in noisy semi-supervised learning
Konstantin Avrachenkov, Maximilien Dreveton
Graph-based semi-supervised learning methods combine the graph structure and labeled data to classify unlabeled data. In this work, we study the effect of a noisy oracle on classif…