I'm following this example here:
https://www.stackoverflow.com/questions/60205100/define-cluster-centers-manually
He sets the initial position of the centroids and run one iteration only, so the centroids end up being the initially set ones. I was able to reproduce in my code.
I am also looking for the probabilities as result, I was able using:
https://scikit-learn.org/0.16/modules/generated/sklearn.mixture.GMM.html
I tried to use the same approach (init) used on KMeans but I don't think there's a way using GMM.
So how can I do it? Are there other algorithms/ways?
PS: I understand that they are different algorithms, I'm only trying to interpret the data better.
It's not very clear what you are trying to achieve here. Kmeans works by minimizing the elucidean distance within clusters, so there's not so much of a probability here. To calculate a probability, you need to make certain assumptions, for example, the data within the cluster follows a multivariate gaussian. Below is a rough estimation and it really depends on your data.
Note that with 1 iteration, the means can change slightly depending on your dataset, for example:
Now if we run kmeans like in that post, the means will change (slightly):
And to answer your question, to use GMM to kind of obtain a rough probability based on the kmeans results, we can do: