The running time of K-means overly depends on the initial points but the right value of k is unknown and selecting the initial points effectively is also difficult.
均值聚类算法的执行时间过度依赖于初始点的选取，但是在实际问题中并不知道k的取值和怎样才能有效地选取初始点。
Corresponding schemes are given for different forms of information, and also several difficult points in concrete realization are discussed briefly in this thesis.
本文针对各种不同的信息形式提出了相应的实现方案，并对实际操作中的几个难点事项做了简要讨论。
This is also a reason, trying to understand each word is difficult, and it is not necessary at all. You should catch the most important points.
这也是一个原因，想要理解每个单词是很困难的，而且是根本不必要的，应该抓住要点。
应用推荐