Node Embedding via Word Embedding for Network Community Discovery

11/09/2016
by   Weicong Ding, et al.
0

Neural node embeddings have recently emerged as a powerful representation for supervised learning tasks involving graph-structured data. We leverage this recent advance to develop a novel algorithm for unsupervised community discovery in graphs. Through extensive experimental studies on simulated and real-world data, we demonstrate that the proposed approach consistently improves over the current state-of-the-art. Specifically, our approach empirically attains the information-theoretic limits for community recovery under the benchmark Stochastic Block Models for graph generation and exhibits better stability and accuracy over both Spectral Clustering and Acyclic Belief Propagation in the community recovery limits.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/29/2022

Exact Community Recovery in Correlated Stochastic Block Models

We consider the problem of learning latent community structure from mult...
research
11/27/2018

Adaptive-similarity node embedding for scalable learning over graphs

Node embedding is the task of extracting informative and descriptive fea...
research
10/13/2021

SSSNET: Semi-Supervised Signed Network Clustering

Node embeddings are a powerful tool in the analysis of networks; yet, th...
research
10/04/2013

Spectral Clustering for Divide-and-Conquer Graph Matching

We present a parallelized bijective graph matching algorithm that levera...
research
06/09/2021

DIGRAC: Digraph Clustering with Flow Imbalance

Node clustering is a powerful tool in the analysis of networks. Here, we...
research
01/31/2022

Differentially Private Community Detection for Stochastic Block Models

The goal of community detection over graphs is to recover underlying lab...

Please sign up or login with your details

Forgot password? Click here to reset