I want to cluster a graph using the FCM algorithm, I used the adjacency matrix of the graph as the data, and the "Euclidean" distance as metric. The problem is that the adjacency matrix is full of zero's (depends actually on the degree of the node) and my network is a kinda huge more than 2000 node. For the results I get many small size clusters and some big size clusters, that some time contain about 50% of the population and it is not right.
I think my problem is from the data representation. is there any conditions that must be satisfied apart from the FCM algorithm conditions.