I've a graph representing a social network ( 597 nodes, 177906 edges). Each edge has a weight saying how much two nodes are similar. I'd like to apply some clustering algorithm to this network but I think I need to cut some edge. Is there a commonly used threshold to do this?

Can you suggest any particular algorithm? I was suggested to use K-means but I think it badly fit to my data space.

**Contents**hide

#### Best Answer

600 nodes is tiny, so you shouldn't have scalability problems.

Try:

Hierarchical agglomerative clustering (implement it for similarity, not distance!)

Spectral clustering

Affinity propagation

K-medoids with affinity

### Similar Posts:

- Solved – Correlation Clustering
- Solved – How to detect k number of communities in a weighted graph/network
- Solved – Community detection (graph clustering) of a weighted graph with node attribute (categorical or quantitative)
- Solved – Clustering a completely interconnected graph with weighted edges
- Solved – Clustering a completely interconnected graph with weighted edges