Fuzzy c-Medoid Graph Clustering

摘要

We present a modified fuzzy c-medoid algorithm to find central objects in graphs. Initial cluster centres are determined by graph centrality measures. Cluster centres are fine-tuned by minimizing fuzzyweighted geodesic distances calculated by Dijkstra’s algorithm. Cluster validity indices show significant improvement against fuzzy c-medoid clustering.