Induction of multivariate decision trees by using dipolar criteria

13Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

Abstract

A new approach to the induction of multivariate decision trees is proposed. A linear decision function (hyper-plane) is used at each non-terminal node of a binary tree for splitting the data. The search strategy is based on the dipolar criterion functions and exploits the basis exchange algorithm as an optimization procedure. The feature selection is used to eliminate redundant and noisy features at each node. To avoid the problem of over-fitting the tree is pruned back after the growing phase. The results of experiments on some real-life datasets are presented and compared with obtained by state-of-art decision trees.

Cite

CITATION STYLE

APA

Bobrowski, L., & Krȩtowski, M. (2000). Induction of multivariate decision trees by using dipolar criteria. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1910, pp. 331–336). Springer Verlag. https://doi.org/10.1007/3-540-45372-5_33

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free