“…Figure 2. IAC Clustering Algorithm [11] An augmented graph is a graph G = (V, E, ߯), where V = {v 1 , v 2 , v 3 , …,v n } is the set of nodes and n = |V| denotes the number of nodes in the graph, E ⊂ V× V is the set of edges,E = {(v i , v j ): v i , v j ∈V}, and ߯∈ R |v| × d is the nodes attribute matrix. First of all, the algorithm creates the similarity matrix C, then according to K (K = ߙ× E) it adds the set of edges to the graph and the elements which belong to these edges are set to 1 in matrix S. As well as matrix W is made by summation of S and A.…”