递增算法 meaning in Chinese

add algorithm

In decision tree algorithm , the famous one is id3 algorithm , which was presented by quinlan in 1986 . it is not a algorithm increasing by degrees , and it uses information entropy as a standard to select attribute , but the disadvantage of this algorithm is that it is easy to select those attributes whose values is more , while attributes whose values is more are not always the best
在决策树算法中属quinlan于1986年提出的id3算法最有名，它是非递增算法，并且采用信息熵作为属性选择的标准，可是这个标准易偏向于值数较多的属性，而属性值较多的属性却不总是最优的属性。
For above problems , i design boole process - based algorithm . for example , hazards finding theory work out a formal method of finding hazards by waveforms computing ; waveforms increasing algorithm settle the defect of boole process in feedback cycle treatment ; false paths discerning algorithm can delete useless nodes in netlist effectively ; inertia conflict eliminating method describes the state of nodes truelier and reduces computing
其中，冒险检测定理给出了通过波形运算检测电路中冒险现象的哈尔滨工程大学硕士学位论文形式化方法;波形递增算法解决了boole过程在处理电路中反馈环问题上的缺陷;伪路径识别算法能够有效地去除电路网表中的无用节点;而惯性冲突消除法能使对节点状态的描述更加真实，并减少了计算量。