KMITL

Permanent URI for this communityhttps://dspace.kmitl.ac.th/handle/123456789/1

Browse

Settings

Author: search.filters.author.Kaewrod, NichaSubject: search.filters.subject.Decision tree

Search Results

Now showing 1 - 2 of 2
  • Loading...
    Thumbnail Image
    Some of the metrics are blocked by your 
    consent settings
    Item type:Item,
    Improving ID3 Algorithm by Using A∗ Search
    (2018-08-21)
    Kaewrod, Nicha
    ;
    Jearanaitanakij, Kietikul
    ID3 is one of the most widely used algorithms for creating a classification decision tree. However, the traditional ID3 algorithm has a difficulty when there are equally important attributes during the decision node construction. It randomly selects one of the most important attributes to serve as the current decision node. This behavior may lead to the resulting decision tree which contains unnecessary depths and suboptimal accuracy. The purpose of this paper is to find the near optimal depth decision tree of the dataset, which contains an equally important attributes problem, by using the A-Star (A∗) search. The experiment results on four standard datasets from UCI indicate that the proposed algorithm can significantly reduce the decision tree's depth and still maintain the classification accuracy.
  • Loading...
    Thumbnail Image
    Some of the metrics are blocked by your 
    consent settings
    Item type:Item,
    Improving ID3 algorithm by ignoring minor instances
    (2018-07-02)
    Kaewrod, Nicha
    ;
    Jearanaitanakij, Kietikul
    Among various classification algorithms, ID3 is one of the most widely used and well-known tools that generates an efficient decision tree. Nevertheless, ID3 is too rigorous in generating the decision rules. As a result, the final decision tree may carry too many decision rules. Some of these decision rules may have very low number of instances which do not make significant change to the classification accuracy. The aim of this paper is to propose an approach to relax the rigorousness of the conventional ID3 algorithm by ignoring minor instances so that the resulting decision tree will have the lower number of depths yet produce promising accuracy. The proposed algorithm is examined on six datasets from UCI repository and Weka. The experimental results indicate that the proposed algorithm not only significantly reduces the maximum number of depths of the decision tree, but also retains the classification accuracy in the satisfying level. Moreover, the training time, the classification time, and the number of decision rules of the proposed algorithm are lower than those of the conventional ID3.