search

anamabo / Equal-Size-Spectral-Clustering

A modification of the spectral clustering algorithm that imposes constraints on cluster sizes.
17 stars 5 forks source link

clustering centeriods #2

Open Yonoi opened 1 year ago

Yonoi commented 1 year ago

In this program, I can only get clustering labels，how to get the clustering centeriods?

MrHaikuSwan commented 1 year ago

I think you're thinking of k-means clustering, which uses centroids; spectral clustering is a graph partitioning algorithm that doesn't use centroids, but instead tries to minimize the cost of cutting the graph into k partitions.

bteinstein commented 11 months ago

@Yonoi I am of the opinion that you can determine the centroid of each cluster by computing the mean of both the latitude and longitude coordinates within each. I trust this information will be beneficial.