AGCTO: Attributed Graph Clustering With Transitive Order Convolutional Autoencoder

Authors:
Publisher website
Google Scholar
Abstract
Attributed graphs, which associate vertices or edges with attributes, are essential in applications like social network analysis, recommendation systems, bioinformatics, and healthcare analysis. However, their high-dimensional and non-Euclidean nature complicates tasks such as vertex classification, community detection, graph visualization, and graph embedding. Existing techniques often inadequately integrate structural and attribute data, and reconstruction-centric models can compromise graph topology. Additionally, many methods require extensive manual hyperparameter tuning. To address these challenges, we introduce Attributed Graph Clustering with Transitive Order convolutional autoencoder (AGCTO). AGCTO uses a Graph Transitive Convolutional AutoEncoder (GTCAE) framework that integrates structural and attribute information. A key innovation is the Graph ORder Distance (GORD), capturing topological relationships to enhance clustering performance. AGCTO's unified loss function combines GTCAE loss on the original graph, GTCAE loss on a simplified graph via GORD, and a topology-preserving loss. This ensures effective fusion of attribute and structure data and preserves graph topology. Evaluations on four real-world and two synthetic attributed graphs show AGCTO's superiority in clustering accuracy, normalized mutual information, F1-score, and Q-modularity. AGCTO offers a robust solution for attributed graph clustering, maintaining graph topology and delivering superior performance.
Funding Information
  • National Natural Science Foundation of China (62276146)
  • Natural Science Foundation of Fujian Province, China (2020J01923)

This publication has 40 references indexed in Scilit: