Error Error Δ = 0.44 (4/9)(0.25) (5/9)(0.2)
|
|
- Grant Day
- 6 years ago
- Views:
Transcription
1 Chapter 4, Problem 3: For the classification function, the number of + classifications are 4 and the number of classifications are 5. Hence, the entropy of this collection with respect to the + class: Entropy = (4/9) log2 (4/9) = 0.52 Now if we split on a1 and a2 then, a1 N1 N2 a2 N1 N Entropy(N1) = 0.81 Entropy(N1) = 1.00 Entropy(N2) = 0.72 Entropy(N2) = 0.97 Δgain = 0.99 (4/9)(0.81) (5/9)(0.72) Δgain = 0.99 (4/9)(1.00) (5/9)(0.97) = 0.23 = 0.01 Hence, the best split for a3 is 2.0. Based on the calculations we made in part ( and (, the best split is a1. Classification error rate for the classification function = 1 max[4/9, 5/9] = 1 5/9 = 0.44 a1 N1 N2 a2 N1 N Error Error Δ = 0.44 (4/9)(0.25) (5/9)(0.2) Δ = 0.44 (4/9)(0.50) (5/9)(0.40) = 0.22 = 0.00 So, based on classification error rate, a1 is the best split. f) For the classification function, GINI = 1 (4/9) 2 (5/9) 2 = 0.49
2 Now if we split on a1 and a2 then, Hence, a1 is the best split. a1 N1 N2 a2 N1 N GINI GINI Δ = 0.49 (4/9)(0.38) (5/9)(0.32) Δ = 0.49 (4/9)(0.5) (5/9)(0.48) = 0.14 = 0.00 Chapter 4, Problem 7: For the classification function, Error (without any split) = 1 max(50/100, 50/100) = 1 ½ = ½ Attribute A: Class Class 0 50 Error 1 max(25/25, 0/25) 1 max(25/75, 50/75) = 1 1 = 1 2/3 = 0 = 1/3 Δ = ½ [25/ /100 1/3] = ½ ¼ = 0.25 Attribute B: Class Class Error 1 max(30/50, 20/50) 1 max(20/50, 30/50) = 1 3/5 = 1 3/5 = 2/5 = 2/5 Δ = ½ [50/100 2/5 + 50/100 2/5] = ½ 2/5 = 1/10 = 0.1 Attribute C: Class Class Error 1 max(25/50, 25/50) 1 max(25/50, 25/50) = 1 ½ = 1 ½ = ½ = ½ Δ = ½ [50/100 ½ + 50/100 ½] = ½ ½ = 0 Clearly, attribute A is the best first split since it has the best gain. Hence, the tree would look like A ?
3 The left child of the root (A = tru can not be further split because it is a pure class. The right child of the root (A = fals can be further split possibly using attribute B or attribute C based on the best gain. Attribute B: Class Class Error 1 max(25/45, 20/45) 1 max(0/30, 30/30) = 1 5/9 = 1 1 = 4/9 = 0 Δ = 1/3 [45/75 4/9 + 30/75 0] = 1/3 4/15 = 1/15 = Attribute C: Class Class Error 1 max(0/25, 25/25) 1 max(25/50, 25/50) = 1 1 = 1 ½ = 0 = ½ Δ = 1/3 [25/ /75 ½] = 1/3 1/3 = 0 Clearly, attribute B is the better second split since it has larger gain. Hence, the tree would look like A B ? Based on the tree from part (, let us assign the majority class + to the left child of the second split. Clearly, we will misclassify 20 instances on this leaf node. Since, the remaining leaf nodes are pure classes, total 20 instances out of 100 will get misclassified by the tree from part (. C 25 +?? Using the results from part (, we can see that selecting attribute C as the first splitting attribute would
4 result in the this tree. Lets start with finding the second split for the left child (C = tru. Also note that the classification error for this node is ½ as computed in part (. Attribute A: Class Class 0 25 Error 1 max(25/25, 0/25) 1 max(0/25, 25/25) = 1 1 = 1 1 = 0 = 0 Δ = ½ [25/ /50 0] = ½ 0 = 0.5 Attribute B: Class Class 20 5 Error 1 max(5/25, 20/25) 1 max(20/25, 5/25) = 1 4/5 = 1 4/5 = 1/5 = 1/5 Δ = ½ [25/50 1/5 + 25/50 1/5] = ½ 1/5 = 3/10 = 0.3 Clearly, attribute A is better split for the left subtree. Now lets find the second splitting attribute for the right child of the root (C = fals. The classification error for this is ½ as computed in part (. Attribute A: Class Class 0 25 Error 1 max(25/50, 25/50) = 1 ½ = ½ Δ = ½ 50/50 ½ = ½ ½ = 0 Attribute B: Class Class 0 25 Error 1 max(25/25, 0/25) 1 max(0/25, 25/25) = 1 1 = 1 1 = 0 = 0 Δ = ½ [25/ /50 0] = ½ 0 = 0.5 C A B Hence, attribute B is a better split for the right subtree. Since all the leaf nodes are pure classes, 0 out of
5 the 100 instances will get misclassified. This tree will correctly classify all instances. It is clearly evident from the results of part ( and (, that the greedy approach does not always lead to a decision tree with lowest misclassification errors. Chapter 4, Problem 9: Tree ( Number of non leaf nodes = 2 Number of leaf nodes = 3 Number of errors = 7 Number of classes = 3 Number of attributes = 16 Number of records = n Hence, Cost(tre = 2 log log2 3 = 2*4 + 3*1.585 = = bits Cost(data tre = 7 log2 n = 7 log2 n bits Cost(tree, dat = log2 n bits Tree ( Number of non leaf nodes = 4 Number of leaf nodes = 5 Number of errors = 4 Number of classes = 3 Number of attributes = 16 Number of records = n Hence, Cost(tre = 4 log log2 3 = 4*4 + 5*1.585 = = bits Cost(data tre = 4 log2 n = 4 log2 n bits Cost(tree, dat = log2 n bits Solving for n in log2 n = log2 n, we get, n = Hence, according to MDL principle, decision tree ( is better if n 14 and tree ( is better otherwise. Chapter 5, Problem 4: Accuracy(R1) = 4 / (4 + 1) = 4/5 = 0.8 Accuracy(R2) = 30 / ( ) = ¾ = 0.75 Accuracy(R3) = 100 / ( ) = 10/19 = R1 best, R3 worst For FOIL's information gain, we will extend a rule with equal positive and negative coverage with the given rules, and then compare with the results i.e. p0 = n0 FOIL(R1) = 4 (log2(4/5) log2(1/2)) = 4 ( ) = FOIL(R2) = 30 (log2(30/40) log2(1/2)) = 30 ( ) = FOIL(R3) = 100 (log2(100/190) log2(1/2)) = 100 ( ) = R2 best, R1 worst For R1, k = 2, f+ = 4, e+ = 5 100/500 = 1, f = 1, e = 5 400/500 = 4 LSR(R1) = 2 (4 log2(4/1) + 1 log2(1/4)) = 2 ( ( 2)) = 2 6 = 12
6 For R2, k = 2, f+ = 30, e+ = /500 = 8, f = 10, e = /500 = 32 LSR(R2) = 2 (30 log2(30/8) + 10 log2(10/32)) = 2 ( ( )) = = For R3, k = 2, f+ = 100, e+ = /500 = 38, f = 90, e = /500 = 152 LSR(R3) = 2 (100 log2(100/38) + 90 log2(90/152)) = 2 ( ( )) = = R3 best, R1 worst For the Laplace measure, k = 2 Laplace(R1) = (4 + 1) / (5 + 2) = 5/7 = Laplace(R2) = (30 + 1) / (40 + 2) = 31/42 = Laplace(R3) = ( ) / ( ) = 101/192 = R2 best, R3 worst For the m estimate measure, k = 2 and p+ = 0.2. Therefore, k p+ = = 0.4 m estimate(r1) = ( ) / (5 + 2) = 4.4/7 = m estimate(r2) = ( ) / (40 + 2) = 30.4/42 = m estimate(r3) = ( ) / ( ) = 100.4/192 = R2 best, R3 worst Chapter 5, Problem 8: P(A=1 +) = P(A=1, class=+) / P(+) = (3/10) / (5/10) = 3/5 P(B=1 +) = P(B=1, class=+) / P(+) = (2/10) / (5/10) = 2/5 P(C=1 +) = P(C=1, class=+) / P(+) = (4/10) / (5/10) = 4/5 P(A=1 ) = P(A=1, class= ) / P( ) = (2/10) / (5/10) = 2/5 P(B=1 ) = P(B=1, class= ) / P( ) = (2/10) / (5/10) = 2/5 P(C=1 ) = P(C=1, class= ) / P( ) = (1/10) / (5/10) = 1/5 Assume that P(A=1, B=1, C=1) = x. Now, let us compute P(+ A=1, B=1, C=1) and P( A=1, B=1, C=1). Based on these values, we will assign a class label to our test sample. P(+ A=1, B=1, C=1) = P(+) P(A=1, B=1, C=1 +) / P(A=1, B=1, C=1) = P(+) P(A=1 +) P(B=1 +) P(C=1 +) / P(A=1, B=1, C=1) using naive Bayes rule = (5/10 3/5 2/5 4/5) / x = 12 / 125x P( A=1, B=1, C=1) = P( ) P(A=1, B=1, C=1 ) / P(A=1, B=1, C=1) = P( ) P(A=1 ) P(B=1 ) P(C=1 ) / P(A=1, B=1, C=1) using naive Bayes rule = (5/10 2/5 2/5 1/5) / x = 2 / 125x Clearly, x (0,1], P(+ A=1, B=1, C=1) > P( A=1, B=1, C=1). Hence, we will classify this test sample as belonging to class '+'.
7 P(A=1) = 5/10 = 0.5 P(B=1) = 4/10 = 0.4 P(A=1) P(B=1) = = 0.2 P(A=1, B=1) = P(B=1 A=1) P(A=1) = 2/5 5/10 = 2/10 = 0.2 Since P(A=1, B=1) = P(A=1) P(B=1), we can say that the random variables A and B are independent. P(A=1) = 5/10 = 0.5 P(B=0) = 6/10 = 0.6 P(A=1) P(B=0) = = 0.3 P(A=1, B=0) = P(B=0 A=1) P(A=1) = 3/5 5/10 = 3/10 = 0.3 Since P(A=1, B=0) = P(A=1) P(B=0), we can say that the random variables A and B are independent. P(A=1, B=1 +) = P(A=1, B=1, class=+) / P(+) = (1/10) / (5/10) = 1/5 = 0.2 Using values from part (, P(A=1 + ) P(B=1 +) = (3/5) (2/5) = 6/25 = 0.24 Since P(A=1, B=1 +) P(A=1 + ) P(B=1 +), we can say that the random variable A and B are not conditionally independent on the class '+'. Chapter 5, Problem 12: P(B=g, F=e, G=e, S=y) = P(S=y B=g, F=e, G= P(B=g, F=e, G= = P(S=y B=g, F= P(G=e B=g, F= P(B=g, F= S does not depend on G = (1 P(S=n B=g, F=) P(G=e B=g, F= P(B=g) P(F= B and F are independent = (1 P(S=n B=g, F=) P(G=e B=g, F= (1 P(B=) P(F= = (1 0.8) 0.8 (1 0.1) 0.2 = = P(B=b, F=e, G=ne, S=n) = P(S=n B=b, F=e, G=n P(B=b, F=e, G=n = P(S=n B=b, F= P(G=ne B=b, F= P(B=b, F= S does not depend on G = P(S=n B=b, F= (1 P(G=e B=b, F=) P(B= P(F= B and F are independent = 1 (1 0.9) = = P(S=y B= = 1 P(S=n B= = 1 P(S=n, B= / P(B= = = 0.08 P(S=n, B= / P(B= = (P(S=n,B=b,F= + P(S=n, B=b, F=n) / P(B= = (P(S=n B=b, F= P(B= P(F= + P(S=n B=b, F=n P(B= P(F=n) / P(B= = P(S=n B=b, F= P(F= + P(S=n B=b, F=n P(F=n = (1 0.8) = = 0.92
Q1 (12 points): Chap 4 Exercise 3 (a) to (f) (2 points each)
Q1 (1 points): Chap 4 Exercise 3 (a) to (f) ( points each) Given a table Table 1 Dataset for Exercise 3 Instance a 1 a a 3 Target Class 1 T T 1.0 + T T 6.0 + 3 T F 5.0-4 F F 4.0 + 5 F T 7.0-6 F T 3.0-7
More informationData Mining Classification: Basic Concepts and Techniques. Lecture Notes for Chapter 3. Introduction to Data Mining, 2nd Edition
Data Mining Classification: Basic Concepts and Techniques Lecture Notes for Chapter 3 by Tan, Steinbach, Karpatne, Kumar 1 Classification: Definition Given a collection of records (training set ) Each
More informationChapter ML:III. III. Decision Trees. Decision Trees Basics Impurity Functions Decision Tree Algorithms Decision Tree Pruning
Chapter ML:III III. Decision Trees Decision Trees Basics Impurity Functions Decision Tree Algorithms Decision Tree Pruning ML:III-34 Decision Trees STEIN/LETTMANN 2005-2017 Splitting Let t be a leaf node
More informationInformal Definition: Telling things apart
9. Decision Trees Informal Definition: Telling things apart 2 Nominal data No numeric feature vector Just a list or properties: Banana: longish, yellow Apple: round, medium sized, different colors like
More informationthe tree till a class assignment is reached
Decision Trees Decision Tree for Playing Tennis Prediction is done by sending the example down Prediction is done by sending the example down the tree till a class assignment is reached Definitions Internal
More informationCS6375: Machine Learning Gautam Kunapuli. Decision Trees
Gautam Kunapuli Example: Restaurant Recommendation Example: Develop a model to recommend restaurants to users depending on their past dining experiences. Here, the features are cost (x ) and the user s
More information26 Chapter 4 Classification
26 Chapter 4 Classification The preceding tree cannot be simplified. 2. Consider the training examples shown in Table 4.1 for a binary classification problem. Table 4.1. Data set for Exercise 2. Customer
More informationCHAPTER-17. Decision Tree Induction
CHAPTER-17 Decision Tree Induction 17.1 Introduction 17.2 Attribute selection measure 17.3 Tree Pruning 17.4 Extracting Classification Rules from Decision Trees 17.5 Bayesian Classification 17.6 Bayes
More informationStatistics 202: Data Mining. c Jonathan Taylor. Week 6 Based in part on slides from textbook, slides of Susan Holmes. October 29, / 1
Week 6 Based in part on slides from textbook, slides of Susan Holmes October 29, 2012 1 / 1 Part I Other classification techniques 2 / 1 Rule based classifiers Rule based classifiers Examples: if Refund==No
More informationLearning Decision Trees
Learning Decision Trees Machine Learning Spring 2018 1 This lecture: Learning Decision Trees 1. Representation: What are decision trees? 2. Algorithm: Learning decision trees The ID3 algorithm: A greedy
More informationData classification (II)
Lecture 4: Data classification (II) Data Mining - Lecture 4 (2016) 1 Outline Decision trees Choice of the splitting attribute ID3 C4.5 Classification rules Covering algorithms Naïve Bayes Classification
More informationDecision trees. Special Course in Computer and Information Science II. Adam Gyenge Helsinki University of Technology
Decision trees Special Course in Computer and Information Science II Adam Gyenge Helsinki University of Technology 6.2.2008 Introduction Outline: Definition of decision trees ID3 Pruning methods Bibliography:
More informationNotes on Machine Learning for and
Notes on Machine Learning for 16.410 and 16.413 (Notes adapted from Tom Mitchell and Andrew Moore.) Learning = improving with experience Improve over task T (e.g, Classification, control tasks) with respect
More informationMachine Learning and Data Mining. Decision Trees. Prof. Alexander Ihler
+ Machine Learning and Data Mining Decision Trees Prof. Alexander Ihler Decision trees Func-onal form f(x;µ): nested if-then-else statements Discrete features: fully expressive (any func-on) Structure:
More information.. Cal Poly CSC 466: Knowledge Discovery from Data Alexander Dekhtyar.. for each element of the dataset we are given its class label.
.. Cal Poly CSC 466: Knowledge Discovery from Data Alexander Dekhtyar.. Data Mining: Classification/Supervised Learning Definitions Data. Consider a set A = {A 1,...,A n } of attributes, and an additional
More informationMachine Learning & Data Mining
Group M L D Machine Learning M & Data Mining Chapter 7 Decision Trees Xin-Shun Xu @ SDU School of Computer Science and Technology, Shandong University Top 10 Algorithm in DM #1: C4.5 #2: K-Means #3: SVM
More informationDecision Trees. Lewis Fishgold. (Material in these slides adapted from Ray Mooney's slides on Decision Trees)
Decision Trees Lewis Fishgold (Material in these slides adapted from Ray Mooney's slides on Decision Trees) Classification using Decision Trees Nodes test features, there is one branch for each value of
More informationCS145: INTRODUCTION TO DATA MINING
CS145: INTRODUCTION TO DATA MINING 4: Vector Data: Decision Tree Instructor: Yizhou Sun yzsun@cs.ucla.edu October 10, 2017 Methods to Learn Vector Data Set Data Sequence Data Text Data Classification Clustering
More informationProblem. Problem Given a dictionary and a word. Which page (if any) contains the given word? 3 / 26
Binary Search Introduction Problem Problem Given a dictionary and a word. Which page (if any) contains the given word? 3 / 26 Strategy 1: Random Search Randomly select a page until the page containing
More informationDecision trees COMS 4771
Decision trees COMS 4771 1. Prediction functions (again) Learning prediction functions IID model for supervised learning: (X 1, Y 1),..., (X n, Y n), (X, Y ) are iid random pairs (i.e., labeled examples).
More informationSUPERVISED LEARNING: INTRODUCTION TO CLASSIFICATION
SUPERVISED LEARNING: INTRODUCTION TO CLASSIFICATION 1 Outline Basic terminology Features Training and validation Model selection Error and loss measures Statistical comparison Evaluation measures 2 Terminology
More informationFinal Examination CS 540-2: Introduction to Artificial Intelligence
Final Examination CS 540-2: Introduction to Artificial Intelligence May 7, 2017 LAST NAME: SOLUTIONS FIRST NAME: Problem Score Max Score 1 14 2 10 3 6 4 10 5 11 6 9 7 8 9 10 8 12 12 8 Total 100 1 of 11
More informationKernel Density Estimation
Kernel Density Estimation If Y {1,..., K} and g k denotes the density for the conditional distribution of X given Y = k the Bayes classifier is f (x) = argmax π k g k (x) k If ĝ k for k = 1,..., K are
More informationDECISION TREE LEARNING. [read Chapter 3] [recommended exercises 3.1, 3.4]
1 DECISION TREE LEARNING [read Chapter 3] [recommended exercises 3.1, 3.4] Decision tree representation ID3 learning algorithm Entropy, Information gain Overfitting Decision Tree 2 Representation: Tree-structured
More informationNaïve Bayes classification
Naïve Bayes classification 1 Probability theory Random variable: a variable whose possible values are numerical outcomes of a random phenomenon. Examples: A person s height, the outcome of a coin toss
More informationLearning Decision Trees
Learning Decision Trees Machine Learning Fall 2018 Some slides from Tom Mitchell, Dan Roth and others 1 Key issues in machine learning Modeling How to formulate your problem as a machine learning problem?
More information4.8 Huffman Codes. These lecture slides are supplied by Mathijs de Weerd
4.8 Huffman Codes These lecture slides are supplied by Mathijs de Weerd Data Compression Q. Given a text that uses 32 symbols (26 different letters, space, and some punctuation characters), how can we
More information5. Classification and Prediction. 5.1 Introduction
5. Classification and Prediction Contents of this Chapter 5.1 Introduction 5.2 Evaluation of Classifiers 5.3 Decision Trees 5.4 Bayesian Classification 5.5 Nearest-Neighbor Classification 5.6 Neural Networks
More informationInformation Gain, Decision Trees and Boosting ML recitation 9 Feb 2006 by Jure
Information Gain, Decision Trees and Boosting 10-701 ML recitation 9 Feb 2006 by Jure Entropy and Information Grain Entropy & Bits You are watching a set of independent random sample of X X has 4 possible
More informationData Mining and Analysis: Fundamental Concepts and Algorithms
Data Mining and Analysis: Fundamental Concepts and Algorithms dataminingbook.info Mohammed J. Zaki 1 Wagner Meira Jr. 2 1 Department of Computer Science Rensselaer Polytechnic Institute, Troy, NY, USA
More informationMachine Learning 2nd Edi7on
Lecture Slides for INTRODUCTION TO Machine Learning 2nd Edi7on CHAPTER 9: Decision Trees ETHEM ALPAYDIN The MIT Press, 2010 Edited and expanded for CS 4641 by Chris Simpkins alpaydin@boun.edu.tr h1p://www.cmpe.boun.edu.tr/~ethem/i2ml2e
More informationIntroduction to Data Science Data Mining for Business Analytics
Introduction to Data Science Data Mining for Business Analytics BRIAN D ALESSANDRO VP DATA SCIENCE, DSTILLERY ADJUNCT PROFESSOR, NYU FALL 2014 Fine Print: these slides are, and always will be a work in
More informationNaïve Bayes classification. p ij 11/15/16. Probability theory. Probability theory. Probability theory. X P (X = x i )=1 i. Marginal Probability
Probability theory Naïve Bayes classification Random variable: a variable whose possible values are numerical outcomes of a random phenomenon. s: A person s height, the outcome of a coin toss Distinguish
More informationAlgorithms for Classification: The Basic Methods
Algorithms for Classification: The Basic Methods Outline Simplicity first: 1R Naïve Bayes 2 Classification Task: Given a set of pre-classified examples, build a model or classifier to classify new cases.
More informationLecture VII: Classification I. Dr. Ouiem Bchir
Lecture VII: Classification I Dr. Ouiem Bchir 1 Classification: Definition Given a collection of records (training set ) Each record contains a set of attributes, one of the attributes is the class. Find
More informationReview of Lecture 1. Across records. Within records. Classification, Clustering, Outlier detection. Associations
Review of Lecture 1 This course is about finding novel actionable patterns in data. We can divide data mining algorithms (and the patterns they find) into five groups Across records Classification, Clustering,
More informationDecision Tree Learning and Inductive Inference
Decision Tree Learning and Inductive Inference 1 Widely used method for inductive inference Inductive Inference Hypothesis: Any hypothesis found to approximate the target function well over a sufficiently
More informationDecision Trees. Nicholas Ruozzi University of Texas at Dallas. Based on the slides of Vibhav Gogate and David Sontag
Decision Trees Nicholas Ruozzi University of Texas at Dallas Based on the slides of Vibhav Gogate and David Sontag Supervised Learning Input: labelled training data i.e., data plus desired output Assumption:
More informationDecision Trees. Introduction. Some facts about decision trees: They represent data-classification models.
Decision Trees Introduction Some facts about decision trees: They represent data-classification models. An internal node of the tree represents a question about feature-vector attribute, and whose answer
More informationJeffrey D. Ullman Stanford University
Jeffrey D. Ullman Stanford University 3 We are given a set of training examples, consisting of input-output pairs (x,y), where: 1. x is an item of the type we want to evaluate. 2. y is the value of some
More informationClassification: Decision Trees
Classification: Decision Trees Outline Top-Down Decision Tree Construction Choosing the Splitting Attribute Information Gain and Gain Ratio 2 DECISION TREE An internal node is a test on an attribute. A
More informationDecision Tree Learning Lecture 2
Machine Learning Coms-4771 Decision Tree Learning Lecture 2 January 28, 2008 Two Types of Supervised Learning Problems (recap) Feature (input) space X, label (output) space Y. Unknown distribution D over
More informationChapter 6: Classification
Chapter 6: Classification 1) Introduction Classification problem, evaluation of classifiers, prediction 2) Bayesian Classifiers Bayes classifier, naive Bayes classifier, applications 3) Linear discriminant
More informationData Mining. CS57300 Purdue University. Bruno Ribeiro. February 8, 2018
Data Mining CS57300 Purdue University Bruno Ribeiro February 8, 2018 Decision trees Why Trees? interpretable/intuitive, popular in medical applications because they mimic the way a doctor thinks model
More informationLearning Classification Trees. Sargur Srihari
Learning Classification Trees Sargur srihari@cedar.buffalo.edu 1 Topics in CART CART as an adaptive basis function model Classification and Regression Tree Basics Growing a Tree 2 A Classification Tree
More informationInformation Theory & Decision Trees
Information Theory & Decision Trees Jihoon ang Sogang University Email: yangjh@sogang.ac.kr Decision tree classifiers Decision tree representation for modeling dependencies among input variables using
More informationMidterm, Fall 2003
5-78 Midterm, Fall 2003 YOUR ANDREW USERID IN CAPITAL LETTERS: YOUR NAME: There are 9 questions. The ninth may be more time-consuming and is worth only three points, so do not attempt 9 unless you are
More informationDecision Tree Learning
Decision Tree Learning Berlin Chen Department of Computer Science & Information Engineering National Taiwan Normal University References: 1. Machine Learning, Chapter 3 2. Data Mining: Concepts, Models,
More informationRandomized Decision Trees
Randomized Decision Trees compiled by Alvin Wan from Professor Jitendra Malik s lecture Discrete Variables First, let us consider some terminology. We have primarily been dealing with real-valued data,
More informationData Mining Classification: Basic Concepts, Decision Trees, and Model Evaluation
Data Mining Classification: Basic Concepts, Decision Trees, and Model Evaluation Lecture Notes for Chapter 4 Part I Introduction to Data Mining by Tan, Steinbach, Kumar Adapted by Qiang Yang (2010) Tan,Steinbach,
More informationIntroduction to ML. Two examples of Learners: Naïve Bayesian Classifiers Decision Trees
Introduction to ML Two examples of Learners: Naïve Bayesian Classifiers Decision Trees Why Bayesian learning? Probabilistic learning: Calculate explicit probabilities for hypothesis, among the most practical
More informationDecision trees. Decision tree induction - Algorithm ID3
Decision trees A decision tree is a predictive model which maps observations about an item to conclusions about the item's target value. Another name for such tree models is classification trees. In these
More informationC4.5 - pruning decision trees
C4.5 - pruning decision trees Quiz 1 Quiz 1 Q: Is a tree with only pure leafs always the best classifier you can have? A: No. Quiz 1 Q: Is a tree with only pure leafs always the best classifier you can
More informationDecision-Tree Learning. Chapter 3: Decision Tree Learning. Classification Learning. Decision Tree for PlayTennis
Decision-Tree Learning Chapter 3: Decision Tree Learning CS 536: Machine Learning Littman (Wu, TA) [read Chapter 3] [some of Chapter 2 might help ] [recommended exercises 3.1, 3.2] Decision tree representation
More informationClassification and Prediction
Classification and Prediction Introduction Evaluation of Classifiers Decision Trees Bayesian Classification Nearest-Neighbor Classification Support Vector Machines Multi-relational Classification Regression
More informationUNIVERSITY of PENNSYLVANIA CIS 520: Machine Learning Final, Fall 2014
UNIVERSITY of PENNSYLVANIA CIS 520: Machine Learning Final, Fall 2014 Exam policy: This exam allows two one-page, two-sided cheat sheets (i.e. 4 sides); No other materials. Time: 2 hours. Be sure to write
More informationDecision Trees / NLP Introduction
Decision Trees / NLP Introduction Dr. Kevin Koidl School of Computer Science and Statistic Trinity College Dublin ADAPT Research Centre The ADAPT Centre is funded under the SFI Research Centres Programme
More informationMachine Learning for natural language processing
Machine Learning for natural language processing Classification: Naive Bayes Laura Kallmeyer Heinrich-Heine-Universität Düsseldorf Summer 2016 1 / 20 Introduction Classification = supervised method for
More informationClassification. Christian Braune, Pascal Held, Alexander Dockhorn Intelligent Data Analysis 1
Classification Christian Braune, Pascal Held, Alexander Dockhorn Intelligent Data Analysis 1 Bayes Classifiers Christian Braune, Pascal Held, Alexander Dockhorn Intelligent Data Analysis 2 Bayes Classifiers
More informationQuestion of the Day. Machine Learning 2D1431. Decision Tree for PlayTennis. Outline. Lecture 4: Decision Tree Learning
Question of the Day Machine Learning 2D1431 How can you make the following equation true by drawing only one straight line? 5 + 5 + 5 = 550 Lecture 4: Decision Tree Learning Outline Decision Tree for PlayTennis
More informationLearning Objectives. c D. Poole and A. Mackworth 2010 Artificial Intelligence, Lecture 7.2, Page 1
Learning Objectives At the end of the class you should be able to: identify a supervised learning problem characterize how the prediction is a function of the error measure avoid mixing the training and
More informationDecision Tree. Decision Tree Learning. c4.5. Example
Decision ree Decision ree Learning s of systems that learn decision trees: c4., CLS, IDR, ASSISA, ID, CAR, ID. Suitable problems: Instances are described by attribute-value couples he target function has
More informationday month year documentname/initials 1
ECE471-571 Pattern Recognition Lecture 13 Decision Tree Hairong Qi, Gonzalez Family Professor Electrical Engineering and Computer Science University of Tennessee, Knoxville http://www.eecs.utk.edu/faculty/qi
More informationTutorial 2. Fall /21. CPSC 340: Machine Learning and Data Mining
1/21 Tutorial 2 CPSC 340: Machine Learning and Data Mining Fall 2016 Overview 2/21 1 Decision Tree Decision Stump Decision Tree 2 Training, Testing, and Validation Set 3 Naive Bayes Classifier Decision
More informationGeneralization to Multi-Class and Continuous Responses. STA Data Mining I
Generalization to Multi-Class and Continuous Responses STA 5703 - Data Mining I 1. Categorical Responses (a) Splitting Criterion Outline Goodness-of-split Criterion Chi-square Tests and Twoing Rule (b)
More informationBayes Decision Theory
Bayes Decision Theory Seungjin Choi Department of Computer Science and Engineering Pohang University of Science and Technology 77 Cheongam-ro, Nam-gu, Pohang 37673, Korea seungjin@postech.ac.kr 1 / 16
More informationKnowledge Discovery and Data Mining
Knowledge Discovery and Data Mining Lecture 06 - Regression & Decision Trees Tom Kelsey School of Computer Science University of St Andrews http://tom.home.cs.st-andrews.ac.uk twk@st-andrews.ac.uk Tom
More informationDecision Trees. Tirgul 5
Decision Trees Tirgul 5 Using Decision Trees It could be difficult to decide which pet is right for you. We ll find a nice algorithm to help us decide what to choose without having to think about it. 2
More informationPredictive Modeling: Classification. KSE 521 Topic 6 Mun Yi
Predictive Modeling: Classification Topic 6 Mun Yi Agenda Models and Induction Entropy and Information Gain Tree-Based Classifier Probability Estimation 2 Introduction Key concept of BI: Predictive modeling
More informationClassification: Rule Induction Information Retrieval and Data Mining. Prof. Matteo Matteucci
Classification: Rule Induction Information Retrieval and Data Mining Prof. Matteo Matteucci What is Rule Induction? The Weather Dataset 3 Outlook Temp Humidity Windy Play Sunny Hot High False No Sunny
More informationCART Classification and Regression Trees Trees can be viewed as basis expansions of simple functions. f(x) = c m 1(x R m )
CART Classification and Regression Trees Trees can be viewed as basis expansions of simple functions with R 1,..., R m R p disjoint. f(x) = M c m 1(x R m ) m=1 The CART algorithm is a heuristic, adaptive
More informationDecision Tree Analysis for Classification Problems. Entscheidungsunterstützungssysteme SS 18
Decision Tree Analysis for Classification Problems Entscheidungsunterstützungssysteme SS 18 Supervised segmentation An intuitive way of thinking about extracting patterns from data in a supervised manner
More informationDecision Trees. Data Science: Jordan Boyd-Graber University of Maryland MARCH 11, Data Science: Jordan Boyd-Graber UMD Decision Trees 1 / 1
Decision Trees Data Science: Jordan Boyd-Graber University of Maryland MARCH 11, 2018 Data Science: Jordan Boyd-Graber UMD Decision Trees 1 / 1 Roadmap Classification: machines labeling data for us Last
More informationChapter 3: Decision Tree Learning
Chapter 3: Decision Tree Learning CS 536: Machine Learning Littman (Wu, TA) Administration Books? New web page: http://www.cs.rutgers.edu/~mlittman/courses/ml03/ schedule lecture notes assignment info.
More informationEinführung in Web- und Data-Science
Einführung in Web- und Data-Science Prof. Dr. Ralf Möller Universität zu Lübeck Institut für Informationssysteme Tanya Braun (Übungen) Inductive Learning Chapter 18/19 Chapters 3 and 4 Material adopted
More informationAlgorithm-Independent Learning Issues
Algorithm-Independent Learning Issues Selim Aksoy Department of Computer Engineering Bilkent University saksoy@cs.bilkent.edu.tr CS 551, Spring 2007 c 2007, Selim Aksoy Introduction We have seen many learning
More informationExamination Artificial Intelligence Module Intelligent Interaction Design December 2014
Examination Artificial Intelligence Module Intelligent Interaction Design December 2014 Introduction This exam is closed book, you may only use a simple calculator (addition, substraction, multiplication
More informationThe Solution to Assignment 6
The Solution to Assignment 6 Problem 1: Use the 2-fold cross-validation to evaluate the Decision Tree Model for trees up to 2 levels deep (that is, the maximum path length from the root to the leaves is
More informationDecision Tree Learning
Topics Decision Tree Learning Sattiraju Prabhakar CS898O: DTL Wichita State University What are decision trees? How do we use them? New Learning Task ID3 Algorithm Weka Demo C4.5 Algorithm Weka Demo Implementation
More information10-810: Advanced Algorithms and Models for Computational Biology. Optimal leaf ordering and classification
10-810: Advanced Algorithms and Models for Computational Biology Optimal leaf ordering and classification Hierarchical clustering As we mentioned, its one of the most popular methods for clustering gene
More informationCART Classification and Regression Trees Trees can be viewed as basis expansions of simple functions
CART Classification and Regression Trees Trees can be viewed as basis expansions of simple functions f (x) = M c m 1(x R m ) m=1 with R 1,..., R m R p disjoint. The CART algorithm is a heuristic, adaptive
More informationLecture 3: Decision Trees
Lecture 3: Decision Trees Cognitive Systems II - Machine Learning SS 2005 Part I: Basic Approaches of Concept Learning ID3, Information Gain, Overfitting, Pruning Lecture 3: Decision Trees p. Decision
More informationARTIFICIAL INTELLIGENCE. Supervised learning: classification
INFOB2KI 2017-2018 Utrecht University The Netherlands ARTIFICIAL INTELLIGENCE Supervised learning: classification Lecturer: Silja Renooij These slides are part of the INFOB2KI Course Notes available from
More information1. True/False (40 points) total
Name: 1 2 3 4 5 6 7 total 40 20 45 45 20 15 15 200 UMBC CMSC 671 Final Exam December 20, 2009 Please write all of your answers on this exam. The exam is closed book and has seven problems that add up to
More informationStatistics and learning: Big Data
Statistics and learning: Big Data Learning Decision Trees and an Introduction to Boosting Sébastien Gadat Toulouse School of Economics February 2017 S. Gadat (TSE) SAD 2013 1 / 30 Keywords Decision trees
More informationThe exam is closed book, closed notes except your one-page (two sides) or two-page (one side) crib sheet.
CS 189 Spring 013 Introduction to Machine Learning Final You have 3 hours for the exam. The exam is closed book, closed notes except your one-page (two sides) or two-page (one side) crib sheet. Please
More information4. Classification and Prediction
4. Classification and Prediction Contents of this Chapter 4.1 Introduction 4.2 Evaluation of Classifiers 4.3 Decision Trees 4.4 Bayesian Classification 4.5 Nearest-Neighbor Classification 4.6 Support Vector
More informationMachine Learning 3. week
Machine Learning 3. week Entropy Decision Trees ID3 C4.5 Classification and Regression Trees (CART) 1 What is Decision Tree As a short description, decision tree is a data classification procedure which
More informationInduction of Decision Trees
Induction of Decision Trees Peter Waiganjo Wagacha This notes are for ICS320 Foundations of Learning and Adaptive Systems Institute of Computer Science University of Nairobi PO Box 30197, 00200 Nairobi.
More informationGenerative v. Discriminative classifiers Intuition
Logistic Regression (Continued) Generative v. Discriminative Decision rees Machine Learning 10701/15781 Carlos Guestrin Carnegie Mellon University January 31 st, 2007 2005-2007 Carlos Guestrin 1 Generative
More informationCptS 570 Machine Learning School of EECS Washington State University. CptS Machine Learning 1
CptS 570 Machine Learning School of EECS Washington State University CptS 570 - Machine Learning 1 IEEE Expert, October 1996 CptS 570 - Machine Learning 2 Given sample S from all possible examples D Learner
More informationData Mining. Preamble: Control Application. Industrial Researcher s Approach. Practitioner s Approach. Example. Example. Goal: Maintain T ~Td
Data Mining Andrew Kusiak 2139 Seamans Center Iowa City, Iowa 52242-1527 Preamble: Control Application Goal: Maintain T ~Td Tel: 319-335 5934 Fax: 319-335 5669 andrew-kusiak@uiowa.edu http://www.icaen.uiowa.edu/~ankusiak
More informationImagine we ve got a set of data containing several types, or classes. E.g. information about customers, and class=whether or not they buy anything.
Decision Trees Defining the Task Imagine we ve got a set of data containing several types, or classes. E.g. information about customers, and class=whether or not they buy anything. Can we predict, i.e
More informationML techniques. symbolic techniques different types of representation value attribute representation representation of the first order
MACHINE LEARNING Definition 1: Learning is constructing or modifying representations of what is being experienced [Michalski 1986], p. 10 Definition 2: Learning denotes changes in the system That are adaptive
More informationLearning Decision Trees
Learning Decision Trees CS194-10 Fall 2011 Lecture 8 CS194-10 Fall 2011 Lecture 8 1 Outline Decision tree models Tree construction Tree pruning Continuous input features CS194-10 Fall 2011 Lecture 8 2
More informationAdministration. Chapter 3: Decision Tree Learning (part 2) Measuring Entropy. Entropy Function
Administration Chapter 3: Decision Tree Learning (part 2) Book on reserve in the math library. Questions? CS 536: Machine Learning Littman (Wu, TA) Measuring Entropy Entropy Function S is a sample of training
More informationMachine Learning. Yuh-Jye Lee. March 1, Lab of Data Science and Machine Intelligence Dept. of Applied Math. at NCTU
Machine Learning Yuh-Jye Lee Lab of Data Science and Machine Intelligence Dept. of Applied Math. at NCTU March 1, 2017 1 / 13 Bayes Rule Bayes Rule Assume that {B 1, B 2,..., B k } is a partition of S
More informationDecision Trees Part 1. Rao Vemuri University of California, Davis
Decision Trees Part 1 Rao Vemuri University of California, Davis Overview What is a Decision Tree Sample Decision Trees How to Construct a Decision Tree Problems with Decision Trees Classification Vs Regression
More informationLecture 24: Other (Non-linear) Classifiers: Decision Tree Learning, Boosting, and Support Vector Classification Instructor: Prof. Ganesh Ramakrishnan
Lecture 24: Other (Non-linear) Classifiers: Decision Tree Learning, Boosting, and Support Vector Classification Instructor: Prof Ganesh Ramakrishnan October 20, 2016 1 / 25 Decision Trees: Cascade of step
More informationData Mining and Knowledge Discovery: Practice Notes
Data Mining and Knowledge Discovery: Practice Notes dr. Petra Kralj Novak Petra.Kralj.Novak@ijs.si 7.11.2017 1 Course Prof. Bojan Cestnik Data preparation Prof. Nada Lavrač: Data mining overview Advanced
More information