不稳定学习器适合做基分类器_分类稳定性

不稳定学习器适合做基分类器

什么是分类？ (What is sorting?)

It means to arrange data elements in increasing or decreasing order. There are many algorithms to do so like mergesort, quicksort, counting sort etc but there are pros and cons of each algorithm.

这意味着按升序或降序排列数据元素。 这样做有很多算法，例如mergesort，quicksort，counting sort等，但是每种算法各有利弊。

One way to judge the algorithm is the stability of sorting. Stability means that the relative position of elements remain same after sorting if an equal key element exists.

判断算法的一种方法是排序的稳定性 。 稳定性是指如果存在相等的键元素，则元素的相对位置在排序后保持不变。

To demonstrate it suppose a table having name column and section column.

为了演示它，假设一个表具有名称列和节列。