Learning decision trees with taxonomy of propositionalized attributes
نویسندگان
چکیده
We introduce Propositionalized Attribute Taxonomy guided Decision Tree Learner (PAT-DTL), an inductive learning algorithm that exploits a taxonomy of propositionalized attributes as prior knowledge to generate compact decision trees. Since taxonomies are unavailable in most domains, we also introduce Propositionalized Attribute Taxonomy Learner (PAT-Learner) that automatically constructs taxonomy from data. Our experimental results on UCI repository data sets show that the proposed algorithms can generate a decision tree that is generally more compact than and is often comparably accurate to those produced by standard decision tree learners.
منابع مشابه
Inductive Classi cation Using Taxonomy
We discuss how to classify input inductively where we assume taxonomy on attributes. Although we learn classi cation rules inductively by means of decision tree generation, we can't utilize the generation and testing methodologies for this purpose since each input data carries multiple roles based on taxonomy. In this investigation we introduce Decision Tree with Hierarchy (DTH) to class and at...
متن کاملA New Algorithm for Optimization of Fuzzy Decision Tree in Data Mining
Decision-tree algorithms provide one of the most popular methodologies for symbolic knowledge acquisition. The resulting knowledge, a symbolic decision tree along with a simple inference mechanism, has been praised for comprehensibility. The most comprehensible decision trees have been designed for perfect symbolic data. Classical crisp decision trees (DT) are widely applied to classification t...
متن کاملA Combination of Decision Trees and Instance-Based Learning Master’s Scholarly Paper
People are interested in developing a machine learning algorithm that works well in all situations. I proposed and studied a machine learning algorithm that combines two widely used algorithms: decision trees and instance-based learning. I combine these algorithms by using the decision trees to determine the relevant attributes and then running the noise-resistant instancebased learning algorit...
متن کاملConstructive Induction of Cartesian Product Attributes
Constructive induction is the process of changing the representation of examples by creating new attributes from existing attributes. In classi cation, the goal of constructive induction is to nd a representation that facilitates learning a concept description by a particular learning system. Typically, the new attributes are Boolean or arithmetic combinations of existing attributes and the lea...
متن کاملThe LTU Tree Algorit
This paper investigates an algorithm for the construction of decisions trees comprised of linear threshold units and also presents a novel algorithm for the learning of nonlinearly separable boolean functions using Madalinestyle networks which are isomorphic to decision trees. The construction of such networks is discussed, and their performance in learning is compared with standard BackPropaga...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Pattern Recognition
دوره 42 شماره
صفحات -
تاریخ انتشار 2009