A Novel Definition of an Efficient Binary Decision Tree
2015-07-15 15:22:29 来源: 评论:0 点击:
Abstract—Decision trees have been well studied, widely used in knowledge discovery and decision support systems. They are simple and practical prediction models but often suffer from excessive complexity and can even be incomprehensible. In this study, a genetic algorithm is used to construct decision trees of increased accuracy and efficiency compared to those constructed by the conventional ID3 or C4.5 decision tree building algorithms. An improved definition of an efficient binary decision tree is proposed and evaluated – instead of simply using the number of nodes in a tree, the average number of questions asked in the tree for all the database entries is proposed.
Index Terms—binary decision trees, genetic algorithm and DVT
Cite: Christopher Nwosisi, "A Novel Definition of an Efficient Binary Decision Tree," Lecture Notes on Information Theory, Vol. 3, No. 1, pp. 35-41, June 2015. doi: 10.18178/lnit.3.1.35-41
Index Terms—binary decision trees, genetic algorithm and DVT
Cite: Christopher Nwosisi, "A Novel Definition of an Efficient Binary Decision Tree," Lecture Notes on Information Theory, Vol. 3, No. 1, pp. 35-41, June 2015. doi: 10.18178/lnit.3.1.35-41
Array
相关热词搜索:
上一篇:Location Based and Contextual Services Using Bluetooth Beacons: New Way to Enhance Customer Experience
下一篇:Utilization of Two Diacritics for Arabic Text Steganography to Enhance Performance
分享到:
收藏

评论排行
频道总排行
频道本月排行
- 6Utilization of Two Diacritics ...
- 5Community and Relation Discover...
- 5Extending Enterprise Architectur...
- 5Component-Based Model for Heter...
- 5A Novel Definition of an Efficient Binary Decision Tree
- 5Intrusion Detection Techniques ...
- 4A Novel Algorithm Based on 2D...
- 4Modeling Cloud Computing Integr...
- 1Effect of PAPR Reduction Techn...
- 1Performance Enhancement in 5G Mobile Network Processing