Browse > Graphs > graph partitioning

# graph partitioning Edit

10 papers with code · Graphs

No evaluation results yet. Help compare methods by submit evaluation metrics.

# PyTorch-BigGraph: A Large-scale Graph Embedding System

Graph embedding methods produce unsupervised node features from graphs that can then be used for a variety of machine learning tasks.

2,042

# Graph-Partitioning-Based Diffusion Convolution Recurrent Neural Network for Large-Scale Traffic Forecasting

24 Sep 2019liyaguang/DCRNN

For the first time, we forecast the traffic of the entire California highway network with 11, 160 traffic sensor locations simultaneously.

406

# Ego-splitting Framework: from Non-Overlapping to Overlapping Clusters

More precisely, our framework works in two steps: a local ego-net analysis phase, and a global graph partitioning phase .

SOTA for Community Detection on Amazon (NMI metric )

312

# Intel nGraph: An Intermediate Representation, Compiler, and Executor for Deep Learning

24 Jan 2018NervanaSystems/ngraph-python

The current approach, which we call "direct optimization", requires deep changes within each framework to improve the training performance for each hardware backend (CPUs, GPUs, FPGAs, ASICs) and requires $\mathcal{O}(fp)$ effort; where $f$ is the number of frameworks and $p$ is the number of platforms.

217

# Improving Coarsening Schemes for Hypergraph Partitioning by Exploiting Community Structure

We present an improved coarsening process for multilevel hypergraph partitioning that incorporates global information about the community structure.

63

# Towards Efficient Large-Scale Graph Neural Network Computing

This evolution has led to large graph-based irregular and sparse models that go beyond what existing deep learning frameworks are designed for.

46

# Leveraging Domain Knowledge to Improve Microscopy Image Segmentation with Lifted Multicuts

25 May 2019constantinpape/cluster_tools

The throughput of electron microscopes has increased significantly in recent years, enabling detailed analysis of cell morphology and ultrastructure.

12

# Learning Space Partitions for Nearest Neighbor Search

24 Jan 2019twistedcubic/learn-to-hash

Space partitions of $\mathbb{R}^d$ underlie a vast and important class of fast nearest neighbor search (NNS) algorithms.

10

# Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching

Using this concept, we extend our method to multi-graph partitioning and matching by learning a Gromov-Wasserstein barycenter graph for multiple observed graphs; the barycenter graph plays the role of the disconnected graph, and since it is learned, so is the clustering.

7

# The Product Cut

We introduce a theoretical and algorithmic framework for multi-way graph partitioning that relies on a multiplicative cut-based objective.

1