In another words, it considers the weighted average support of the rules for all decision classes.
也就是说,对所有的决策类,它考虑了规则的加权平均支持度。
At last, a binary decision tree could be built. Algorithm analysis and simulation results show that RMBRDM can support rules with ranges and the performance of RMBRDM is better than that of PTS.
最后建立一棵二叉决策树。理论分析和仿真实验均表明,RMBRDM算法不仅支持以范围形式表示的规则,且时空性能优于PTS算法。
This paper gives the rule-support degree a new definition, extends present models and brings forward an algorithm of mining weighted-decision-rules, the result of the experiment shows its effectivity.
通过对规则支持度提出新的定义,对现有的模型进行了扩展,并由此提出了一种新的决策规则挖掘算法,实验结果表明了其有效性。
应用推荐