Consider the dataset in terms of attribute-value pairs where F is the value, and A,B, C are attributes. What is the entropy of the dataset? Compute the information gain with respect to the attributes A, B and C. Which attribute would be used at the root of the decision tree constructed by the ID3 algorithm? A 0 0 0 0 1 1 1 1 B 0 0 1 1 0 0 1 1 C 0 1 0 1 0 1 0 1 F 1 0 0 1 이이이이.

Consider the dataset in terms of attribute-value pairs where F is the value, and A,B, C are attributes. What is the entropy of the dataset? Compute the information gain with respect to the attributes A, B and C. Which attribute would be used at the root of the decision tree constructed by the ID3 algorithm? A 0 0 0 0 1 1 1 1 B 0 0 1 1 0 0 1 1 C 0 1 0 1 0 1 0 1 F 1 0 0 1 이이이이.

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

The similarity of two documents (each with distinct words) is defined to be thesize of the intersection divided by the size of the union. For example, if the documents consist ofintegers, the similarity of {1, 5, 3} and { 1, 7, 2, 3} is 0. 4, because the intersection has size2 and the union has size 5.We have a long list of documents (with distinct values and each with an associated ID) where thesimilarity is believed to be "sparse:'That is, any two arbitrarily selected documents are very likely tohave similarity O. Design an algorithm that returns a list of pairs of document IDs and the associatedsimilarity.Print only the pairs with similarity greater than 0. Empty documents should not be printed at all. Forsimplicity, you may assume each document is represented as an array of distinct integers.EXAMPLEInput:13: {14, 15, 100, 9, 3}16: {32, 1, 9, 3, 5}19: {15, 29, 2, 6, 8, 7}24: {7, 10}Output:ID1, ID213, 1913, 1619, 240.10.250.14285714285714285
2 You are given the count matrix in the table 4 for the attribute "Previous GPA". The class label is whether a student will pass (C1) or fail (CO) a class. We want to use the attribute "Previous GPA" asour splitting attribute in an inner node of a decision tree with a binary test condition. Which is the best way to partition the attribute values into two groups? Form the count matrices for the different partitions and compute the classification error. Explain your reasoning while considering the metric of classification error to evaluate the different partitions. 0 3.1 + 0 3 Consider the decision trees shown in Figure 1. The decision tree in 1b is a pruned version of the original decision tree 1a. The training and test sets are shown in table 5. For every combination of values for attributes A and B, we have the number of instances in our dataset that have a positive or negative label. B 2 2 1 0 1 0 1 0 1 0 + 5 A 3 22 7 1 2 6 Bad 1 pass (C1) fail (CO) 4 B (a) Decision Tree 1 (DT1) 1 3…
I am completely lost for this practice for Machine Learning. There was no solution provided for this.Train a decision tree to predict whether a person makes over $50K a year based on the UCI Adult Census Income dataset. This database contains 48842 instances. Each instance is described in terms of 14 attributes. The last column attribute named “income” is the binary outcome to predict (i.e., ≤ 50K or otherwise). Note there are both numeric and discrete attributes.Cannot allowed to use libraries to such as SciKit to help. Code must be in Python. Tasks: The data set can be downloaded from the website https://www.kaggle.com/ uciml/adult-census-income. After downloading the data set, please split it into training set (70%), validation set (10%) and test set (20%). Implement the C4.5 decision tree algorithm. Your implementation should let user determine when to stop the recursive splitting. Run your algorithm on the training set to learn a decision tree using the following cut-off values,…
1 Decision Tree We will use the dataset below to learn a decision tree which predicts the class label which is binary {T,F}. ID A B C 1 1 1 0 0 1 0 F 1 1 1 F 1 1 0 T 2345 Class T 1 F 0 0 • What is the entropy of the root node? Show your working. • Draw the complete decision tree. • Are there feature(s) that are redundant?
What is the main preference (inductive bias) for all decision tree learning algorithms (ID3, CART, ...)? Select one: a. We prefer a smaller tree that can "unmix" the data points on the leaf nodes. b. We prefer a high entropy state of the data points on the leaf nodes. c. We prefer a larger tree that can "unmix" the data points on the leaf nodes. d. We prefer a low entropy state of the data points on the leaf nodes.
Inputs Processing Output The accuracy in the output depends on the correct inputs. The model designed is supposed to be evaluated to determine the accuracy and it is supposed to function in a supervised way. Hence the data sets can affect the model and vice versa. Given P(D|M), P(M),and P(D'|M), solve the following a. Draw the probability tree for the main situation. b. Draw the reverse tree for the main situation. C. Using the main tree, prove all probabilities on the opposite tree. d. If P(D|M) = 0.3, P(M) = 0.1,and P(D'\M) = 0.65 find P(D) %3D
Question 48. Let us return to the Titanic data set. We now have learned several models and want to choose the best one. We used three different methods to validate these models: The training error rate (apparent error rate), the error rate on an external test set and the error rate estimated by a 10-fold cross validation. Training Error | Error on the test set | Cross Validation Error 0.18 Learner Decision Tree 0.22 0.21 Random Forest 0.01 0.10 0.12 1-Nearest-Neighbour 0.18 0.19 Which of the following statements are correct? a) 1-Nearest-Neighbour has a perfect training error and hence it should be used here. b) Random Forests outperforms both 1-Nearest-Neighbour and the Decision Tree in terms of prediction error. c) Not just in this case, but in general, Cross Validation is the better validation strategy and should always be preferred over the error on a single test set. d) Not just in this case, but in general, Decision Trees always perform worse than Random Forests.
question b
Draw a decision tree (Full or simplified) to represent the Claremont School catalog. The Claremont School course catalog reads as follows: “A student must complete two prerequisites, CIS 110 and CIS 206, in order to enroll in CIS 288, which is an advanced course. A student who completes either one of these prerequisites and obtains the instructor’s permission, however, will be allowed to take CIS 288.”
Train an ID3 decision tree for a dataset shown in the following table. The table contains 2 categorical attributes (refund and marital status) and 1 continuous attribute (taxable income). Once you got the model then use it to classify the input X1 (No, Single, 95K) and X2 (Yes, Divorced, 120K)
You learn a decision tree (DT) and a naïve Bayes (NB) model for a data set and use 10-fold cross validation to evaluate them. Suppose that DT has higher accuracy than NB on 7 folds and NB has higher accuracy on 3 folds. a. Based on this result, is one model clearly better than the other? (Yes / No) b. How can you verify with confidence which is better?
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?