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.
Indian Institute of Technology Indore(印度理工学院印多尔分校);Nanyang Technological University(南洋理工大学);Qatar University(卡塔尔大学);VŠB - Technical University of Ostrava(俄斯特拉发技术大学)
Enhance Learning Efficiency of Oblique Decision Tree via Feature Concatenation
College of Computer Science and Software Engineering, Hohai University(河海大学计算机与软件学院);State Key Laboratory for Novel Software Technology, Nanjing University(南京大学计算机软件新技术国家重点实验室);School of Artificial Intelligence and Information Technology, Nanjing University of Chinese Medicine(南京中医药大学人工智能与信息技术学院)
Induction of Decision Trees based on Generalized Graph Queries
通常,决策树归纳算法仅限于处理非关系数据。给定一个记录,它们不考虑其他对象属性,即使它们可以为学习任务提供有价值的信息。在本文中,我们提出了GGQ-ID 3,一个多关系决策树学习算法,使用广义图论(GGQ)作为谓词的决策节点。GGQ允许表达复杂的模式(包括循环),并且可以逐步细化。此外,它们还可以评估结构(不仅是单个记录)并执行常规模式匹配。GGQ在GGQ-ID 3树构建过程中动态构建(模式挖掘)。我们将展示如何使用GGQ-ID 3来执行多关系机器学习,从而控制复杂性。最后给出了一些自动获得分类树和语义模式的实例。- Normalmente,los algoritmos de inducción de árboles de decisionón trabajan con datos no relacionales.在登记册上,没有任何关于其他对象的资料,因为这些资料是为了使学生能够获得适当的信息。本文介绍了GGQ-ID 3算法,它是一种利用广义图论(GGQ)进行多关系决策的算法。GGQs允许快递提供完整的服务(包括包裹),并可以进行一次又一次的改进。另外,可以评估结构(没有单独的寄存器),然后进行常规模式匹配。在GGQ-ID 3中,GGQ在构建Arbol的过程中进行模式挖掘。此外,我们还可以自动获取多种关系分类和赞助人的实际数据。