Algorithm 1 Deep Graph Clustering via Graph Augmentation

Require:   Attribute matrix X, adjacent matrix A, iteration number $iter$, hyperparameter $\lambda ,K$ Ensure:   Clustering result Y; Construct Top-K similarity matrix $A_s$ for$t=1$ to $iter$ do    Generate the embeddings $h_1,h_2$ by (1),(2)    Generate $h_f$ by (3)    Construct M by (4)    Calculate reconstruction loss by (11)    Generate Q by (12)    Generate P by (13)    Calculate clustering loss by (14)    Update the whole framework by (15) end for Obtain Y by (16). returnY;