ARTIFICIAL INTELLIGENCE. Supervised learning: classification
|
|
- Miles Gray
- 6 years ago
- Views:
Transcription
1 INFOB2KI Utrecht University The Netherlands ARTIFICIAL INTELLIGENCE Supervised learning: classification Lecturer: Silja Renooij These slides are part of the INFOB2KI Course Notes available from
2 2
3 Decision tree learning Supervised learning of decision tree classifier by means of `splitting on attributes 1. What is that? 2. How to split? (ID3) 3
4 When to play tennis? Example dataset D: N=14 cases, 4 attributes, 1 class variable 4
5 Decision Tree splits I Let s start building the tree from scratch. we first need to decide on which attribute to make a decision. Let s say 1 we selected Humidity ; split data according to the attribute s values: Humidity D1,D2,D3,D4 D8,D12,D14 high normal D5,D6,D7,D9 D10,D11,D13 1 NB using ID3, you won t have to make this choice yourself 5
6 Decision Tree splits - II Now let s split the first subset (H=high) D1,D2,D3,D4,D8,D12,D14 using attribute Wind : Humidity high normal strong Wind weak D5,D6,D7,D9 D10,D11,D13 D2,D12,D14 D1,D3,D4,D8 6
7 Decision Tree splits - III strong Outlook Wind high weak Humidity D1,D3,D4,D8 normal D5,D6,D7,D9 D10,D11,D13 Now let s split the subset H=high & W=strong (D2,D12,D14) using attribute Outlook Sunny No Rain No Overcast Yes entire subset classified 7
8 Decision Tree splits - IV Now let s split the subset H=high & W=weak (D1,D3,D4,D8) using attribute Outlook Humidity high normal strong Wind weak D5,D6,D7,D9 D10,D11,D13 Outlook Outlook Sunny No Rain No Overcast Sunny Rain Overcast Yes No Yes Yes 8
9 Decision Tree splits V Now let s split the subset H= normal (D5,D6,D7,D9,D10,D11,D13) using Outlook Humidity high normal wind outlook strong weak Sunny Rain Overcast outlook outlook Yes D5,D6,D10 Yes Sunny No Rain No Overcast Sunny Rain Yes No Yes Overcast Yes 9
10 Decision Tree splits VI Now let s split subset H=normal & O=rain (D5,D6,D10) using Wind Humidity high normal wind outlook strong weak Sunny Rain Overcast Sunny No outlook Rain No outlook Overcast Sunny Rain Yes No Yes Yes wind Yes Overcast strong Yes No weak Yes 10
11 Final Decision Tree Note: The decision tree can be expressed as an expression of if then else sentences, or in case of binary outcomes a logical formula: (humidity=high wind=strong outlook=overcast) (humidity=high wind=weak outlook=overcast) (humidity=high wind=weak outlook=rain) (humidity=normal outlook=sunny) (humidity=normal outlook=overcast) (humidity=normal outlook=rain wind=weak) Humidity high normal wind outlook strong weak Sunny Rain Overcast Sunny No outlook Rain No outlook Overcast Sunny Rain Yes No Yes Yes wind Yes Overcast strong Yes No weak Yes 11
12 Classifying with Decision Trees Now classify instance <O=sunny, T=hot, H=normal, W=weak> =??? Humidity high normal wind outlook strong weak Sunny Rain Overcast outlook outlook Yes wind Yes Sunny Rain Overcast Sunny Rain Overcast strong weak No No Yes No Yes Yes No Yes 12
13 Classifying with Decision Trees Now classify instance <O=sunny, T=hot, H=normal, W=weak> =??? Humidity high normal wind outlook strong weak Sunny Rain Overcast outlook outlook Yes wind Yes Sunny Rain Overcast Sunny Rain Overcast strong weak No No Yes No Yes Yes No Yes Note that this was an unseen instance (not in data). 13
14 Alternative Decision Trees Another tree from the same data, using different attributes: We can build quite a large number of (unique) decision trees So which attribute should we choose at branches? 14
15 ID3: an entropy-based decision tree learner 15
16 Entropy A measure of the disorder or randomness in a closed system with variable(s) of interest S: where n = S is the number of values of S Convention: 0 log 2 0 = 0 For a degenerate distribution, the entropy will be 0 (why?) For a uniform distribution, the entropy will be log 2 n (= 1 for binary valued variable) Recall: log 2 x = log b x / log b 2 for any base b logarithm 16
17 Entropy: example In our system we have 1 variable of interest (S=PlayTennis), with 2 possible values i (yes, no) n= S =2. Let p + = p(pt=yes) and p = p(pt=no) and use Frequency counting to establish these probabilities from the data: 9 out of N=14 examples are positive p + = 9/14 5 of these 14 are negative p = 5/14 Entropy(PlayTennis) = = p + log 2 p + p log 2 p = = (9/14)log 2 (9/14) (5/14)log 2 (5/14) =
18 Conditional Entropy Conditional entropy represents the entropy in a system given the values of another variable. The entropy Entropy(S X ) of S conditioned on X, is the expected value of the entropy given all possible values x of X: Entropy(S X ) = where Entropy(S X = x ) We will use the following short hand notations: Entropy(S X ) for Entropy(S X) Entropy(S x ) for Entropy(S X = x) 18
19 Conditional Entropy - example We can now evaluate each attribute by calculating how much change they will do in entropy. For example, we can evaluate the attribute Temperature, which has 3 values: hot, mild, cool. So we need to consider 3 subsystems: S hot, S mild, S cool. For each subsystem, probabilities are assessed from a subset of the data D: D hot = {D1,D2,D3,D13} p(hot) = 4/14 D mild = {D4,D8,D10,D11,D12,D14} p(mild) = 6/14 D cool = {D5,D6,D7,D9} p(cool) = 4/14 Now first compute entropy in the subsystems: Entropy(S hot ), Entropy(S mild ), Entropy(S cool ) 19
20 Conditional Entropy example II D hot ={D1( ),D2( ),D3(+),D13(+)} p + hot = 0.5 and p hot = 0.5 Entropy(S hot ) = 0.5 log log = 1 D mild ={D4 (+),D8( ),D10(+),D11(+),D12(+),D14( )} p + mild = and p mild = Entropy(S mild ) = log log = D cool ={D5(+),D6( ),D7(+),D9(+)} p + cool = 0.75 and p cool = 0.25 Entropy(S cool ) = 0.75 log log =
21 Conditional Entropy example III The conditional entropy after splitting on Temperature now is: Entropy(S Temperature ) = = p(hot) Entropy(S hot ) + p(mild) Entropy(S mild ) + p(cool) Entropy(S cool ) = (4/14)*1 + (6/14)* (4/14)*0.811 = Okay: but does this mean we should split on this attribute?? 21
22 Information Gain We now define the Gain (reduction in entropy) of splitting on attribute X as: Gain(S,X) = Entropy(S) Entropy(S X) Information gain is always a non negative value! (Why?) If Entropy(S X ) = 0, then all cases in S X are correctly classified split on attribute with smallest conditional entropy Equivalently: split on attribute with highest gain 22
23 Information Gain - example The gain of splitting on Temperature is: Gain(S, Temp) = = Compute the Gain of splitting for all other attributes: Gain(S, Outlook) = Gain(S, Humidity) = Gain(S, Wind) = We therefore split on Outlook and repeat the process for: S S sunny with D D sunny S S overcast with D D overcast S S rain with D D rain 23
24 ID3 (Decision Tree Algorithm) Building a decision tree with the ID3 algorithm 1. Start from an empty node 2. Select an attribute with the most information gain 3. Split: create the subsystems (children) for each value of the selected attribute 4. For each associated subset of the data: if not all elements belong to same class then repeat the steps 2 3 for the subset 24
25 Domain for ID3 example Obstacles Robot Robot can turn left & right, and move forward 25
26 Cases for ID3 example S: X1 X2 X3 X4 X5 X6 Left Right Forward Back Previous Action Sensor Sensor Sensor Sensor Action Obstacle Free Obstacle Free moveforward TurnRight Free Free Obstacle Free TurnLeft TurnLeft Free Obstacle Free Free MoveForward MoveForward Free Obstacle Free Obstacle TurnLeft MoveForward Obstacle Free Free Free TurnRight MoveForward Free Free Free Obstacle TurnRight MoveForward 26
27 ID3 Example Entropy(S) = 1/6*log 2 (1/6) 1/6*log 2 (1/6) 4/6*log 2 (4/6) = 1.25 Entropy(S LeftSensor ) = 2/6*Entropy(S LS=obstacle ) + 4/6*Entropy(S LS=free ) = 2/6*1 + 4/6*0.811 = Entropy(S RightSensor ) = 2/6*Entropy(S RS=obstacle ) + 4/6*Entropy(S RS=free ) = 2/6*0 + 4/6*1.5 = 1 Entropy(S ForwardSensor ) = 2/6*Entropy(S FS=obstacle ) + 4/6*Entropy(S FS=Free ) = 2/6*1 + 4/6*0 = Entropy(S BackSensor ) = 2/6*Entropy(S BS=obstacle ) + 4/6*Entropy(S BS=free ) = 2/6*0 + 4/6*1.5 = 1 Entropy(S PreviousAction ) = 2/6*Entropy(S PA=MoveForw ) + 2/6*Entropy(S PA=TurnL ) + 2/6*Entropy(S PA=TurnR ) = 2/6*1 + 2/6*1 + 2/6*0 = Gain(S,LeftSensor) = = Gain(S,RightSensor) = = 0.25 Gain(S,ForwardSensor) = = Gain(S,BackSensor) = = 0.25 Gain(S,PreviousAction) = = Select ForwardSensor 27
28 Decision Tree ID3 Example ForwardSensor free obstacle MoveForward {X1,X2} = S Entropy(S ) = 1/2*log 2 (1/2) 1/2*log 2 (1/2) = 1 (X1: Action = TR; X2: Action = TL) Entropy(S LeftSensor ) = 1/2*Entropy(S LS=obstacle ) + 1/2*Entropy(S LS=free ) = 1/2*0 + 1/2*0 = 0 Gain = 1 0 = 1 Entropy(S RightSensor ) = 1*Entropy(S RS=free ) = 1*1 = 1 Gain = 1 1 = 0 Entropy(S BackSensor ) = exact same Gain = 1 1 = 0 Entropy(S PreviousAction ) = 1/2*Entropy(S PA=MoveForw ) + 1/2*Entropy(S PA=TurnL ) = 1/2*0 +1/2*0 = 0 Gain = 1 0 = 1 Select either LeftSensor or PreviousAction, depending on the execution order 28
29 Decision Tree ID3 Example ForwardSensor ForwardSensor free obstacle free obstacle MoveForward LeftSensor MoveForward Previous action obstacle free Move forward TurnLeft TurnRight (X1) TurnLeft (X2) TurnRight (X1) TurnLeft (X2) 29
30 ID3 preference bias example I Babylon 5 universe S D1 D2 D3 D4 D5 Race Name BeenToB5 Good Person Minbari Delenn Yes Yes Minbari Draal Yes Yes Human Morden Yes No Narn G Kar Yes Yes Human Sheridan Yes Yes p yes =0.8 p no =0.2 Entropy(S) = 0.2*log *log = 0.72 Split on Race D minbari ={D1(+),D2(+)} Entropy(S minbari )=0 D human ={D3( ),D5(+)} Entropy(S human )=1 D narn ={D4(+)} Entropy(S narn )=0 Entropy(S Race )=2/5*0+2/5*1+1/5*0 = 2/5 Gain(S,Race)=0.72 2/5=
31 ID3 preference bias example II Babylon 5 universe Race Name BeenToB5 Good S Person D1 Minbari Delenn Yes Yes D2 Minbari Draal Yes Yes p yes =0.8 p no =0.2 Entropy(S) = 0.2*log *log = 0.72 D3 Human Morden Yes No D4 D5 Narn G Kar Yes Yes Human Sheridan Yes Yes Split on Name D Delenni ={D1(+)} Entropy(S Delenn ) = 0 The entropies of all D Draal ={D2(+)} Entropy(S Draal ) = 0 subsets are 0 D Morden ={D3( )}.. D G Kar ={D4(+)} D Sheridan ={D5(+)} Entropy(S Name ) = 0 Gain(S,Name)=0.72 0=
32 ID3: Preference Bias Name Delenn Draal Morden G kar Yes Yes No Yes Sheridan ID3 prefers some trees over others: It favors shorter trees over longer ones It selects trees that place the attributes with highest information gain closest to the root Its bias is solely a consequence of the ordering of hypotheses by its search strategy. Yes 32
33 ID3: Overfitting (illustrated) Suppose we receive an additional data point 33
34 Extra point: Effect on Our Tree NB in previous tree, instance <O=sunny,.,H= normal,. > was classified as PlayTennis =yes.. 34
35 Effects of ID3 Overfitting Trees may grow to include irrelevant attributes (e.g., Date, Color, etc.) Noisy examples may add spurious nodes to tree 35
36 ID3 Properties ID3 is complete for consistent(!) training data ID3 is not optimal (greedy Hill climbing approach no guarantees) ID3 can overfit on the training data (accuracy of learned model = prediction on test set) Use of information gain preference bias Continuous data: many more places to split an attribute time consuming search for best split. ID3 has been further optimized e.g. C4.5 and C5.0 ID3 for iterative online learning: ID4 36
37 More powerful: Naive Bayes 37
38 Naïve Bayes classifier updated given forecast. Supervised learning of naive Bayes classifier 38
39 Naive Bayes classifier: learning A naive Bayes classifier specifies a class variable C feature variables F 1,,F n aprior distribution p(c) conditional distributions p(f i C) Distributions p(c) and p(f i C) can be `learned from data. E.g. simple approach: frequency counting. More sophisticated approach also learns the structure of the model, i.e. determines which features to include requires performance measure (e.g. accuracy). 39
40 Naive Bayes classifier: use A naive Bayes classifier predicts a most likely value c for class C given observed features F i = f i from: where 1/Z = 1/p(F 1,,F n ) is a normalisation constant. This formula is based on Bayes rule: p(a B) = p(b A)p(A)/p(B) and the naive assumption that all n feature variables are independent given the class variable. 40
41 Example data set: when to play tennis, again 41
42 Learn NBC - example Model structure is fixed; just need probabilities from data. Feature variables: Outlook, Temp., Humidity, Wind Class Priors: p(playtennis=yes) = 9/14 p(pt=no) = 5/14 Probabilities based on frequency counting, just as in ID3 entropy computations. Class variable: PlayTennis Conditionals p(f i C) PT= yes PT= no O=sunny 2/9 3/5 O=overcast 4/9 0 O=rain 3/9 2/5 T=hot 2/9 2/5 T=mild 4/9 2/5 T=cool 3/9 1/5 H=high 3/9 4/5 H=normal 6/9 1/5 W=weak 6/9 2/5 W=strong 3/9 3/5 42
43 Classify with NBC - example Feature variables: O, T, H, W Class variable: PT Class Priors: p(pt=yes) = 9/14 p(pt=no) = 5/14 Classify instance e =<O=sunny, T=hot, H=normal, W=weak>: Conditionals p(f i C) PT= yes PT= no O=sunny 2/9 3/5 O=overcast 4/9 0 O=rain 3/9 2/5 T=hot 2/9 2/5 T=mild 4/9 2/5 T=cool 3/9 1/5 H=high 3/9 4/5 H=normal 6/9 1/5 W=weak 6/9 2/5 W=strong 3/9 3/5 p(pt=yes e) = 1/Z *9/14*2/9*2/9*6/9*6/9 = 1/Z * > p(pt=no e) = 1/Z *5/14*3/5*2/5*1/5*2/5 = 1/Z *
44 NBC Properties NBC learning is complete (Probabilistic: can handle inconsistencies in data) NBC learning is not optimal (Irrealistic independence assumptions class posterior often unreliable; yet accurate prediction of most likely value) Time and space complexity: independence assumptions strongly reduce dimensionality NBC can overfit on the training data (especially with large number of features) NBC has been further optimized TAN/FAN/KDB 44
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.
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 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 informationArtificial Intelligence. Topic
Artificial Intelligence Topic What is decision tree? A tree where each branching node represents a choice between two or more alternatives, with every branching node being part of a path to a leaf node
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 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 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 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 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 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 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 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 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 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 informationClassification and regression trees
Classification and regression trees Pierre Geurts p.geurts@ulg.ac.be Last update: 23/09/2015 1 Outline Supervised learning Decision tree representation Decision tree learning Extensions Regression trees
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 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 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 informationTypical Supervised Learning Problem Setting
Typical Supervised Learning Problem Setting Given a set (database) of observations Each observation (x1,, xn, y) Xi are input variables Y is a particular output Build a model to predict y = f(x1,, xn)
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
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 informationBayesian Learning. Artificial Intelligence Programming. 15-0: Learning vs. Deduction
15-0: Learning vs. Deduction Artificial Intelligence Programming Bayesian Learning Chris Brooks Department of Computer Science University of San Francisco So far, we ve seen two types of reasoning: Deductive
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 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 informationRule Generation using Decision Trees
Rule Generation using Decision Trees Dr. Rajni Jain 1. Introduction A DT is a classification scheme which generates a tree and a set of rules, representing the model of different classes, from a given
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 informationClassification Using Decision Trees
Classification Using Decision Trees 1. Introduction Data mining term is mainly used for the specific set of six activities namely Classification, Estimation, Prediction, Affinity grouping or Association
More informationBayesian Learning Features of Bayesian learning methods:
Bayesian Learning Features of Bayesian learning methods: Each observed training example can incrementally decrease or increase the estimated probability that a hypothesis is correct. This provides a more
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-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 informationBayesian Classification. Bayesian Classification: Why?
Bayesian Classification http://css.engineering.uiowa.edu/~comp/ Bayesian Classification: Why? Probabilistic learning: Computation of explicit probabilities for hypothesis, among the most practical approaches
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 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 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 informationBayesian Learning. Reading: Tom Mitchell, Generative and discriminative classifiers: Naive Bayes and logistic regression, Sections 1-2.
Bayesian Learning Reading: Tom Mitchell, Generative and discriminative classifiers: Naive Bayes and logistic regression, Sections 1-2. (Linked from class website) Conditional Probability Probability of
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 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 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. 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. Classification. What is classification. Simple methods for classification. Classification by decision tree induction
Classification What is classification Classification Simple methods for classification Classification by decision tree induction Classification evaluation Classification in Large Databases Classification
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 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 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 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 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.
. 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 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 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 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.
. 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 informationCOMP 328: Machine Learning
COMP 328: Machine Learning Lecture 2: Naive Bayes Classifiers Nevin L. Zhang Department of Computer Science and Engineering The Hong Kong University of Science and Technology Spring 2010 Nevin L. Zhang
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 informationMachine Learning in Bioinformatics
Machine Learning in Bioinformatics Arlindo Oliveira aml@inesc-id.pt Data Mining: Concepts and Techniques Data mining concepts Learning from examples Decision trees Neural Networks 1 Typical Supervised
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 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 informationhttp://xkcd.com/1570/ Strategy: Top Down Recursive divide-and-conquer fashion First: Select attribute for root node Create branch for each possible attribute value Then: Split
More informationLecture 9: Bayesian Learning
Lecture 9: Bayesian Learning Cognitive Systems II - Machine Learning Part II: Special Aspects of Concept Learning Bayes Theorem, MAL / ML hypotheses, Brute-force MAP LEARNING, MDL principle, Bayes Optimal
More information( D) I(2,3) I(4,0) I(3,2) weighted avg. of entropies
Decision Tree Induction using Information Gain Let I(x,y) as the entropy in a dataset with x number of class 1(i.e., play ) and y number of class (i.e., don t play outcomes. The entropy at the root, i.e.,
More informationChapter 3: Decision Tree Learning (part 2)
Chapter 3: Decision Tree Learning (part 2) CS 536: Machine Learning Littman (Wu, TA) Administration Books? Two on reserve in the math library. icml-03: instructional Conference on Machine Learning mailing
More informationDecision Tree And Random Forest
Decision Tree And Random Forest Dr. Ammar Mohammed Associate Professor of Computer Science ISSR, Cairo University PhD of CS ( Uni. Koblenz-Landau, Germany) Spring 2019 Contact: mailto: Ammar@cu.edu.eg
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 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 informationLINEAR CLASSIFICATION, PERCEPTRON, LOGISTIC REGRESSION, SVC, NAÏVE BAYES. Supervised Learning
LINEAR CLASSIFICATION, PERCEPTRON, LOGISTIC REGRESSION, SVC, NAÏVE BAYES Supervised Learning Linear vs non linear classifiers In K-NN we saw an example of a non-linear classifier: the decision boundary
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 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 informationCOMP61011! Probabilistic Classifiers! Part 1, Bayes Theorem!
COMP61011 Probabilistic Classifiers Part 1, Bayes Theorem Reverend Thomas Bayes, 1702-1761 p ( T W ) W T ) T ) W ) Bayes Theorem forms the backbone of the past 20 years of ML research into probabilistic
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 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 informationMining Classification Knowledge
Mining Classification Knowledge Remarks on NonSymbolic Methods JERZY STEFANOWSKI Institute of Computing Sciences, Poznań University of Technology SE lecture revision 2013 Outline 1. Bayesian classification
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 informationInduction on Decision Trees
Séance «IDT» de l'ue «apprentissage automatique» Bruno Bouzy bruno.bouzy@parisdescartes.fr www.mi.parisdescartes.fr/~bouzy Outline Induction task ID3 Entropy (disorder) minimization Noise Unknown attribute
More informationAdministrative notes. Computational Thinking ct.cs.ubc.ca
Administrative notes Labs this week: project time. Remember, you need to pass the project in order to pass the course! (See course syllabus.) Clicker grades should be on-line now Administrative notes March
More informationTopics. Bayesian Learning. What is Bayesian Learning? Objectives for Bayesian Learning
Topics Bayesian Learning Sattiraju Prabhakar CS898O: ML Wichita State University Objectives for Bayesian Learning Bayes Theorem and MAP Bayes Optimal Classifier Naïve Bayes Classifier An Example Classifying
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 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 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 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 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 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 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 informationMachine Learning Alternatives to Manual Knowledge Acquisition
Machine Learning Alternatives to Manual Knowledge Acquisition Interactive programs which elicit knowledge from the expert during the course of a conversation at the terminal. Programs which learn by scanning
More informationInteligência Artificial (SI 214) Aula 15 Algoritmo 1R e Classificador Bayesiano
Inteligência Artificial (SI 214) Aula 15 Algoritmo 1R e Classificador Bayesiano Prof. Josenildo Silva jcsilva@ifma.edu.br 2015 2012-2015 Josenildo Silva (jcsilva@ifma.edu.br) Este material é derivado dos
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 informationCOMP61011 : Machine Learning. Probabilis*c Models + Bayes Theorem
COMP61011 : Machine Learning Probabilis*c Models + Bayes Theorem Probabilis*c Models - one of the most active areas of ML research in last 15 years - foundation of numerous new technologies - enables decision-making
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 informationUVA CS / Introduc8on to Machine Learning and Data Mining
UVA CS 4501-001 / 6501 007 Introduc8on to Machine Learning and Data Mining Lecture 13: Probability and Sta3s3cs Review (cont.) + Naïve Bayes Classifier Yanjun Qi / Jane, PhD University of Virginia Department
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 informationEnsemble Methods. Charles Sutton Data Mining and Exploration Spring Friday, 27 January 12
Ensemble Methods Charles Sutton Data Mining and Exploration Spring 2012 Bias and Variance Consider a regression problem Y = f(x)+ N(0, 2 ) With an estimate regression function ˆf, e.g., ˆf(x) =w > x Suppose
More informationThe Quadratic Entropy Approach to Implement the Id3 Decision Tree Algorithm
Journal of Computer Science and Information Technology December 2018, Vol. 6, No. 2, pp. 23-29 ISSN: 2334-2366 (Print), 2334-2374 (Online) Copyright The Author(s). All Rights Reserved. Published by American
More informationDecision Support. Dr. Johan Hagelbäck.
Decision Support Dr. Johan Hagelbäck johan.hagelback@lnu.se http://aiguy.org Decision Support One of the earliest AI problems was decision support The first solution to this problem was expert systems
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 informationSymbolic methods in TC: Decision Trees
Symbolic methods in TC: Decision Trees ML for NLP Lecturer: Kevin Koidl Assist. Lecturer Alfredo Maldonado https://www.cs.tcd.ie/kevin.koidl/cs0/ kevin.koidl@scss.tcd.ie, maldonaa@tcd.ie 01-017 A symbolic
More informationMining Classification Knowledge
Mining Classification Knowledge Remarks on NonSymbolic Methods JERZY STEFANOWSKI Institute of Computing Sciences, Poznań University of Technology COST Doctoral School, Troina 2008 Outline 1. Bayesian classification
More informationNumerical Learning Algorithms
Numerical Learning Algorithms Example SVM for Separable Examples.......................... Example SVM for Nonseparable Examples....................... 4 Example Gaussian Kernel SVM...............................
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 informationCSCE 478/878 Lecture 6: Bayesian Learning and Graphical Models. Stephen Scott. Introduction. Outline. Bayes Theorem. Formulas
ian ian ian Might have reasons (domain information) to favor some hypotheses/predictions over others a priori ian methods work with probabilities, and have two main roles: Naïve Nets (Adapted from Ethem
More informationModern Information Retrieval
Modern Information Retrieval Chapter 8 Text Classification Introduction A Characterization of Text Classification Unsupervised Algorithms Supervised Algorithms Feature Selection or Dimensionality Reduction
More informationStephen Scott.
1 / 28 ian ian Optimal (Adapted from Ethem Alpaydin and Tom Mitchell) Naïve Nets sscott@cse.unl.edu 2 / 28 ian Optimal Naïve Nets Might have reasons (domain information) to favor some hypotheses/predictions
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. 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. Common applications: Health diagnosis systems Bank credit analysis
Decision Trees Rodrigo Fernandes de Mello Invited Professor at Télécom ParisTech Associate Professor at Universidade de São Paulo, ICMC, Brazil http://www.icmc.usp.br/~mello mello@icmc.usp.br Decision
More information