README.md

April 24, 2026 · View on GitHub

CoCo: Compactness and Consistency for Deep Graph Clustering

A Deep Graph Clustering Framework.

Paper GitHub Code ICLR 2026

This is the pytorch implementation for our ICLR 2026 Oral:

Wei Ju, Siyu Yi, Kangjie Zheng, Yifan Wang, Ziyue Qiao, Li Shen, Yongdao Zhou, Xiaochun Cao, Jiancheng Lv. Compactness and Consistency: A Conjoint Framework for Deep Graph Clustering. ICLR 2026 Oral


🛠️Overview

framework

CoCo is a deep graph clustering framework designed to learn compact and semantically consistent node representations from graph data. The method addresses two core issues in existing graph clustering methods:

  • limited ability of local message passing to capture long-range dependencies;
  • redundancy and noise in graph data that harm representation quality.

To solve this, CoCo combines:

  1. Local-view and global-view feature extraction using graph convolutional filters on the original graph and a graph diffusion graph;
  2. Compactness learning via GMM-based low-rank subspace training and feature reconstruction;
  3. Consistency learning by aligning node-wise similarity distributions across the two views.

After training, the local and global compact embeddings are fused and K-means is applied to obtain final clustering assignments.


🚀 Quickstart

1.Environment

The paper implementation is based on PyTorch.

conda create -n coco python=3.10 -y
conda activate coco
pip install -r requirements.txt

2.Dataset preparation

The main graph clustering experiments use the following datasets:

  • Cora
  • AMAP
  • BAT
  • EAT
  • UAT

Data layout:

dataset/<dataset>/
├── <dataset>_feat.npy
├── <dataset>_label.npy
└── <dataset>_adj.npy

3.RUN

Main clustering experiments

python train.py --dataset cora 

Dataset configuration could be found in setup.py.

The reported metrics are:

  • ACC: clustering accuracy
  • NMI: normalized mutual information
  • ARI: adjusted rand index
  • F1: macro F1-score

For reproducibility, report the mean ± standard deviation over 10 runs.


📈Main results

Graph clustering

DatasetACCNMIARIF1
Cora79.3660.7158.7677.95
AMAP79.2768.8560.9472.36
BAT78.8555.0053.5278.56
EAT58.8734.1027.9158.06
UAT59.6830.1229.4658.03

📝Citation

If you find this work useful, please cite:

@inproceedings{ju2026compactness,
  title={Compactness and Consistency: A Conjoint Framework for Deep Graph Clustering},
  author={Ju, Wei and Yi, Siyu and Zheng, Kangjie and Wang, Yifan and Qiao, Ziyue and Shen, Li and Zhou, Yongdao and Cao, Xiaochun and Lv, Jiancheng},
  booktitle={The Fourteenth International Conference on Learning Representations},
  year={2026}
}

🙏Acknowledgment

This repository utilizes the pre-processed datasets provided by the following sources. We gratefully acknowledge the authors and contributors for their valuable work and open sharing: