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

什么是分类？ (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.

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

Consider a scenario of sorting on basis of the name of student and section also. Now the first sort according to the name of the student Table will be like:

考虑根据学生姓名和科目排序的情况。 现在，根据学生表的名称进行的第一个排序将是：

Now sort according to the section, there will be two output based on the algorithm is stable or not. Due to unstable algorithm now the name has become unsorted so either it will be sorted in name order or section order.

现在根据该部分进行排序，将基于该算法是否稳定输出两个输出。 由于算法不稳定，现在名称变得无法排序，因此将按照名称顺序或节顺序进行排序。

Unstable Algorithm

不稳定算法

Stable Algorithm

稳定算法

As observed with unstable sort task cannot be achieved because one sorting is disordering previous sorting that is why stable sort will be preferred in the database.

正如使用不稳定排序任务所观察到的那样，由于一种排序使以前的排序混乱，因此无法在数据库中优先选择稳定排序，因此无法实现任务。

翻译自: https://www.includehelp.com/algorithms/stability-in-sorting.aspx

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