A Graph Clustering Algorithm Based on the Intra Vertex Adjacent Ratio

Abstract

This paper proposes a new clustering coefficient based on the number of connecting vertices within a cluster (called inter vertex adjacent ratio, IVAR) and proposes a new clustering algorithm based on IVAR. Finally, the analysis of algorithm applicability shows that the algorithm is more applicative and effective for regular graphs than the vertex-clustering algorithm based on intra connection ratio [L. Moussiades and A. Vakali, Clustering dense graph: A web site graph paradigm. Information Processing and Management, vol. 46, pp.247-267, 2010].