Consider the following 3×3 checkerboard pattern. Suppose our goal is to perfectly classify the range shown such that all black regions are labeled as +1 and all white regions are labeled as –1 3 2 1 2 3 Figure 1: Checkerboard Pattern What is the minimum depth of decision tree that perfectly classifies the 3×3 colored regions in Figure 1, using features that only inspect either x or y but not both x and y? (How you use each of X and y to construct a feature is up to you.) What is the minimum depth of decision trees to perfectly classify the colored regions in Figure 1, using ANY features of x and y?

Consider the following 3×3 checkerboard pattern. Suppose our goal is to perfectly classify the range shown such that all black regions are labeled as +1 and all white regions are labeled as –1 3 2 1 2 3 Figure 1: Checkerboard Pattern What is the minimum depth of decision tree that perfectly classifies the 3×3 colored regions in Figure 1, using features that only inspect either x or y but not both x and y? (How you use each of X and y to construct a feature is up to you.) What is the minimum depth of decision trees to perfectly classify the colored regions in Figure 1, using ANY features of x and y?

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Similar questions

Describe in as few as one or as many as a few words as possible the differences between a decision tree and a random forest. In utilising the random forest technique, what are some ways that we may ensure that randomization will occur twice?
Map coloring problem with {Red, Green, Blue). Assume that Arizona and Colorado do not share any border, and Utah and New Mexico do not share any border. Southwestern States Pacific Ocean ܞ W Key Oregon Sacramento ★ State Capital Carson State Boundary Water CEnchantedLearning.com City Névada California Idaho Salt Lake City Utah Arizona Phoenix MEXICO Wyoming Denver Colorado Santa Fe New Mexico Texas Kansas Nebraska Oklahoma Texas Please answer the following questions. 1. Which state should be selected to color first based on the heuristic of most constraining variable (degree heuristic)? 2. Assume our current assignment is {Nevada= Red, Arizona = Green}, which state(s) should be selected to color next based on the heuristic of minimum remaining value? 3. Assume our current assignment is {Arizona = Blue, Utah = Red} and we select California to color next, which color should we select based on the heuristic of least constraining value? 4. Assume our current assignment is {California =…
It was claimed that anyone involved in the Hollywood film industry can be linked through their film roles to Kevin Bacon within six steps. You are suspicious of such a claim and decide to verify it using the given dataset.1. Before you start to verify the claim, you first notice that it is not possible for this claim to be true if the actor graph is not even connected. Now that you know how to verify if the actor graph defined by the given dataset is connected (the actor graph is indeed connected), explain how can you further verify the claim of "Six Degrees of Kevin Bacon", that is: in the actor graph, each actor/actress is connected to Kevin Bacon with a path that contains no more than 6 edges. You should also include the runtime ofyour algorithm.
At each branch, the data is partitioned into two or more categories using a decision tree. If the decision tree is not pruned, using this strategy might end up being counterproductive. When should you prune, and why?
The following dataset is a historic record of 14 houses that were sold in a small town in BC. The dataset is used to predict whether a new house in the same town will be sold in 10 days if listed with a specific price based on certain attributes. We are considering only four attributes (price, number of bedrooms, size, and distance to bus stop) just to simplify the calculations in this assignment but more attributes should be considered in real applications. Build a decision tree to predict whether a new house listing in the same town will be sold in 10 days based on the given attributes. Use ID3 algorithm. To answer this question, you need to complete the following steps: Calculate the entropy of the whole dataset After identifying the first attribute, repeat the same steps to identify the next attribute to split on in every leaf of the tree based on information gain analysis. Repeat this step until you complete the tree. Draw the final tree