A Vertex-Clustering Algorithm Based on the Cluster-Clique

摘要

The vertex-clustering algorithm based on intra connection ratio (MV-ICR algorithm) is a graph-clustering algorithm proposed by Moussiades and Vakali[Clustering dense graph: A web site graph paradigm. Information Processing and Management, 2010, 46:247-267]. In this paper, we propose a new conception called cluster-clique for vertex-clustering of graphs. And based on the cluster-clique and the intra connection ratio, a new vertex-clustering algorithm is proposed. This algorithm is more reasonable and effective than MV-ICR algorithm for some clusters which have the same maximum intra connection ratio.