A NEW PRUNING APPROACH FOR BETTER AND COMPACT DECISION TREES
Journal Title: International Journal on Computer Science and Engineering - Year 2010, Vol 2, Issue 8
Abstract
The development of computer technology has enhanced the people’s ability to produce and collect data. Data mining techniques can be effectively utilized for analyzing the data to discover hidden knowledge. One of the well known and efficient techniques is decision trees, due to easy understanding tructural output. But they may not always be easy to understand due to very big structural output. To overcome this short coming pruning can be used as a key procedure .It removes overusing noisy, conflicting data, so as to have better generalization. However, In pruning the problem of how to make a trade-off between classification accuracy and tree size has not been well solved. In this paper, firstly we propose a new pruning method aiming on both classification accuracy and tree size. Based upon the method, we introduce a simple decision tree pruning technique, and evaluated the hypothesis – Does our new runing method yields Better and Compact decision trees? The experimental results are verified by using benchmark datasets from UCI machine learning repository. The results indicate that our new tree pruning method is a feasible way of pruning decision trees.
Authors and Affiliations
Ali Mirza Mahmood , Pavani Gudapati , Venu Gopal Kavuluru , Mrithyumjaya Rao Kuppa
Keywords
Related Articles
- EP ID EP134536
- DOI -
- Views 113
- Downloads 0
Comparison of Pre-fetched Pages Before and After Path Completion
In this study we uses an approach for increasing web performance by analyzing and predicting the user behavior from user access log , identifying the missing paths in the logs and completing the same using a web structur...
A Comparative Study of Google and Bing Search Engines in Context of Precision and Relative Recall Parameter
This paper compared the retrieval effectiveness in context of precision and relative recall of Google and Bing search engine for evaluating the effectiveness of both search engine. The queries used are related to general...
Considerable Issues to detect Topical-Relevance Upon Free Texts
Topical Relevance has always been an equivocal concept in IR evaluations upon text documents. Text Miners have been well engaged in unfolding various strategies in finding, how well the core content is expressed in a doc...
Fault Detection of Reachability Testing with Game Theoretic Approach
This paper presents a game theoretic approach to fault detection of reachability testing. Physical systems are susceptible to fault at any time. Due to this reason the problem of determining and reacting to fault detecti...
AN EFFICIENT CLASSIFICATION OF GENOMES BASED ON CLASSES AND SUBCLASSES
The grass family has been the subject of intense research over the past. Reliable and fast classification / sub-classification of large sequences which are rapidly gaining importance due to genome sequencing projects all...