Skip to main content

Depth-Enhanced Contrast Attribute Graph Clustering

  • Conference paper
  • First Online:
Advanced Data Mining and Applications (ADMA 2024)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 15389))

Included in the following conference series:

Abstract

Attribute graph clustering is an important clustering task. Existing graph clustering methods mostly focus on the structure and attribute information of the graph, often ignoring the potential connections between nodes. Meanwhile, contrastive learning methods mostly rely on predefined graph enhancement methods, which may limit the robustness and reliability of the views. Adaptive contrastive learning methods may not fully consider the graph structure and attribute information when generating views, which may affect clustering performance. To solve this problem, this paper proposes a new attribute graph clustering method that aims to preserve the graph structure and attribute information as much as possible while capturing the relevant information between nodes. First, a deep graph enhancement module is used to obtain a new adjacency matrix under an enhanced view, and contrastive learning is used to optimize the view learning process, ensuring that graph structure and attribute information are considered while fully considering the mutual information between nodes to optimize view generation. Then, a graph neural network (GCN) is used to learn the graph structure and attribute information to obtain graph embeddings. Next, the contrastive learning module ensures that the embeddings preserve the graph structure and attribute information while capturing the information between nodes. Finally, the embedding learning process is supervised by a graph clustering loss to make it applicable to graph clustering tasks. A large number of experiments were conducted on five benchmark datasets, and the results show that the proposed method has good performance for attribute graph clustering.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Hartigan, J.A., Wong, M.A.: Algorithm AS 136: a k-means clustering algorithm. J. Roy. Stat. Soc. Ser. C (Appl. Stat.) 28(1), 100–108 (1979)

    Google Scholar 

  2. Ng, A., Jordan, M., Weiss, Y.: On spectral clustering: Analysis and an algorithm. In: Advances in Neural Information Processing Systems, vol. 14 (2001)

    Google Scholar 

  3. Perozzi, B., AlRfou, R., Skiena, S.: DeepWalk: online learning of social representations. In: Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 701–710 (2014)

    Google Scholar 

  4. Grover, A., Leskovec, J.: node2vec: scalable feature learning for networks. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 855–864 (2016)

    Google Scholar 

  5. Kipf, T.N., Welling, M.: Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907 (2016)

  6. Kipf, T.N., Welling, M.: Variational graph auto-encoders. arXiv preprint arXiv:1611.07308 (2016)

  7. Wang, C., Pan, S., Hu, R., et al.: Attributed graph clustering: a deep attentional embedding approach. arXiv preprint arXiv:1906.06532 (2019)

  8. Bo, D., Wang, X., Shi, C., et al.: Structural deep clustering network. In: Proceedings of the Web Conference 2020, pp. 1400–1410 (2020)

    Google Scholar 

  9. Tu, W., Zhou, S., Liu, X., et al.: Deep fusion clustering network. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 35, no. 11, pp. 9978–9987 (2021)

    Google Scholar 

  10. Ding, S., Wu, B., Xu, X., et al.: Graph clustering network with structure embedding enhanced. Pattern Recogn. 144, 109833 (2023)

    Article  Google Scholar 

  11. Zhu, Y., Xu, Y., Yu, F., et al.: Deep graph contrastive representation learning. arXiv preprint arXiv:2006.04131 (2020)

  12. You, Y., Chen, T., Sui, Y., et al.: Graph contrastive learning with augmentations. In: Advances in Neural Information Processing Systems, vol. 33, pp. 5812–5823 (2020)

    Google Scholar 

  13. Li, Y., Hu, P., Liu, Z., et al.: Contrastive clustering. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 35, no. 10, 8547–8555 (2021)

    Google Scholar 

  14. Gong, L., Zhou, S., Tu, W., et al.: Attributed graph clustering with dual redundancy reduction. In: Proceedings of IJCAI (2022)

    Google Scholar 

  15. Yang, X., Liu, Y., Zhou, S., et al.: Cluster-guided contrastive graph clustering network. arXiv preprint arXiv:2301.01098 (2023)

  16. Yang, X., Tan, C., Liu, Y., et al.: CONVERT: contrastive graph clustering with reliable augmentation. In: Proceedings of the 31st ACM International Conference on Multimedia, pp. 319–327 (2023)

    Google Scholar 

  17. Wang, Y., Wang, W., Liang, Y., et al.: Mixup for node and graph classification. In: Proceedings of the Web Conference 2021, pp. 3663–3674 (2021)

    Google Scholar 

  18. Wang, Y., Wang, W., Liang, Y., et al.: NodeAug: semi-supervised node classification with data augmentation. In: Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pp. 207–217 (2020)

    Google Scholar 

  19. Liu, Y., Tu, W., Zhou, S., et al.: Deep graph clustering via dual correlation reduction. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 36, no. 7, pp. 7603–7611 (2022)

    Google Scholar 

  20. Lee, N., Lee, J., Park, C.: Augmentation-free self-supervised learning on graphs. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 36, no. 7, pp. 7372–7380 (2022)

    Google Scholar 

  21. Hassani, K., Khasahmadi, A.H.: Contrastive multi-view representation learning on graphs. In: International Conference on Machine Learning, pp. 4116–4126. PMLR (2020)

    Google Scholar 

  22. Xia, W., Wang, Q., Gao, Q., et al.: Self-consistent contrastive attributed graph clustering with pseudo-label prompt. IEEE Trans. Multimedia (2022)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Bing Kong .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2025 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Guo, X., Kong, B. (2025). Depth-Enhanced Contrast Attribute Graph Clustering. In: Sheng, Q.Z., et al. Advanced Data Mining and Applications. ADMA 2024. Lecture Notes in Computer Science(), vol 15389. Springer, Singapore. https://doi.org/10.1007/978-981-96-0821-8_2

Download citation

  • DOI: https://doi.org/10.1007/978-981-96-0821-8_2

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-96-0820-1

  • Online ISBN: 978-981-96-0821-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics