We describe a new oblique decision tree induction algorithm. The VQTree algorithm uses Learning Vector Quantization to form a nonparametric model of the training set, and from that obtains a set of hyperplanes which are used as oblique splits in the nodes of a decision tree. We use a set of public data sets to compare VQTree with two existing decision tree induction algorithms, 05.0 and OC1. Our experiments show that VQTree produces compact decision trees with higher accuracy than either C5.0 or OC1 on some datasets.
CITATION STYLE
Geva, S., & Buckingham, L. (2000). VQTree: Vector quantization for decision tree induction. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1805, pp. 349–359). Springer Verlag. https://doi.org/10.1007/3-540-45571-x_41
Mendeley helps you to discover research relevant for your work.