By uniting we stand;by dividing we fall.

In the learning algorithm based on the decision tree,the splitting rule of the decision tree is revised with a new definition of rank impurity.

在决策树学习算法中,采用新的等级不纯度定义,修改决策树的分裂规则,得到具有直观解释的排序算法,并给出了相关理论基础。

Adecision tree with a newsplitting rule,which has anintuitional explanation,is described.

基于一个修改了的决策树的分裂规则,得到了具有直观解释的排序算法,并给出了相关理论证明。

The Regular Splitting Iteration Matrices of a Groupe of M-Matrix;

一类M－矩阵正则分裂的迭代矩阵

In this paper, first we obtain a necessary and sufficient condition such that a graph compatiblesplitting is equivalent to regular splitting.

在这篇文章里，首先我们得到了一个使得图相容分裂与正则分裂等价的充要条件。

In this paper,we mainly consider the problem on the spectral radius and index assosiated eigenvalue I of iteration matrices of weak regular splittings for a Z-matrix and we also generalize the theorem obtained by Rose in 1984.

本文主要考虑一类Ｚ－矩阵弱正则分裂的迭代矩阵的谱半径和特征值１的指数问题，推广了Ｒｏｓｅ在１９８４年得到的一个定理。