Understanding the quality of the KMeans algorithm

断了今生、忘了曾经 提交于 2019-12-13 07:01:25

问题


After reading Unbalanced factor of KMeans, I am trying to understand how this works. I mean, from my examples, I can see that the less the value of the factor, the better the quality of KMeans clustering, i.e. the more balanced are its clusters. But what is the naked mathematical interpretation of this factor? Is this a known quantity or something?


Here are my examples:

C1 = 10
C2 = 100

pdd = [(C1,10), (C2, 100)]
n = 2        <-- #clusters
total = 110  <-- #points
uf = 10 * 10 + 100 * 100
uf = 100100 * 2 / 12100 = 16.5

C1 = 50
C2 = 60

pdd = [(C1, 50), (C2, 60)]
n = 2        
total = 110  
uf = 2500 + 3600
uf = 6100 * 2 / 12100 = 1.008

C1 = 1
C2 = 1

pdd = [(C1, 1), (C2, 1)]
n = 2       
total = 2
uf = 2
uf = 2 * 2 / 2 * 2 = 1

回答1:


It appears to be related to Gini index, a measure of entropy, which also uses the sum of squared counts.

as said in Cross Validated: Understanding the quality of the KMeans algorithm.



来源:https://stackoverflow.com/questions/39240078/understanding-the-quality-of-the-kmeans-algorithm

易学教程内所有资源均来自网络或用户发布的内容,如有违反法律规定的内容欢迎反馈
该文章没有解决你所遇到的问题?点击提问,说说你的问题,让更多的人一起探讨吧!