71 research outputs found

    A Pruning Method for the Decision Tree Based on Run-Based Trie

    Get PDF
    Numerous methods for packet classification have been developed. We proposed a decision tree method based on Run-Based Trie. In this paper, we propose a pruning method for the decision tree. Space complexity of the pruning method is still O(l3l) where l is the length of a rule. Applying the proposed pruning method, we can construct a decision tree where l = 64, which can not be constructed with the conventional method. This result shows that, although our decision tree method based on Run-Based Trie is not feasible in theory, it can be used in a practical sense.原著2019年度神奈川大学総合理学研究所共同研究助成論
    corecore