有谁可以帮我翻译一下spss对于k均值聚类的初始聚类中心的算法吗?
If minid(xk,Mi)>dmn and d(xk,Mm)>d(xk,Mn), then xk replaces Mn. If minid(xk,Mi)>dmn and d(xk,Mm)<d(xk,Mn), then xk replaces Mm; that is, if the distance between xk and its closest cluster mean is greater than the distance between the two closest means (Mm and Mn), then xk replaces either Mm or Mn, whichever is closer to xk.
If xk does not replace a cluster mean in (a), a second test is made:
Let Mq be the closest cluster mean to xk.
Let Mp be the second closest cluster mean to xk.
If d(xk,Mp)>minid(Mq,Mi), then Mq=xk;
That is, if xk is further from the second closest cluster’s center than the closest cluster’s center is from any other cluster’s center, replace the closest cluster’s center with xk.
At the end of one pass through the data, the initial means of all NC clusters are set. Note that if NOINITIAL is specified, the first NC cases with no missing values are the initial cluster means.