A Decision Tree Model Based on Preference Cost Sensitive
Abstract
In view of the fact that the existing decision tree models have not considered the decision makers’ preference behaviors during the classification process, these models cannot predict the problems with obvious preference very well. Driven by demand, this paper puts forward a new decision tree algorithm—a preference cost sensitive decision tree (PCSDT). This algorithm introduces the preference degree and preference cost to decision tree. Then, we utilize the effective preference to construct a new attribute selection factor (ASF) and the class label distribution rule for a node. Finally, a preference sensitive decision tree with best preference degree is generated by adaptively adjusting the preference degree. Experiments have proved that the proposed method can guarantee better overall accuracy and performances than other traditional algorithms.
Keywords
Decision tree, Preference cost matrix, Classification
DOI
10.12783/dtcse/cst2017/12556
10.12783/dtcse/cst2017/12556
Refbacks
- There are currently no refbacks.