3. In the basic decision tree algorithm (assuming we always create binary splits), we choose the fea-ture/value pair with the maximum information gain as the test to use at each internal node of thedecision tree. Suppose we modified the algorithm to choose at random from among those feature/valuecombinations that had non-zero mutual information, and we kept all other parts of the algorithmunchanged.(a) What is the maximum number of leaf nodes that such a decision tree could contain if it weretrained on m training examples?(b) What is the maximum number of leaf nodes that a decision tree could contain if it were trained onm training examples using the original maximum mutual information version of the algorithm?Is it bigger, smaller, or the same as your answer to (b)?(c) How do you think this change (using random splits vs. maximum information mutual informationsplits) would affect the accuracy of the decision trees produced on average? Why?

Decision Tree is a tree that uses a tree like model of decisions and it follows the structure in…

In the basic decision tree algorithm (assuming we always create binary splits), we choose the fea- ture/value pair with the maximum information gain as the test to use at each internal node of the decision tree. Suppose we modified the algorithm to choose at random from among those feature/value combinations that had non-zero mutual information, and we kept all other parts of the algorithm unchanged. (a) What is the maximum number of leaf nodes that such a decision tree could contain if it were

In the basic decision tree algorithm (assuming we always create binary splits), we choose the fea- ture/value pair with the maximum information gain as the test to use at each internal node of the decision tree. Suppose we modified the algorithm to choose at random from among those feature/value combinations that had non-zero mutual information, and we kept all other parts of the algorithm unchanged. (a) What is the maximum number of leaf nodes that such a decision tree could contain if it were

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Friendship relationship between a group of 6 kids M, N, O, P, Q, R is shown in the table. Construct an undirected graph from the given information and perform the Girwan Newman community detection algorithm for root nodes P, Q and R on the resultant graph. Source Destination N, Ο М, О, Р М, N, Q N, Q, R О.Р, R P, Q M P R
Mark Zuckerberg, the CEO of Facebook, has hired you to lead the Facebook Algorithms Group. He has asked you to use various graph algorithms to analyze the world's largest social network. The Facebook Graph has 2.8 billion vertices, with each vertex being a Facebook user. Two vertices are connected provided those two users are "friends". The first decision you need to make is how you want to model the Facebook graph. Determine whether you should use an adjacency-list representation or an adjacency-matrix representation.
Perform Dijkstra’s algorithm (while (Q is not empty){...}, where Q isa min priority queue) on the following graph for source node “s”, writing outevery execution of the RELAX function, the update to the priority queue and theupdates of distance from the source node and parent for the currently visited node.
What is the time complexity for these operation in average case (balanced tree), respectively? What is the time complexity for these operation in average case (balanced tree), respectively? In a BST with n nodes, what is the time complexity for searching, insertion, and deletion in worst case? What is the height of node 3, and node 9, respectively? What is the depth of node 3, and node 9, respectively? What is the level of node 17, and node 11, respectively? Insert integers 11, 22, 15, 44, 6, 9, 3, 33, 17, 5 into a BST in that order. Draw the final tree.
Build the d table for the following graph if you use the breadth first search and start from node s. Remember that we use the alphabetical order rule Assume the blanks/boxes are for the following nodes. Each blank/box is for one node. starting from node r followed by s, t, u, v, w, x, and y, respectively. S t и V W y
Apply the exhaustive parsing algorithm to determine whether or not bbaaaba ∈ L(G5), where G5 is this CFG: S ⟶ bSR | a (1) (2) R ⟶ aRb | a (3) (4) To illustrate the workings of the algorithm, show the breadth-first tree that it, in effect, traversed during its execution. (Each node of that tree is labeled by a sentential form.)
In general, in an avl tree, worst case for finding (and inserting and deleting) data takes: (a) O(1) (b) O(n) (c) O(n log n) (d) O(n2) (e) O(log n)
Explain the differences between a random forest and a decision tree in one or a few words at most. How can we make sure that we randomize twice while using the random forest algorithm??
Explain what a random forest is and how it is different from a decision tree in one or two sentences. How can we be sure to randomize twice when we use the random forest algorithm?|
Briefly explain the differences and similarities between random forest and decision trees. How do we randomize twice when implementing the random forest algorithm?
Here is a 2x2 go game tree (each circle shows a pass move). For each leaf (in left-to- right order, so H IDJK F G), give the Tromp-Taylor score (Black points+ territory minus White points+ territory) of that position. E.g. the first leaf has score 0. А D E F G H I J,
In one or at most a few sentences, describe the distinctions between a random forest and a decision tree. How can we use the random forest technique to ensure that we randomize twice?