Network Clustering by Embedding of Attribute-augmented Graphs
In this paper we propose a new approach to detect clusters in undirected graphs with attributed vertices. The aim is to group vertices which are similar
not only in terms of structural connectivity but also in terms of attribute values.
We incorporate structural and attribute similarities between the vertices in an augmented graph by creating additional vertices and edges as proposed in [6, 38]. The
augmented graph is then embedded in a Euclidean space associated to its Laplacian
where a modified K-means algorithm is applied to identify clusters.






