arXivDaily arXiv每日学术速递 周一至周五更新
arXiv cs/9408103cs.AI
收藏

一个斜决策树的归纳系统

A System for Induction of Oblique Decision Trees

S. K. Murthy, S. Kasif, S. Salzberg

摘要:

本文介绍了一个新的系统,斜决策树的归纳。该系统OC 1将确定性爬山与两种形式的随机化相结合,以在决策树的每个节点处找到良好的斜分裂(以超平面的形式)。倾斜决策树方法特别针对属性为数值的域进行了调整,尽管它们可以适用于符号或混合符号/数值属性。我们提出了广泛的实证研究,使用真实的和人工的数据,分析OC 1的能力,构建斜树,更小,更准确的比他们的轴平行的同行。我们还研究了斜决策树的建设随机化的好处。

英文摘要:

This article describes a new system for induction of oblique decision trees. This system, OC1, combines deterministic hill-climbing with two forms of randomization to find a good oblique split (in the form of a hyperplane) at each node of a decision tree. 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 present extensive empirical studies, using both real and artificial data, that analyze OC1's ability to construct oblique trees that are smaller and more accurate than their axis-parallel counterparts. We also examine the benefits of randomization for the construction of oblique decision trees.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑