Fuzzy c-means を用いたグラフ系列のクラスタリング

抄録

In this paper, we tackle a problem for clustering a graph sequence to discover changing clusters. In the conventional method, spectral clustering with k-means is applied to this problem. In this paper, we replace the k-means to fuzzy c-means to detect the degree to which each vertex in a graph belongs to clusters in the situations of changing clusters. The experimental result shows that our method detects clusters merging with time from a graph sequence.