# Questions tagged [decision-tree]

The tag has no usage guidance.

30 questions
Filter by
Sorted by
Tagged with
21 views

Do any one give me some hints to solve this problem. Explain is steps by steps.Thanks
22 views

### Longest palindrome substring in logarithmic runtime complexity

In a palindrome of size N, the amount of candidates for the longest palindrome is N^2. Therefore, the information theoretic lower bound (IBT) should be lg(N^2), which is equivalent to a runtime ...
12 views

### Create a decision tree from a decision table

Create the optimal decision tree that is consistent with the table. Calculate the tree's medium length and its entropy.  \begin{array}{|c|c|c|c|c|} \hline \text{Question} & 0.2 & 0.4 &...
22 views

### Decision tree and information-theoretic lower bound

Consider the following problem : ...
16 views

### Finding the lower bound through decision trees

One way to find the lower bound of a comparison based algorithm is to use the decision tree. U have two questions regarding this method : 1) We know that the height of the tree is path that connects ...
32 views

### Lower bound and worst case scenario

We know that the lower bound is the minimum amount of work needed to solve a problem. So for a given problem say x it has the best algorithm ( the most efficient algorithm to solve this problem ) say ...
56 views

### How to convert a decision table to a consistent decision tree?

I am working from presentation from school, but I am not able to understand how they go from one step to the other. This is the decision table that I have. From it, the first thing we have to do is ...
16 views

### Decision tree selection by error rate (What does this mean?)

I am asked to select a attribute based on it's error rate Could someone please explain me this? Let's say I have this data for example reasons For a attribut 3 Yes that classifies as + 1 Yes ...
22 views

### Decision tree: how to decide the next node?

I have to decide for which value of "Klasse" How do i do it? I know that I have to decide on maximum information gain So first off I've calculated the entropy of "Klasse" That is E(Klasse)= -(3/11*...