Decision Tree Pruning Using Expert Knowledge
| Main Author: | |
|---|---|
| Language: | English |
| Published: |
University of Akron / OhioLINK
2006
|
| Subjects: | |
| Online Access: | http://rave.ohiolink.edu/etdc/view?acc_num=akron1158279616 |
| id |
ndltd-OhioLink-oai-etd.ohiolink.edu-akron1158279616 |
|---|---|
| record_format |
oai_dc |
| spelling |
ndltd-OhioLink-oai-etd.ohiolink.edu-akron11582796162021-08-03T05:24:58Z Decision Tree Pruning Using Expert Knowledge Cai, Jingfeng Computer Science Decision Tree Expert System Decision tree technology has proven to be a valuable way of capturing human decision making within a computer. It has long been a popular artificial intelligence(AI) technique. During the 1980s, it was one of the primary ways for creating an AI system. During the early part of the 1990s, it somewhat fell out of favor, as did the entire AI field in general. However, during the later 1990s, with the emergence of data mining technology, the technique has resurfaced as a powerful method for creating a decision-making program. How to prune the decision tree is one of the research directions of the decision tree technique, but the idea of cost-sensitive pruning has received much less investigation than other pruning techniques even though additional flexibility and increased performance can be obtained from this method. This dissertation reports on a study of cost-sensitive methods for decision tree pruning. A decision tree pruning algorithm called KBP1.0, which includes four cost-sensitive methods, is developed. The intelligent inexact classification is used for first time in KBP1.0 to prune the decision tree. Using expert knowledge in decision tree pruning is discussed for the first time. By comparing the cost-sensitive pruning methods in KBP1.0 with other traditional pruning methods, such as reduced error pruning, pessimistic error pruning, cost complexity pruning, and C4.5, on benchmark data sets, the advantage and disadvantage of cost-sensitive methods in KBP1.0 have been summarized. This research will enhance our understanding of the theory, design and implementation of decision tree pruning using expert knowledge. In the future, the cost-sensitive pruning methods can be integrated in other pruning methods, such as minimum error pruning and critical value pruning, and include new pruning methods in KBP. Using KBP to prune the decision tree and getting the rules from the pruned tree to help us build the expert system is another direction of our future work. 2006 English text University of Akron / OhioLINK http://rave.ohiolink.edu/etdc/view?acc_num=akron1158279616 http://rave.ohiolink.edu/etdc/view?acc_num=akron1158279616 unrestricted This thesis or dissertation is protected by copyright: all rights reserved. It may not be copied or redistributed beyond the terms of applicable copyright laws. |
| collection |
NDLTD |
| language |
English |
| sources |
NDLTD |
| topic |
Computer Science Decision Tree Expert System |
| spellingShingle |
Computer Science Decision Tree Expert System Cai, Jingfeng Decision Tree Pruning Using Expert Knowledge |
| author |
Cai, Jingfeng |
| author_facet |
Cai, Jingfeng |
| author_sort |
Cai, Jingfeng |
| title |
Decision Tree Pruning Using Expert Knowledge |
| title_short |
Decision Tree Pruning Using Expert Knowledge |
| title_full |
Decision Tree Pruning Using Expert Knowledge |
| title_fullStr |
Decision Tree Pruning Using Expert Knowledge |
| title_full_unstemmed |
Decision Tree Pruning Using Expert Knowledge |
| title_sort |
decision tree pruning using expert knowledge |
| publisher |
University of Akron / OhioLINK |
| publishDate |
2006 |
| url |
http://rave.ohiolink.edu/etdc/view?acc_num=akron1158279616 |
| work_keys_str_mv |
AT caijingfeng decisiontreepruningusingexpertknowledge |
| _version_ |
1719419566175551488 |