Combining the orientation of searching the route and the decisive position of links and nodes , this paper proposes an orientated tree algorithm of efficient paths by simulating the tree ' s growing 文章将交通路网中节点位置的确定性与交通出行中路径选取的有向性相结合,模拟树的生长,提出了一种有效路径的定向树搜索算法。
At the same time , after successful absorbent of the factor of misclassification cost into splitting principle of decision tree algorithm , the classification model gets a high improvement in accuracy and adaptation 同时,在传统的决策树算法的分裂准则中成功引入了误分代价的因素,从而提高了分类模型的准确性和适用性。
In this dissertation , the decision tree algorithm is improved to adapt to the emergence of new classes . it can better make use of the old tree to build the new decision tree . therefore , 文章改进了决策树算法,提出了一种基于增类的决策树生成算法,它可以很好的利用原始的决策树模型生成新的决策树,大大地提高了系统在有新的攻击出现时的更新效率。
The reduction request knowledge of background and meet with standard of data mining . decisive tree algorithm of id3 is used to prove the validity of feature reduction and to generate intrusion detection rules 粗糙集约简具有扎实数学理论基础,不需要背景知识,符合数据挖掘的要求。用id3决策树算法去印证约简的有效性和检测的时间效率并生成检测规则。
You can use multiple algorithms within one solution to perform separate tasks , for example by using a regression tree algorithm to obtain financial forecasting information , and a rule - based algorithm to perform a market basket analysis 可以在一个解决方案中使用多个算法来执行不同的任务,例如,使用回归树算法来获取财务预测信息,使用基于规则的算法来执行市场篮分析。