更改

Except for the special case of single-linkage, none of the algorithms (except exhaustive search in <math>\mathcal{O}(2^n)</math>) can be guaranteed to find the optimum solution.

Except for the special case of single-linkage, none of the algorithms (except exhaustive search in <math>\mathcal{O}(2^n)</math>) can be guaranteed to find the optimum solution.

除了单链路的特殊情况外，所有算法(除了 < math > mathcal { o }(2 ^ n) </math > 中的穷举搜索)都不能保证找到最优解。

除了单链路的特殊情况外，所有算法(除了 < math > mathcal { o }(2 ^ n) </math > 数学中的穷举搜索)都不能保证找到最优解。

Divisive clustering with an exhaustive search is <math>\mathcal{O}(2^n)</math>, but it is common to use faster heuristics to choose splits, such as k-means.

Divisive clustering with an exhaustive search is <math>\mathcal{O}(2^n)</math>, but it is common to use faster heuristics to choose splits, such as k-means.

穷举搜索的分裂群集是 < math > mathcal { o }(2 ^ n) </math > ，但是通常使用更快的启发式来选择分裂，比如 k-means。

穷举搜索的分裂群集是 < math > mathcal { o }(2 ^ n) </math > ，但是通常使用运算速度更快的探索法来选择分裂，比如 k-means。

== Cluster dissimilarity 簇异性==

== Cluster dissimilarity 簇异性==