Share Email Print
cover

Proceedings Paper

Oblique decision tree induction using multimembered evolution strategies
Author(s): Kun Zhang; Zujia Xu; Bill P. Buckles
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

A new construction algorithm for binary oblique decision tree classifier, MESODT, is described. Multimembered evolution strategies (μ,λ) integrated with the perceptron algorithm is adopted as the optimization algorithm to find the appropriate split that minimizes the evaluation function at each node of a decision tree. To better explore the benefits of this optimization algorithm, two splitting rules, the criterion based on the concept of degree of linear separability, and one of the traditional impurity measures -- information gain, are each applied to MESODT. The experiments conducted on public and artificial domains demonstrate that the trees generated by MESODT have, in most cases, higher accuracy and smaller size than the classical oblique decision trees (OC1) and axis-parallel decision trees (See5.0). Comparison with (1+1) evolution strategies is also described.

Paper Details

Date Published: 28 March 2005
PDF: 8 pages
Proc. SPIE 5812, Data Mining, Intrusion Detection, Information Assurance, and Data Networks Security 2005, (28 March 2005); doi: 10.1117/12.596766
Show Author Affiliations
Kun Zhang, Tulane Univ. (United States)
Zujia Xu, Dillard Univ. (United States)
Bill P. Buckles, Tulane Univ. (United States)


Published in SPIE Proceedings Vol. 5812:
Data Mining, Intrusion Detection, Information Assurance, and Data Networks Security 2005
Belur V. Dasarathy, Editor(s)

© SPIE. Terms of Use
Back to Top