A Graph Clustering Algorithm Based on Adaptive Neighbors Connectivity

Abstract

This paper deals with graph clustering algorithm which partitions a set of vertices in graphs into smaller sets (clusters). Such vertices of the same set are related to each other rather than to those in the other sets. This means that most graph clustering algorithms are based on the topological shape or feature similarity. Nevertheless, these algorithms suffered from scalability because of the height computation requirements for similarity estimation. This paper represents a stimulus for the current study to introduce an algorithm that automatically finds the number of clusters based on shared neighbours among vertices. The study is based on the hypothesis that the proposed algorithm is able to efficiently find the graph clustering partitions for the whole graphs.