Papers with Code 아카이브
graph partitioning
태스크의 하위 분류와 논문·코드·평가·기법·데이터셋을 탐색하세요.
- 하위 태스크
- 0
- 평가표
- 1
- 보존된 평가 기록
- 1
Graph Partitioning is generally the first step of distributed graph computing tasks. The targets are load-balance and minimizing the communication volume.
논문
이 태스크와 하위 분야의 관련 논문입니다. 실제 성능 비교는 평가 결과에서 확인하세요.
GLISP: A Scalable GNN Learning System by Exploiting Inherent Structural Properties of Graphs
Large Scale Training of Graph Neural Networks for Optimal Markov-Chain Partitioning Using the Kemeny Constant
Uplifting the Expressive Power of Graph Neural Networks through Graph Partitioning
A Novel Differentiable Loss Function for Unsupervised Graph Neural Networks in Graph Partitioning
BClean: A Bayesian Data Cleaning System
NeuroCUT: A Neural Approach for Robust Graph Partitioning
Mitigating Pilot Contamination and Enabling IoT Scalability in Massive MIMO Systems
DGC: Training Dynamic Graphs with Spatio-Temporal Non-Uniformity using Graph Partitioning by Chunks
An Experimental Comparison of Partitioning Strategies for Distributed Graph Neural Network Training
Accelerating Generic Graph Neural Networks via Architecture, Compiler, Partition Method Co-Design
Federated Classification in Hyperbolic Spaces via Secure Aggregation of Convex Hulls
Self-supervised Few-shot Learning for Semantic Segmentation: An Annotation-free Approach
Spectral Normalized-Cut Graph Partitioning with Fairness Constraints
Edge-set reduction to efficiently solve the graph partitioning problem with the genetic algorithm
PolicyClusterGCN: Identifying Efficient Clusters for Training Graph Convolutional Networks
BatchGNN: Efficient CPU-Based Distributed GNN Training on Very Large Graphs
Graph Ladling: Shockingly Simple Parallel GNN Training without Intermediate Communication
Creating Multi-Level Skill Hierarchies in Reinforcement Learning
Fast Algorithms for Directed Graph Partitioning Using Flows and Reweighted Eigenvalues
One-step Bipartite Graph Cut: A Normalized Formulation and Its Application to Scalable Subspace Clustering
Distributed Compressed Sparse Row Format for Spiking Neural Network Simulation, Serialization, and Interoperability
Inductive Graph Unlearning
Distributed Graph Embedding with Information-Oriented Random Walks
A parameter-free graph reduction for spectral clustering and SpectralNet
Random projection tree similarity metric for SpectralNet
Refining a $k$-nearest neighbor graph for a computationally efficient spectral clustering
Approximate spectral clustering with eigenvector selection and self-tuned $k$
Approximate spectral clustering density-based similarity for noisy datasets
Graph Construction using Principal Axis Trees for Simple Graph Convolution
Random Projection Forest Initialization for Graph Convolutional Networks
Fair and skill-diverse student group formation via constrained k-way graph partitioning
Task-specific Scene Structure Representations
Scalable Graph Convolutional Network Training on Distributed-Memory Systems
AGO: Boosting Mobile AI Inference Performance by Removing Constraints on Graph Optimization
Sub-Graph Learning for Spatiotemporal Forecasting via Knowledge Distillation
출처: Papers with Code · CC BY-SA 4.0. 아카이브 자료와 새로 수집한 논문은 별도로 관리합니다.