OC1: randomized induction of oblique decision trees

Sreerama Murthy, Simon Kasif, Steven Salzberg, Richard Beigel

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

This paper introduces OC1, a new algorithm for generating multivariate decision trees. Multivariate trees classify examples by testing linear combinations of the features at each non-leaf node of the tree. Each test is equivalent to a hyperplane at an oblique orientation to the axes. Because of the computational intractability of finding an optimal orientation for these hyperplanes, heuristic methods must be used to produce good trees. This paper explores a new method that combines deterministic and randomized procedures to search for a good tree. Experiments on several different real-world data sets demonstrate that the method consistently finds much smaller trees than comparable methods using univariate tests. In addition, the accuracy of the trees found with our method matches or exceeds the best results of other machine learning methods.

Original languageEnglish (US)
Title of host publicationProceedings of the National Conference on Artificial Intelligence
PublisherPubl by AAAI
Pages322-327
Number of pages6
ISBN (Print)0262510715
StatePublished - Dec 1 1993
EventProceedings of the 11th National Conference on Artificial Intelligence - Washington, DC, USA
Duration: Jul 11 1993Jul 15 1993

Publication series

NameProceedings of the National Conference on Artificial Intelligence

Other

OtherProceedings of the 11th National Conference on Artificial Intelligence
CityWashington, DC, USA
Period7/11/937/15/93

ASJC Scopus subject areas

  • Software
  • Artificial Intelligence

Fingerprint Dive into the research topics of 'OC1: randomized induction of oblique decision trees'. Together they form a unique fingerprint.

Cite this