Graph Clustering With Network Structure Indices
Published on Jun 23, 20078061 Views
Graph clustering has become ubiquitous in the study of relational data sets. We examine two simple algorithms: a new graphical adaptation of the k -medoids algorithm and the Girvan-Newman method based