The result of experiment indicate that the new algorithm efficiently resolves the problems of KHM algorithm that the count of clusters need decide prior and it well reach local optimum result.
实验证明新算法有效解决了调和K均值算法中簇个数需事先给定及聚类算法容易陷入局部最优的问题。
The result of experiment indicate that the new algorithm efficiently resolves the problems of KHM algorithm that the count of clusters need decide prior and it well reach local optimum result.
实验证明新算法有效解决了调和K均值算法中簇个数需事先给定及聚类算法容易陷入局部最优的问题。
应用推荐