Introduction to Machine Learning CMU-10701
|
|
- Pauline Sherman
- 5 years ago
- Views:
Transcription
1 Introduction to Machine Learning CMU Decision Trees Barnabás Póczos
2 Contents Decision Trees: Definition + Motivation Algorithm for Learning Decision Trees Entropy, Mutual Information, Information gain Generalizations Regression Trees Overfitting Pruning Regularization Many of these slides are taken from Aarti Singh, Eric Xing, Carlos Guestrin Russ Greiner Andrew Moore 2
3 Decision Trees 3
4 Decision Tree: Motivation Learn decision rules from a dataset: Do we want to play tennis? 4 discrete-valued attributes (Outlook, Temperature, Humidity, Wind) Play tennis?: Yes/No classification problem 4
5 Decision Tree: Motivation We want to learn a good decision tree from the data. For example, this tree: 5
6 Function Approximation Formal Problem Setting: Set of possible instances X (set of all possible feature vectors) Unknown target function f : X! Y Set of function hypotheses H={ h h : X! Y } (H= possible decision trees) Input: Training examples {<x (i), y (i) >} of unknown target function f Output: Hypothesis h H that best approximates target function f In decision tree learning, we are doing function approximation, where the set of hypotheses H = set of decision trees 6
7 Decision Tree: The Hypothesis Space Each internal node is labeled with some feature x j Arc (from x j ) labeled with results of test x j Leaf nodes specify class h(x) One Instance: Outlook = Sunny Temperature = Hot Humidity = High Wind = Strong classified as No (Temperature, Wind: irrelevant) Easy to use in Classification Interpretable rules 7
8 Generalizations Features can be continuous Output can be continuous too (regression trees) Instead of single features in the nodes, we can use set of features too in the nodes Later we will discuss them in more detail. 8
9 Continuous Features If a feature is continuous: internal nodes may test value against threshold 9
10 Example: Mixed Discrete and Continuous Features Tax Fraud Detection: Goal is to predict who is cheating on tax using the refund, marital status, and income features Refund Marital status Taxable income Cheat yes Married 50K no no Married 90K no no Single 60K no no Divorced 100K yes yes Married 110K no Build a tree that matches the data 10
11 Decision Tree for Tax Fraud Detection Data Refund Yes No NO MarSt Single, Divorced TaxInc < 80K > 80K NO YES Married NO Each internal node: test one feature X i Continuous features test value against threshold Each branch from a node: selects one value (or set of values) for X i. Each leaf node: predict Y 11
12 Given a decision tree, how do we assign label to a test point? 12
13 10 Decision Tree for Tax Fraud Detection Query Data Refund Marital Status Taxable Income Cheat Yes Refund No No Married 80K? NO MarSt Single, Divorced TaxInc < 80K > 80K Married NO NO YES 13
14 10 Decision Tree for Tax Fraud Detection Query Data Refund Marital Status Taxable Income Cheat Yes Refund No No Married 80K? NO MarSt Single, Divorced TaxInc < 80K > 80K Married NO NO YES 14
15 10 10 Decision Tree for Tax Fraud Detection Query Data Refund Marital Status Taxable Income Cheat Yes Refund No No Married 80K? NO MarSt Single, Divorced TaxInc < 80K > 80K Married NO NO YES 15
16 10 10 Decision Tree for Tax Fraud Detection Query Data Refund Marital Status Taxable Income Cheat Yes Refund No No Married 80K? NO MarSt Single, Divorced TaxInc < 80K > 80K Married NO NO YES 16
17 10 10 Decision Tree for Tax Fraud Detection Query Data Refund Marital Status Taxable Income Cheat Yes Refund No No Married 80K? NO MarSt Single, Divorced TaxInc < 80K > 80K Married NO NO YES 17
18 10 10 Decision Tree for Tax Fraud Detection Query Data Refund Marital Status Taxable Income Cheat Yes Refund No No Married 80K? NO MarSt Single, Divorced Married Assign Cheat to No TaxInc NO < 80K > 80K NO YES 18
19 What do decision trees do in the feature space? 19
20 Decision Tree Decision Boundaries Decision trees divide feature space into axis-parallel rectangles, labeling each rectangle with one class Two features only: x 1 and x 2 20
21 Some functions cannot be represented with binary splits Some functions cannot be represented with binary splits: If we want to learn this function too, we need more complex functions in the nodes than binary splits We need to break this function to smaller parts that can be represented with binary splits
22 How do we learn a decision tree from training data? 22
23 What Boolean functions can be represented with decision trees? How would you represent Y = X 2 and X 5? Y = X 2 or X 5? How would you represent X 2 X 5 X 3 X 4 ( X 1 )? 23
24 Decision trees can represent any boolean/discrete functions n boolean features (x 1,,x n ) ) 2 n possible different instances 2 n+1 possible different functions if class label Y is boolean too. X 1 X 2 X
25 Option 1: Just store training data Trees can represent any boolean (and discrete) functions, e.g. (A v B) & (C v not D v E) Just produce path for each example (store the training data)... may require exponentially many nodes... Any generalization capability? (Other instances that are not in the training data?) NP-hard to find smallest tree that fits data Intuition: Want SMALL trees... to capture regularities in data easier to understand, faster to execute 25
26 Expressiveness of General Decision Trees Example: Learn A xor B (Boolean features and labels) There is a decision tree which perfectly classifies a training set with one path to leaf for each example. 26
27 Example of Overfitting 1000 patients 25% have butterfly-itis (250) 75% are healthy (750) Use 10 silly features, not related to the class label ½ of patients have F1 = 1 ( odd birthday ) ½ of patients have F2 = 1 even SSN etc 27
28 Standard decision tree learner: Typical Results Error Rate: Train data: 0% New data: 37% Optimal decision tree: Error Rate: Train data: 25% New data: 25% Regularization is important 28
29 How to learn a decision tree Top-down induction [many algorithms ID3, C4.5, CART, ] (Grow the tree from the root to the leafs) We will focus on ID3 algorithm Repeat: 1. Select best feature (X 1, X 2 or X 3 ) to split 2. For each value that feature takes, sort training examples to leaf nodes 3. Stop if leaf contains all training examples with same label or if all features are used up 4. Assign leaf with majority vote of labels of training examples 29
30 First Split? 30
31 Which feature is best to split? Good split: we are less uncertain about classification after split 80 training people (50 Genuine, 30 Cheats) Refund Marital Status Yes Refund No Yes No Single, Divorced Married NO Single, Divorced MarSt Married TaxInc NO 40 Genuine 0 Cheats 10 Genuine 30 Cheats 30 Genuine 10 Cheats 20 Genuine 20 Cheats < 80K > 80K NO YES Absolutely sure Kind of sure Kind of sure Absolutely unsure Refund gives more information about the labels than Marital Status 31
32 Which feature is best to split? Pick the attribute/feature which yields maximum information gain: H(Y) entropy of Y H(Y X i ) conditional entropy of Y Feature which yields maximum reduction in entropy provides maximum information about Y 32
33 Entropy of a random variable Y Entropy Larger uncertainty, larger entropy! Y ~ Bernoulli(p) Entropy, H(Y) Uniform Max entropy Deterministic Zero entropy p Information Theory interpretation: H(Y) is the expected number of bits needed to encode a randomly drawn value of Y (under most efficient code) 33
34 Information Gain Advantage of attribute = decrease in uncertainty Entropy of Y before split Entropy of Y after splitting based on X i We want this to be small Weight by probability of following each branch Information gain is the difference: Max Information gain = min conditional entropy 34
35 First Split? Which feature splits the data the best to + and instances? 35
36 First Split? Outlook feature looks great, because the Overcast branch is perfectly separated. 36
37 Statistics If split on x i, produce 2 children: (1) #(x i = t) follow TRUE branch data: [ #(x i = t, Y = +),#(x i = t, Y= ) ] (2) #(x i = f) follow FALSE branch data: [ #(x i = f, Y = +),#(x i = f, Y= ) ] Calculate the mutual information between x i and Y! 37
38 Information gain of the Outlook feature H=-(9/14*log2(9/14)+5/14*log2(5/14))= Outlook 14: (9+,5-) Sunny Rain Overcast [2+,3-] [4+,0-] [3+,2-] H3=-(3/5*log2(3/5)+2/5*log2(2/5))= H1=-(2/5*log2(2/5)+3/5*log2(3/5)) = H2=-(4/4*log2(4/4)+0/4*log2(0/4))=0 I(Y,Outlook) = (5/14*H1+4/14*H2+5/14*H3)=
39 Information gain of the Humidity feature H=-(9/14*log2(9/14)+5/14*log2(5/14))= Humidity 14: (9+,5-) High Normal [3+,4-] [6+,1-] H=-(3/7*log2(3/7)+4/7*log2(4/7))= H=-(6/7*log2(6/7)+1/7*log2(1/7))= I(Y, Humidity) = /14* /14*0.591 =
40 Information gain of the Wind feature H=-(9/14*log2(9/14)+5/14*log2(5/14))= Wind 14: (9+,5-) Weak Strong [6+,2-] [3+,3-] H=-(6/8*log2(6/8)+2/8*log2(2/8))=0.811 H=-(3/6*log2(3/6)+3/6*log2(3/6))=1 I(Y,Wind) = /14* /14*1 =
41 Repeat and build the tree Similar calculations for the temperature feature. Outlook feature is the best root node among all features. Humidity is the best 41
42 Tree Learning App DecisionTrees/Applet/DecisionTreeApplet.html 42
43 More general trees 43
44 Decision/Classification Tree more generally Features can be discrete or continuous 1 1 Each internal node: test some set of features {X i } Each branch from a node: selects a set of value for the set {X i } Class labels Each leaf node: predict Y Majority vote (classification) Average or Polynomial fit (regression) 44
45 Regression trees X 1 X p Num Children? 2 < 2 Average (fit a constant ) using training data at the leaves 45
46 Regression (Constant) trees 46
47 Overfitting 47
48 When to Stop? Many strategies for picking simpler trees: Pre-pruning Fixed depth Fixed number of leaves Post-pruning Chi-square test Yes Refund No MarSt Single, Divorced Married NO Model Selection by complexity penalization 48
49 Model Selection Penalize complex models by introducing cost (j) (j) j log likelihood cost (j) (j) (j) (j) Regression (j) (j) Classification penalize trees with more leaves 49
50 Pre-Pruning 50
51 PAC bound and Bias-Variance tradeoff Equivalently, with probability Fixed m sample size H hypothesis space complex simple small large large small
52 What about the size of the Sample complexity hypothesis space? ) How large is the hypothesis space of decision trees?
53 Number of decision trees of depth k Recursive solution: Given n attributes H k = Number of decision trees of depth k H 0 =2 (Yes, and no tree) H k = (#choices of root attribute) *(# possible left subtrees) *(# possible right subtrees) = n * H k-1 * H k-1 Write L k = log 2 H k L 0 = 1 L k = log 2 n + 2L k-1 = log 2 n + 2(log 2 n + 2L k-2 ) = log 2 n + 2log 2 n log 2 n + +2 k-1 (log 2 n + 2L 0 ) So L k = (2 k -1)log 2 n+2 k (sum of the first k terms of a geometric series) 53
54 PAC bound for decision trees of depth k L k = (2 k -1)log 2 n+2 k ) Bad!!! Number of points is exponential in depth k! In contrary, the number of leaves is never more than the number of data points, so let us regularize with the number of leaves instead of depth! 54
55 Number of decision trees with k leaves H k = Number of decision trees with k leaves H 1 =2 (Yes graph or No graph) H k = (#choices of root attribute) * [(# left subtrees wth 1 leaf)*(# right subtrees wth k-1 leaves) + (# left subtrees wth 2 leaves)*(# right subtrees wth k-2 leaves) + + (# left subtrees wth k-1 leaves)*(# right subtrees wth 1 leaf)] = n k-1 C k-1 (C k-1 : Catalan Number) Loose bound (using Sterling s approximation): 55
56 Number of decision trees With k leaves number of points m is linear in #leaves k linear in k With depth k log 2 H k = (2 k -1)log 2 n) +2 k exponential in k number of points m is exponential in depth k (n is the number of features) 56
57 PAC bound for decision trees with k leaves Bias-Variance revisited With prob 1-δ With, we get: With prob 1-δ, m: number of training points k: number of leaves k = m 0 large (~ > ½) k < m >0 small (~ <½) 57
58 What did we learn from decision trees? Bias-Variance tradeoff formalized Complexity k» m no bias, lots of variance k <m some bias, less variance 58
59 Post-Pruning (Bottom-Up pruning) 59
60 OBSERVED DATA Chi-Squared independence test Voting Preferences Republican Democrat Independent Male Female Row total Column total H 0 : Gender and voting preferences are independent. H a : Gender and voting preferences are not independent. Expected numbers under H0 (independence:) E r,c = (n r * n c ) / n 60
61 OBSERVED DATA Chi-Squared independence test Voting Preferences Republican Democrat Independent Male Female Row total Column total Expected numbers under H0 (independence:) E r,c = (n r * n c ) / n E 1,1 = (400 * 450) / 1000 = /1000 = 180 E 1,2 = (400 * 450) / 1000 = /1000 = 180 E 1,3 = (400 * 100) / 1000 = 40000/1000 = 40 E 2,1 = (600 * 450) / 1000 = /1000 = 270 E 2,2 = (600 * 450) / 1000 = /1000 = 270 E 2,3 = (600 * 100) / 1000 = 60000/1000 = 60 Χ 2 = Σ [ (O r,c - E r,c ) 2 / E r,c ] Χ 2 = ( ) 2 /180 + ( ) 2 /180 + (50-40) 2 /40 + ( ) 2 /270 + ( ) 2 /270 + (50-60) 2 /40 =
62 Chi-Squared independence test Degrees of freedom DF = (r - 1) * (c - 1) = (2-1) * (3-1) = 2 where r=#rows, c=#columns P(Χ 2 > 16.2) = <0.05 (p value) ) we cannot accept the null hypothesis. Evidence shows that there is a relationship between gender and voting preference. 62
63 Chi-Square Pruning 1. Build a Complete Tree 2. Consider each leaf, and perform a chi-square independence test #of instances entering this node =s # of + instances entering this node = p # of - instances entering this node = n X: s=p+n, (p+,n-) false true #of instances here =s f =p f +n f # of + instances here = p f # of - instances here = n f Expected numbers s f *p/s s t *p/s s f *n/s s t *n/s #of instances here =s t= p t +n t # of + instances here = p t # of - instances here = n t If after splitting the expected numbers are the same as the measured ones, then there is no point of splitting the node! Delete the leafs! 63
64 X1 X2 Y Count T T T 2 F X1 T T F T 2 F T F 5 F F T 1 S=6, p=1,n=5 F X2 T Y=T S f =1, p f =1,n f =0 Y=T Y=F S t =5, p t =0,n t =5 Variable Assignment Real Counts of Y=T Expected Counts of Y=T X2=F 1 1/6 (s f *p/s) X2=T 0 5/6 (s t *p/s) Variable Assignment Real Counts of Y=F Expected Counts of Y=F X2=F 0 5/6 (s f *n/s) X2=T 5 25/6 (s t *n/s) 64
65 Variable Assignment Real Counts of Y=T Expected Counts of Y=T X2=F 1 1/6 (s f *p/s) X2=T 0 5/6 (s t *p/s) Variable Assignment Real Counts of Y=F Expected Counts of Y=F X2=F 0 5/6 (s f *n/s) X2=T 5 25/6 (s t *n/s) If label Y and feature X2 are independent, then the expected counts should be close to the real counts. Degrees of freedom DF = (# Y labels- 1) * (#X2 labels - 1) =(2-1) * (2-1) = 1 Z = Σ [ (O r,c - E r,c ) 2 / E r,c ] =(1-1/6)^2/(1/6)+(0-5/6)^2/(5/6)+ (0-5/6)^2/(5/6) 6+(5-25/6)^2/(25/6) =25/6+5/6+5/6+1/6 = 6 65
66 Chi-Squared independence test P(Z> c) is the probability that we see this large deviation by chance under the H0 independence assumption. P(Z> ) =0.05, P(Z ) =0.95 The smaller the Z is, the more likely that the feature is independent from the label. (There is no evidence showing their dependence) In our case Z = 6 ) we reject the independence hypothesis and keep the node X2. 66
67 What you should know Decision trees are one of the most popular data mining tools Simplicity of design Interpretability Ease of implementation Good performance in practice (for small dimensions) Information gain to select attributes (ID3, C4.5, ) Can be used for classification, regression, and density estimation too Decision trees will overfit!!! Must use tricks to find simple trees, e.g., o Pre-Pruning: Fixed depth/fixed number of leaves o Post-Pruning: Chi-square test of independence o Complexity Penalized model selection 67
68 Thanks for the Attention! 68
the 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 informationDecision Trees. Machine Learning 10701/15781 Carlos Guestrin Carnegie Mellon University. February 5 th, Carlos Guestrin 1
Decision Trees Machine Learning 10701/15781 Carlos Guestrin Carnegie Mellon University February 5 th, 2007 2005-2007 Carlos Guestrin 1 Linear separability A dataset is linearly separable iff 9 a separating
More informationMachine Learning Recitation 8 Oct 21, Oznur Tastan
Machine Learning 10601 Recitation 8 Oct 21, 2009 Oznur Tastan Outline Tree representation Brief information theory Learning decision trees Bagging Random forests Decision trees Non linear classifier Easy
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 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 informationDecision Trees. CS57300 Data Mining Fall Instructor: Bruno Ribeiro
Decision Trees CS57300 Data Mining Fall 2016 Instructor: Bruno Ribeiro Goal } Classification without Models Well, partially without a model } Today: Decision Trees 2015 Bruno Ribeiro 2 3 Why Trees? } interpretable/intuitive,
More informationDecision Trees. CSC411/2515: Machine Learning and Data Mining, Winter 2018 Luke Zettlemoyer, Carlos Guestrin, and Andrew Moore
Decision Trees Claude Monet, The Mulberry Tree Slides from Pedro Domingos, CSC411/2515: Machine Learning and Data Mining, Winter 2018 Luke Zettlemoyer, Carlos Guestrin, and Andrew Moore Michael Guerzhoy
More informationA Decision Stump. Decision Trees, cont. Boosting. Machine Learning 10701/15781 Carlos Guestrin Carnegie Mellon University. October 1 st, 2007
Decision Trees, cont. Boosting Machine Learning 10701/15781 Carlos Guestrin Carnegie Mellon University October 1 st, 2007 1 A Decision Stump 2 1 The final tree 3 Basic Decision Tree Building Summarized
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 informationLearning Theory. Machine Learning CSE546 Carlos Guestrin University of Washington. November 25, Carlos Guestrin
Learning Theory Machine Learning CSE546 Carlos Guestrin University of Washington November 25, 2013 Carlos Guestrin 2005-2013 1 What now n We have explored many ways of learning from data n But How good
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 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 informationDecision Trees Lecture 12
Decision Trees Lecture 12 David Sontag New York University Slides adapted from Luke Zettlemoyer, Carlos Guestrin, and Andrew Moore Machine Learning in the ER Physician documentation Triage Information
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 informationCS 6375 Machine Learning
CS 6375 Machine Learning Decision Trees Instructor: Yang Liu 1 Supervised Classifier X 1 X 2. X M Ref class label 2 1 Three variables: Attribute 1: Hair = {blond, dark} Attribute 2: Height = {tall, short}
More informationLearning Theory. Aar$ Singh and Barnabas Poczos. Machine Learning / Apr 17, Slides courtesy: Carlos Guestrin
Learning Theory Aar$ Singh and Barnabas Poczos Machine Learning 10-701/15-781 Apr 17, 2014 Slides courtesy: Carlos Guestrin Learning Theory We have explored many ways of learning from data But How good
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 informationDecision Tree Learning Mitchell, Chapter 3. CptS 570 Machine Learning School of EECS Washington State University
Decision Tree Learning Mitchell, Chapter 3 CptS 570 Machine Learning School of EECS Washington State University Outline Decision tree representation ID3 learning algorithm Entropy and information gain
More informationDan Roth 461C, 3401 Walnut
CIS 519/419 Applied Machine Learning www.seas.upenn.edu/~cis519 Dan Roth danroth@seas.upenn.edu http://www.cis.upenn.edu/~danroth/ 461C, 3401 Walnut Slides were created by Dan Roth (for CIS519/419 at Penn
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 informationDecision Trees. Machine Learning CSEP546 Carlos Guestrin University of Washington. February 3, 2014
Decision Trees Machine Learning CSEP546 Carlos Guestrin University of Washington February 3, 2014 17 Linear separability n A dataset is linearly separable iff there exists a separating hyperplane: Exists
More informationEECS 349:Machine Learning Bryan Pardo
EECS 349:Machine Learning Bryan Pardo Topic 2: Decision Trees (Includes content provided by: Russel & Norvig, D. Downie, P. Domingos) 1 General Learning Task There is a set of possible examples Each example
More informationUniversität Potsdam Institut für Informatik Lehrstuhl Maschinelles Lernen. Intelligent Data Analysis. Decision Trees
Universität Potsdam Institut für Informatik Lehrstuhl Maschinelles Lernen Intelligent Data Analysis Decision Trees Paul Prasse, Niels Landwehr, Tobias Scheffer Decision Trees One of many applications:
More informationIntroduction. Decision Tree Learning. Outline. Decision Tree 9/7/2017. Decision Tree Definition
Introduction Decision Tree Learning Practical methods for inductive inference Approximating discrete-valued functions Robust to noisy data and capable of learning disjunctive expression ID3 earch a completely
More informationPAC-learning, VC Dimension and Margin-based Bounds
More details: General: http://www.learning-with-kernels.org/ Example of more complex bounds: http://www.research.ibm.com/people/t/tzhang/papers/jmlr02_cover.ps.gz PAC-learning, VC Dimension and Margin-based
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 informationClassification and Regression Trees
Classification and Regression Trees Ryan P Adams So far, we have primarily examined linear classifiers and regressors, and considered several different ways to train them When we ve found the linearity
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 informationMachine Learning
Machine Learning 10-701 Tom M. Mitchell Machine Learning Department Carnegie Mellon University January 13, 2011 Today: The Big Picture Overfitting Review: probability Readings: Decision trees, overfiting
More informationDecision Trees. Gavin Brown
Decision Trees Gavin Brown Every Learning Method has Limitations Linear model? KNN? SVM? Explain your decisions Sometimes we need interpretable results from our techniques. How do you explain the above
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 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
Machine Learning 10-601 Tom M. Mitchell Machine Learning Department Carnegie Mellon University January 14, 2015 Today: The Big Picture Overfitting Review: probability Readings: Decision trees, overfiting
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 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 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 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 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 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 informationDecision Trees. CSC411/2515: Machine Learning and Data Mining, Winter 2018 Luke Zettlemoyer, Carlos Guestrin, and Andrew Moore
Decision Trees Claude Monet, The Mulberry Tree Slides from Pedro Domingos, CSC411/2515: Machine Learning and Data Mining, Winter 2018 Luke Zettlemoyer, Carlos Guestrin, and Andrew Moore Michael Guerzhoy
More informationDecision Trees.
. Machine Learning Decision Trees Prof. Dr. Martin Riedmiller AG Maschinelles Lernen und Natürlichsprachliche Systeme Institut für Informatik Technische Fakultät Albert-Ludwigs-Universität Freiburg riedmiller@informatik.uni-freiburg.de
More informationM chi h n i e n L e L arni n n i g Decision Trees Mac a h c i h n i e n e L e L a e r a ni n ng
1 Decision Trees 2 Instances Describable by Attribute-Value Pairs Target Function Is Discrete Valued Disjunctive Hypothesis May Be Required Possibly Noisy Training Data Examples Equipment or medical diagnosis
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 informationLecture 3: Decision Trees
Lecture 3: Decision Trees Cognitive Systems - Machine Learning Part I: Basic Approaches of Concept Learning ID3, Information Gain, Overfitting, Pruning last change November 26, 2014 Ute Schmid (CogSys,
More informationDecision Tree Learning
0. Decision Tree Learning Based on Machine Learning, T. Mitchell, McGRAW Hill, 1997, ch. 3 Acknowledgement: The present slides are an adaptation of slides drawn by T. Mitchell PLAN 1. Concept learning:
More informationUVA CS 4501: Machine Learning
UVA CS 4501: Machine Learning Lecture 21: Decision Tree / Random Forest / Ensemble Dr. Yanjun Qi University of Virginia Department of Computer Science Where are we? è Five major sections of this course
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 informationMachine Learning
Machine Learning 10-601 Tom M. Mitchell Machine Learning Department Carnegie Mellon University August 30, 2017 Today: Decision trees Overfitting The Big Picture Coming soon Probabilistic learning MLE,
More informationClassification: Decision Trees
Classification: Decision Trees These slides were assembled by Byron Boots, with grateful acknowledgement to Eric Eaton and the many others who made their course materials freely available online. Feel
More informationDecision Trees: Overfitting
Decision Trees: Overfitting Emily Fox University of Washington January 30, 2017 Decision tree recap Loan status: Root 22 18 poor 4 14 Credit? Income? excellent 9 0 3 years 0 4 Fair 9 4 Term? 5 years 9
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 informationOutline. Training Examples for EnjoySport. 2 lecture slides for textbook Machine Learning, c Tom M. Mitchell, McGraw Hill, 1997
Outline Training Examples for EnjoySport Learning from examples General-to-specific ordering over hypotheses [read Chapter 2] [suggested exercises 2.2, 2.3, 2.4, 2.6] Version spaces and candidate elimination
More informationDecision Trees.
. Machine Learning Decision Trees Prof. Dr. Martin Riedmiller AG Maschinelles Lernen und Natürlichsprachliche Systeme Institut für Informatik Technische Fakultät Albert-Ludwigs-Universität Freiburg riedmiller@informatik.uni-freiburg.de
More informationCS 380: ARTIFICIAL INTELLIGENCE MACHINE LEARNING. Santiago Ontañón
CS 380: ARTIFICIAL INTELLIGENCE MACHINE LEARNING Santiago Ontañón so367@drexel.edu Summary so far: Rational Agents Problem Solving Systematic Search: Uninformed Informed Local Search Adversarial Search
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 informationOliver Dürr. Statistisches Data Mining (StDM) Woche 11. Institut für Datenanalyse und Prozessdesign Zürcher Hochschule für Angewandte Wissenschaften
Statistisches Data Mining (StDM) Woche 11 Oliver Dürr Institut für Datenanalyse und Prozessdesign Zürcher Hochschule für Angewandte Wissenschaften oliver.duerr@zhaw.ch Winterthur, 29 November 2016 1 Multitasking
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 informationLearning Theory Continued
Learning Theory Continued Machine Learning CSE446 Carlos Guestrin University of Washington May 13, 2013 1 A simple setting n Classification N data points Finite number of possible hypothesis (e.g., dec.
More informationDecision Tree Learning - ID3
Decision Tree Learning - ID3 n Decision tree examples n ID3 algorithm n Occam Razor n Top-Down Induction in Decision Trees n Information Theory n gain from property 1 Training Examples Day Outlook Temp.
More informationInductive Learning. Chapter 18. Material adopted from Yun Peng, Chuck Dyer, Gregory Piatetsky-Shapiro & Gary Parker
Inductive Learning Chapter 18 Material adopted from Yun Peng, Chuck Dyer, Gregory Piatetsky-Shapiro & Gary Parker Chapters 3 and 4 Inductive Learning Framework Induce a conclusion from the examples Raw
More informationClassification and Prediction
Classification Classification and Prediction Classification: predict categorical class labels Build a model for a set of classes/concepts Classify loan applications (approve/decline) Prediction: model
More informationDecision Trees. Each internal node : an attribute Branch: Outcome of the test Leaf node or terminal node: class label.
Decision Trees Supervised approach Used for Classification (Categorical values) or regression (continuous values). The learning of decision trees is from class-labeled training tuples. Flowchart like structure.
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 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 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 informationSupervised Learning! Algorithm Implementations! Inferring Rudimentary Rules and Decision Trees!
Supervised Learning! Algorithm Implementations! Inferring Rudimentary Rules and Decision Trees! Summary! Input Knowledge representation! Preparing data for learning! Input: Concept, Instances, Attributes"
More informationLearning from Observations
RN, Chapter 18 18.3 Learning from Observations Learning Decision Trees Framework Classification Learning Bias Def'n: Decision Trees Algorithm for Learning Decision Trees Entropy, Inductive Bias (Occam's
More informationClassification II: Decision Trees and SVMs
Classification II: Decision Trees and SVMs Digging into Data: Jordan Boyd-Graber February 25, 2013 Slides adapted from Tom Mitchell, Eric Xing, and Lauren Hannah Digging into Data: Jordan Boyd-Graber ()
More informationPAC-learning, VC Dimension and Margin-based Bounds
More details: General: http://www.learning-with-kernels.org/ Example of more complex bounds: http://www.research.ibm.com/people/t/tzhang/papers/jmlr02_cover.ps.gz PAC-learning, VC Dimension and Margin-based
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. Danushka Bollegala
Decision Trees Danushka Bollegala Rule-based Classifiers In rule-based learning, the idea is to learn a rule from train data in the form IF X THEN Y (or a combination of nested conditions) that explains
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 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 informationLecture 7: DecisionTrees
Lecture 7: DecisionTrees What are decision trees? Brief interlude on information theory Decision tree construction Overfitting avoidance Regression trees COMP-652, Lecture 7 - September 28, 2009 1 Recall:
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 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 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 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 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 informationArtificial Intelligence Roman Barták
Artificial Intelligence Roman Barták Department of Theoretical Computer Science and Mathematical Logic Introduction We will describe agents that can improve their behavior through diligent study of their
More informationThe Naïve Bayes Classifier. Machine Learning Fall 2017
The Naïve Bayes Classifier Machine Learning Fall 2017 1 Today s lecture The naïve Bayes Classifier Learning the naïve Bayes Classifier Practical concerns 2 Today s lecture The naïve Bayes Classifier Learning
More informationCSC 411 Lecture 3: Decision Trees
CSC 411 Lecture 3: Decision Trees Roger Grosse, Amir-massoud Farahmand, and Juan Carrasquilla University of Toronto UofT CSC 411: 03-Decision Trees 1 / 33 Today Decision Trees Simple but powerful learning
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 28 Chi-Square Analysis
Lecture 28 STAT 225 Introduction to Probability Models April 23, 2014 Whitney Huang Purdue University 28.1 χ 2 test for For a given contingency table, we want to test if two have a relationship or not
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 informationChapter 14 Combining Models
Chapter 14 Combining Models T-61.62 Special Course II: Pattern Recognition and Machine Learning Spring 27 Laboratory of Computer and Information Science TKK April 3th 27 Outline Independent Mixing Coefficients
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 information2018 CS420, Machine Learning, Lecture 5. Tree Models. Weinan Zhang Shanghai Jiao Tong University
2018 CS420, Machine Learning, Lecture 5 Tree Models Weinan Zhang Shanghai Jiao Tong University http://wnzhang.net http://wnzhang.net/teaching/cs420/index.html ML Task: Function Approximation Problem setting
More informationDecision Trees (Cont.)
Decision Trees (Cont.) R&N Chapter 18.2,18.3 Side example with discrete (categorical) attributes: Predicting age (3 values: less than 30, 30-45, more than 45 yrs old) from census data. Attributes (split
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 informationSupervised Learning (contd) Decision Trees. Mausam (based on slides by UW-AI faculty)
Supervised Learning (contd) Decision Trees Mausam (based on slides by UW-AI faculty) Decision Trees To play or not to play? http://www.sfgate.com/blogs/images/sfgate/sgreen/2007/09/05/2240773250x321.jpg
More informationEmpirical Risk Minimization, Model Selection, and Model Assessment
Empirical Risk Minimization, Model Selection, and Model Assessment CS6780 Advanced Machine Learning Spring 2015 Thorsten Joachims Cornell University Reading: Murphy 5.7-5.7.2.4, 6.5-6.5.3.1 Dietterich,
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 informationCSCE 478/878 Lecture 6: Bayesian Learning
Bayesian Methods Not all hypotheses are created equal (even if they are all consistent with the training data) Outline CSCE 478/878 Lecture 6: Bayesian Learning Stephen D. Scott (Adapted from Tom Mitchell
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 information10-701/ Machine Learning: Assignment 1
10-701/15-781 Machine Learning: Assignment 1 The assignment is due September 27, 2005 at the beginning of class. Write your name in the top right-hand corner of each page submitted. No paperclips, folders,
More informationDecision Tree Learning
Decision Tree Learning Goals for the lecture you should understand the following concepts the decision tree representation the standard top-down approach to learning a tree Occam s razor entropy and information
More informationData Mining and Machine Learning (Machine Learning: Symbolische Ansätze)
Data Mining and Machine Learning (Machine Learning: Symbolische Ansätze) Learning Individual Rules and Subgroup Discovery Introduction Batch Learning Terminology Coverage Spaces Descriptive vs. Predictive
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 information