Decision Trees: Equivalence and Propositional Operations

نویسنده

  • Hans Zantema
چکیده

For the well-known concept of decision trees as it is used for inductive inference we study the natural concept of equivalence: two decision trees are equivalent if and only if they represent the same hypothesis. We present a simple e cient algorithm to establish whether two decision trees are equivalent or not. The complexity of this algorithm is bounded by the product of the sizes of both decision trees. The hypothesis represented by a decision tree is essentially a boolean function, just like a proposition. Although every boolean function can be represented in this way, we show that disjunctions and conjunctions of decision trees can not e ciently be represented as decision trees, and simply shaped propositions may require exponential size for representation as decision trees.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Equality propositional logic and its extensions

We introduce a new formal logic, called equality propositional logic. It has two basic connectives, $boldsymbol{wedge}$ (conjunction) and $equiv$ (equivalence). Moreover, the $Rightarrow$ (implication) connective can be derived as $ARightarrow B:=(Aboldsymbol{wedge}B)equiv A$. We formulate the equality propositional logic and demonstrate that the resulting logic has reasonable properties such a...

متن کامل

Binary Decision Diagrams

A propositional formula is determined up to logical equivalence by its truth table. If the formula has n variables then its truth table requires space Ω(2n) to represent. In this lecture we introduce a data structure called a binary decision diagram which gives a representation that is potentially much more compact. We furthermore show how binary decision diagrams can be used to decide satisfia...

متن کامل

Probabilistic Equivalence Checking with Propositional DAGs

The canonical representation of Boolean functions offered by OBDDs (ordered binary decision diagrams) allows to decide the equivalence of two OBDDs in polynomial time with respect to their size. It is still unknown, if this holds for other more succinct supersets of OBDDs such as FBDDs (free binary decision diagrams) and d-DNNFs (deterministic, decomposable negation normal forms), but it is kno...

متن کامل

On the Connection of Partial Order Logics and PartialOrder Reduction

We examine the connection between \equivalence robust" subsets of propositional temporal logics (LTL and CTL*), for which partial order reduction methods can be applied in model checking, and partial order logics and equivalences. For the linear case we show how to naturally translate \equivalence robust" LTL properties into Thiagarajan's linear time temporal logic for traces (TrPTL), substanti...

متن کامل

Top-down induction of logical decision trees

Top-down induction of decison trees (TDIDT) is a very popular machine learning technique. Up till now, it has mainly used for propositional learning, but seldomly for relational learning or inductive logic programming. The main contribution of this paper is the introduction of logic decision trees, which make it possible to use TDIDT in inductive logic programming. An implementation of this top...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998