title: Segment Based Decision Tree Induction With Continuous Valued Attributes.
abstract: A key issue in decision tree (DT) induction with continuous valued attributes is to design an effective strategy for splitting nodes. The traditional approach to solving this problem is adopting the candidate cut point (CCP) with the highest discriminative ability, which is evaluated by some frequency based heuristic measures. However, such methods ignore the class permutation of examples in the node, and they cannot distinguish the CCPs with the same or similar frequency information, thus may fail to induce a better and smaller tree. In this paper, a new concept, i.e., segment of examples, is proposed to differentiate the CCPs with same frequency information. Then, a new hybrid scheme that combines the two heuristic measures, i.e., frequency and segment, is developed for splitting DT nodes. The relationship between frequency and the expected number of segments, which is regarded as a random variable, is also given. Experimental comparisons demonstrate that the proposed scheme is not only effective to improve the generalization capability, but also valid to reduce the size of the tree.
authors.forename: Ran
authors.initials: R
authors.lastname: Wang
authors.forename: Sam
authors.initials: S
authors.lastname: Kwong
authors.forename: Xi-Zhao
authors.initials: XZ
authors.lastname: Wang
authors.forename: Qingshan
authors.initials: Q
authors.lastname: Jiang