国际自动化与计算杂志（英文版）
國際自動化與計算雜誌（英文版）
국제자동화여계산잡지（영문판）
INTERNATIONAL JOURNAL OF AUTOMATION AND COMPUTING
2010年
3期
372-380
,共9页
Data mining%classification%decision tree%majority voting%naive Bayes(NB)%k-nearest-neighbour(k-NN)%association rule mining(ARM)
This paper focuses on improving decision tree induction algorithms when a kind of tie appears during the rule generation procedure for specific training datasets. The tie occurs when there are equal proportions of the target class outcome in the leaf node's records that leads to a situation where majority voting cannot be applied. To solve the above mentioned exception, we propose to base the prediction of the result on the naive Bayes(NB)estimate, k-nearest neighbour(k-NN)and association rule mining(ARM). The other features used for splitting the parent nodes are also taken into consideration.
