顺序聚类算法是一种非常直接和快速的算法，并且不需要提前确定聚类个数。
Sequential algorithm is a straightforward cluster algorithm, and people do not have to provide the number of clusters in advance.
均值算法的聚类个数k需指定，聚类结果与数据输入顺序相关，而且易受孤立点影响。
K-means algorithm has some deficiencies. The number K must be pointed and its effectiveness liable to be effected by isolated data and the input sequence of data.
先聚类后枚举所有划分的方法，聚类个数的确定会很大程度影响计算结果和运行效率。
The result and efficiency of method, in which first clustering and then enumerating all the possible cases, were greatly affected by the number of clusters.
应用推荐