Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 237

The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.

Deep Graph Clustering via Dual Correlation Reduction

Open access
Liu, Yue, Tu, Wenxuan, Zhou, Sihang, Liu, Xinwang, Song, Linxuan, Yang, Xihong, Zhu, En · 2022 · Proceedings of the AAAI Conference on Artificial Intelligence

Abstract

Deep graph clustering, which aims to reveal the underlying graph structure and divide the nodes into different groups, has attracted intensive attention in recent years. However, we observe that, in the process of node encoding, existing methods suffer from representation collapse which tends to map all data into the same representation. Consequently, the discriminative capability of the node representation is limited, leading to unsatisfied clustering performance. To address this issue, we propose a novel self-supervised deep graph clustering method termed Dual Correlation Reduction Network (DCRN) by reducing information correlation in a dual manner. Specifically, in our method, we first design a siamese network to encode samples. Then by forcing the cross-view sample correlation matrix and cross-view feature correlation matrix to approximate two identity matrices, respectively, we reduce the information correlation in the dual-level, thus improving the discriminative capability of the resulting features. Moreover, in order to alleviate representation collapse caused by over-smoothing in GCN, we introduce a propagation regularization term to enable the network to gain long-distance information with the shallow network structure. Extensive experimental results on six benchmark datasets demonstrate the effectiveness of the proposed DCRN against the existing state-of-the-art methods. The code of DCRN is available at https://github.com/yueliu1999/DCRN and a collection (papers, codes and, datasets) of deep graph clustering is shared at https://github.com/yueliu1999/Awesome-Deep-Graph-Clustering on Github.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1609/aaai.v36i7.20726

Cites

8 of 8 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 8 references

Metadata

Authors
Liu, Y., Tu, W., Zhou, S., Liu, X., Song, L., Yang, X., & Zhu, E.
Venue
Proceedings of the AAAI Conference on Artificial Intelligence
Published
2022-06-28
Volume
36
Issue
7
Pages
7603-7611
ISSN
  • 2159-5399 (ISSN-L)
  • 2374-3468
OpenAlex
W4226219101
Cited by
237
References
8
FWCI
30.55
Type
conference paper
Language
en
Open access
diamond

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Deep Graph Clustering via Dual Correlation Reduction. https://app.cochat.ai/papers/10.1609/aaai.v36i7.20726
The paper
Liu, Y., Tu, W., Zhou, S., Liu, X., Song, L., Yang, X., & Zhu, E. (2022). Deep Graph Clustering via Dual Correlation Reduction. Proceedings of the AAAI Conference on Artificial Intelligence. https://doi.org/10.1609/aaai.v36i7.20726

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.