Questions tagged [decision-tree]

The tag has no usage guidance.

14 questions with no upvoted or accepted answers
Filter by
Sorted by
Tagged with
3
votes
0answers
30 views

Classify/Distinguish between 8008 binary grids, with 13 queries

I have $8008$ binary grids of size $6 \times 10$ (they are all grids with the property described below), which I want to distinguish between with at most $13$ queries. A query will determine if the ...
2
votes
0answers
88 views

Decision Tree for searching an element in an n*n matrix

I just learnt decision tree concept in class. I have a question for homework. It says to prove that for searching an element in n*n matrix the lower bound is logn and prove it using decision tree. My ...
2
votes
0answers
30 views

Avoiding collisions in space and time

Say I have an image, represented as a 2D array of pixel values. Also, say I have a set of points on that image where each has a current (x, y) position and a Destination (x, y) associated with it. I ...
1
vote
1answer
24 views

Intersection of Decision Tree Boundaries in Higher Dimensions

I have trained two binary decision tree classifiers with splits in $\mathbb{R}^4$. Same data, but from two different patches. Now, I want to find the exact intervals where the two trees disagree. The ...
1
vote
0answers
26 views

Rummy Card Game Bot

in my beginner’s computer science class, we are asked to create an bot for a variant of rummy. It has to make logical moves as it needs to beat other very simple bots. I wanted to know how you would ...
1
vote
0answers
295 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 ...
1
vote
0answers
44 views

Attribute Selection for minimum number of clusters

I have a table consisting of some headers $P, Q, R, S$ (shown in blue in Table 1). According to the headers, the column $T$ is populated using some predefined logic. Now, any of the headers $P,Q,R,S$ ...
0
votes
0answers
56 views

How to prove that the lower bound of the Huffman coding problem is $\Omega(n \log n)$?

how to prove that the lower bound of the Huffman coding problem is $\Omega(n \log n)$? Here Huffman coding problem is Huffman encoding. For example, ...
0
votes
1answer
15 views

What is beta and k parameter in Incremental Decision Tree

I have read this paper https://arxiv.org/pdf/1803.03674v1.pdf for outlier detection problem with real data (online training) In this paper, the authors used Incremental Decision Tree to build ...
0
votes
0answers
18 views

Communication complexity and query complexity model

I have some doubts for the relationship between communication complexity model and query complexity model. In my understanding, query complexity model are same as decision tree complexity model. Let $...
0
votes
1answer
31 views

SMO, Random forest and Bayes net algorithms: why does Random forest perform better?

I analyzed a dataset using those 3 different algorithms. As I can see, Random forest performs better in most cases. My dataset is composed of 4000 instances of two classes (class A 2000 elements, ...
0
votes
0answers
28 views

Problems about Decision Tree

Do any one give me some hints to solve this problem. Explain is steps by steps.Thanks
0
votes
0answers
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*...
0
votes
0answers
458 views

Random Forest - Conditional Permutation Importance

I've been looking for the most unbiased algorithm to find out the feature importances in random forests if there are correlations among the input features. Besides the most commonly preferred ...