説明
<jats:p>This article describes a new system for induction ofoblique decision trees. This system, OC1, combines deterministic hill-climbing with two forms of randomization to find a goodoblique split (in the form of a hyperplane) at each node of a decisiontree. Oblique decision tree methods are tuned especially for domains in which the attributes are numeric, although they can be adapted to symbolic or mixed symbolic/numeric attributes. We presentextensive empirical studies, using both real and artificial data, thatanalyze OC1's ability to construct oblique trees that are smaller and more accurate than their axis-parallel counterparts. We also examinethe benefits of randomization for the construction of oblique decisiontrees.</jats:p>
収録刊行物
-
- Journal of Artificial Intelligence Research
-
Journal of Artificial Intelligence Research 2 1-32, 1994-08-01
AI Access Foundation
- Tweet
詳細情報 詳細情報について
-
- CRID
- 1361418520835651200
-
- DOI
- 10.1613/jair.63
-
- ISSN
- 10769757
-
- データソース種別
-
- Crossref