Decision trees. Special Course in Computer and Information Science II. Adam Gyenge Helsinki University of Technology
|
|
|
- Vincent Hall
- 5 years ago
- Views:
Transcription
1 Decision trees Special Course in Computer and Information Science II Adam Gyenge Helsinki University of Technology
2 Introduction Outline: Definition of decision trees ID3 Pruning methods Bibliography: J. Ross Quinlan: Induction of Decision Trees. Machine Learning 1(1): (1986) J. Ross Quinlan: Simplifying Decision Trees. International Journal of Man-Machine Studies 27(3): (1987) T. Mitchell: Machine Learning. McGraw Hill (1997) Adam Gyenge, HUT Decision trees, Spec. Course II 2/32
3 Decision trees There are objects in the world, they have many attributes. The attributes can take their values from a given set (type: category, integer or real). A decision tree, using the attributes, gives a category for the object (classification). Each non-leaf node of the tree is a test on an attribute, having a child for each result of the test. For an incoming object, we shall first do the test in the root, then follow the route down to the leaves. Each leaf is a category, if we reach one of them, then the category of the object is the category belonging to that leaf. Adam Gyenge, HUT Decision trees, Spec. Course II 3/32
4 A simple example Whether to play tennis or not. Attributes: outlook {sunny, overcast, rain} humidity {high, normal} windy {true, false} A possible tree: Adam Gyenge, HUT Decision trees, Spec. Course II 4/32
5 Decision rules A path from the root to a leaf: a decision rule. if T 1 T 2 T n then Y = y i Where T j is a test on the j-th attribute (it may be always true ) and y i is the i-th category. The decision tree represents a consistent set of decision rules. Adam Gyenge, HUT Decision trees, Spec. Course II 5/32
6 Learning a decision tree 1 Input: a training set of objects, whose class is known. Output: a decision tree, that can categorize any object induction Now, for simplicity, there will be only two classes (Positive and Negative), and all the attributes are category type Adam Gyenge, HUT Decision trees, Spec. Course II 6/32
7 Learning a decision tree 2 If there are two objects with identical attributes but different categories, no correct tree exists There can be several trees that classify the entire training set correctly Aim: construct the simplest tree We expect, that this classifies correctly more objects outside the training set Adam Gyenge, HUT Decision trees, Spec. Course II 7/32
8 ID3 Recursive algorithm: 1. If all the training examples are from the same class, then let this be a category node and RETURN. Otherwise: 2. If there are no more attributes left, then let this be a category node using majority voting and RETURN. Otherwise: 3. Choose the best attribute for the current node 4. For each value of the attribute create a child node 5. Split the training set: assign each example to the corresponding child node 6. For each node: 6.1 If the node is empty, then let it be a category node using majority voting in the examples of it s parents 6.2 If the node is not empty, then call this algorithm on it Adam Gyenge, HUT Decision trees, Spec. Course II 8/32
9 Choosing the best attribute 1 Which is the best attribute? We want the classes of examples in the child-nodes to be homogeneous We assume, that the training set represents well the original population: Pr(C = Positive) = p p + n Pr(C = Negative) = n p + n where C is the class attribute p is the number of samples with positive class n is the number of samples with negative class Adam Gyenge, HUT Decision trees, Spec. Course II 9/32
10 Choosing the best attribute 2 Entropy: The expected number of bits, required to encode the class labels as messages, drawn randomly from the samples (S) H(S) = p ( ) p p + n log 2 n ( ) n p + n p + n log 2 p + n The less entropy means less uncertainty the more homogeneous the sample is Adam Gyenge, HUT Decision trees, Spec. Course II 10/32
11 Choosing the best attribute 3 Assume attribute A taking V different values {S 1,..., S v } are the sample sets belonging to each value The average entropy of the sorted sample set is: E(S, A) = v i=1 S i S H(S i) The information gained by choosing A as branching attribute is: gain(a) = H(S) E(S, A) The best attribute: for which gain(a) is maximum, or (since H(S) is the same for each attribute) E(S, A) is minimum. Adam Gyenge, HUT Decision trees, Spec. Course II 11/32
12 A simple example No Outlook Temperature Humidity Windy Class 1 sunny hot high false N 2 sunny hot high true N 3 overcoast hot high false P 4 rain mild high false P 5 rain cool normal false P 6 rain cool normal true N 7 overcast cool normal true P 8 sunny mild high false N 9 sunny cool normal false P 10 rain mild normal false P 11 sunny mild normal true P 12 overcast mild high true P 13 overcast hot normal false P 14 rain mild high true N Adam Gyenge, HUT Decision trees, Spec. Course II 12/32
13 Calculations There are 9 positive and 5 negative examples (9 + 5 = 14). H(S) = 9 14 log log 5 14 = 0.94 For the attribute Outlook : sunny: 2 positive, 3 negative (2+3=5), H(S sunny ) = overcast: 4 positive, 0 negative (4+0=4), H(S overcast ) = 0 rain: 3 positive, 2 negative (3+2=5), H(S rain ) = E(S, Outlook) = 5 14 H(S sunny) H(S overcast) H(S rain) = Adam Gyenge, HUT Decision trees, Spec. Course II 13/32
14 Gain of attributes The information gain of the Outlook attribute: gain(outlook) = = Similarly: gain(temperature) = gain(humidity) = gain(windy) = Result: Outlook is the best attribute for the root node Adam Gyenge, HUT Decision trees, Spec. Course II 14/32
15 Problem of irrelevant attributes There may be some attribute, that are irrelevant for the decision In these cases, the information gain is small (although not 0) We can define a threshold for the gain (absolute or percentage) If there is no attribute to exceed the threshold, we stop the recursion Adam Gyenge, HUT Decision trees, Spec. Course II 15/32
16 Problem with information gain A is an attribute with a set of possible values: {A 1,..., A v } Create a new attribute B by splitting one of the values into two (eg. A v splits into B v and B v+1, proportion does not matter) It can be shown, that gain(b) gain(a) always So ID3 prefers attributes with more values builds flat trees It s better to use the gain ratio as attribute selecting function IV (A) = v p i +n i i=1 p+n log p i +n i p+n gain ratio(a) = gain(a) IV (A) Adam Gyenge, HUT Decision trees, Spec. Course II 16/32
17 Problem of overfitting The training data may contain noise We want to learn the general distribution, to reduce classification error on any data Error of hypothesis h on training data: error train (h) Error of hypothesis h on entire distribution: error D (h) Hypothesis h overfits the training data, if there is an alternative hypothesis h H, for which error train (h) < error train (h ) but error D (h) > error D (h ) Adam Gyenge, HUT Decision trees, Spec. Course II 17/32
18 Avoiding overfitting Pruning: Prepruning: stop growing, when the data split is not significant (covered earlier, problem of irrelevant attributes) Postpruning: grow full tree, and then substitute some subtrees by single nodes. A few methods: 1. Reduced Error Pruning 2. Cost-Complexity Pruning 3. Pessimistic Pruning We usually split the input set into 3 parts 1. Training set: used for constructing the tree 2. Pruning set: independent from training set, used by some pruning methods 3. Test set: estimation of accuracy on a real data Adam Gyenge, HUT Decision trees, Spec. Course II 18/32
19 Reduced Error Pruning Algorithm: 1. Let S be a subtree in T 2. T : S is substituted with the best leaf (majority voting in training set) 3. E is the number of missclassified items of T on the pruning set 4. E is the number of missclassified items of T on the pruning set 5. If E E, then prune S 6. Repeat this, until possible What is the order of the nodes to consider? Bottom-up Adam Gyenge, HUT Decision trees, Spec. Course II 19/32
20 Example of REP An example tree and pruning set: Adam Gyenge, HUT Decision trees, Spec. Course II 20/32
21 Example of REP Adam Gyenge, HUT Decision trees, Spec. Course II 21/32
22 Cost-complexity pruning Considers error on training set error on pruning set size of the tree Tries to minimize error and complexity Adam Gyenge, HUT Decision trees, Spec. Course II 22/32
23 Notations T is a decision tree N is the size of the training set used for generating T L(T) is the number of leaves in T E is the number of missclassified training examples Cost-complexity (or total cost) = Error cost + Cost of complexity CC(T ) = E N + α L(T ) α is the cost of complexity per leaf Adam Gyenge, HUT Decision trees, Spec. Course II 23/32
24 CC Pruning S is a subtree of T, we substitute it with a single leaf by majority voting beetwen its descendant leaves M = (the new number of misclassified training examples) - E The new tree has L(T ) L(S) + 1 leaves. If CC(T old ) = CC(T new ), then α = M N (L(S) 1) Adam Gyenge, HUT Decision trees, Spec. Course II 24/32
25 CC Pruning - Algorithm Algorithm: 1. Compute α for each node, 2. Find the minimum, prune subtrees having this value 3. Repeat steps 1, 2 until one leaf is left, this gives a series of trees: T 0,..., T k 4. Standard error (N is the size of the pruning set, and E is the smallest error of all the trees on the pruning set): E se = (N E ) 5. Choose the smallest tree, whose observed error on the pruning set does not exceeds E + se (=not very far from the minimum error) N Adam Gyenge, HUT Decision trees, Spec. Course II 25/32
26 A medical example 4 categories: primary, secondary, compensated, negative The numbers of training examples, used for generating the tree, are shown in parenthesis Adam Gyenge, HUT Decision trees, Spec. Course II 26/32
27 Example of CCP Let s consider the subtree of the node [T4U]. There is only one example, which is not negative If we replace this subtree, with a leaf (of course with negative label), then: M=1 L(S)=4 N=2018 α = = , this will be the least in the whole tree So at first, we shall replace this subtree by a leaf labelled as negative Adam Gyenge, HUT Decision trees, Spec. Course II 27/32
28 Pessimistic Pruning Notations again: N is the number of training examples K of them corresponds to a specific leaf J of them is missclassified, if we use a majority elected label (J = K - number of majority examples) Estimation of error on the leaf: J K A better one (with the continuity correction of binomial distribution): J+1/2 K Expected error for K unseen samples: J + 1/2 Adam Gyenge, HUT Decision trees, Spec. Course II 28/32
29 Pessimistic Pruning If we think pessimisticly: S is a subtree, contains L(S) leaves J and K are the sums of J and K over these leaves Expected error on S for K unseen samples: J + L(S)/2 Let E be the number of misclassified training examples, if we substitute S by majority vote If E + 1/2 ( J + L(S)/2) + se then prune S (se is the standard error, as before) Algorithm: 1. Top-down checking of nodes (all none-leaf nodes are examined just once) 2. If possible, then substitute subtree with majority labelled leaf Adam Gyenge, HUT Decision trees, Spec. Course II 29/32
30 A medical example - revisited Adam Gyenge, HUT Decision trees, Spec. Course II 30/32
31 Example of PP For the node [T4U]: K = 2018 J = 0 L(S) = 4 Estimate of error on S = 0 + 4/2 = 2 2 (2018 2) Standard error = 2018 = 1.41 Result of election: negative, E = /2 < substitute subtree of [T4U] with [negative] leaf Adam Gyenge, HUT Decision trees, Spec. Course II 31/32
32 Summary Decision trees for classification ID3 uses entropy based information gain for selecting best attribute to split on Problem of irrelevant attributes Overfitting can be avoided by postpruning 1. Reduced error pruning 2. Cost-complexity pruning 3. Pessimistic pruning Thank you for your attention. Questions? Adam Gyenge, HUT Decision trees, Spec. Course II 32/32
Classification: 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
Machine 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
Decision 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
http://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
Decision 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
Decision 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.
Lecture 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
Learning 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?
CS 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}
Learning 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
Classification 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
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
Decision 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
Learning 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
Introduction. 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
Induction 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
Decision Trees Entropy, Information Gain, Gain Ratio
Changelog: 14 Oct, 30 Oct Decision Trees Entropy, Information Gain, Gain Ratio Lecture 3: Part 2 Outline Entropy Information gain Gain ratio Marina Santini Acknowledgements Slides borrowed and adapted
CS6375: 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
Decision 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:
Question 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
Decision 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
Decision 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
Decision-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
Decision 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
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
Decision 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,
Supervised 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"
ML 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
CS145: 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
Administration. 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
Decision 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
EECS 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
Introduction to Machine Learning CMU-10701
Introduction to Machine Learning CMU-10701 23. Decision Trees Barnabás Póczos Contents Decision Trees: Definition + Motivation Algorithm for Learning Decision Trees Entropy, Mutual Information, Information
Lecture 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,
Dan 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
Chapter 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.
Decision 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
Decision 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
Universitä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:
DECISION TREE LEARNING. [read Chapter 3] [recommended exercises 3.1, 3.4]
![DECISION TREE LEARNING. [read Chapter 3] [recommended exercises 3.1, 3.4]](/thumbs/78/78784288.jpg "DECISION 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
Notes 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
Machine 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
Decision 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.
Einfü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
Decision 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,
Outline. 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
Data 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
Decision 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
C4.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
Decision 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
Administrative 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
Machine 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
Decision 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
Rule 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
M 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
Algorithms 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.
Introduction 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
Symbolic 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
The 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
Symbolic 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/cs4062/ kevin.koidl@scss.tcd.ie, maldonaa@tcd.ie 2016-2017 2
Classification 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
Bayesian 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
Machine 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
Decision 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
Machine 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
Data 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
Decision 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
Classification 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
CS 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
Lecture 7 Decision Tree Classifier
Machine Learning Dr.Ammar Mohammed Lecture 7 Decision Tree Classifier Decision Tree A decision tree is a simple classifier in the form of a hierarchical tree structure, which performs supervised classification
Induction 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.
Decision 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
Decision 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
Data 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,
Machine Learning: Symbolische Ansätze. Decision-Tree Learning. Introduction C4.5 ID3. Regression and Model Trees
Machine Learning: Symbolische Ansätze Decision-Tree Learning Introduction Decision Trees TDIDT: Top-Down Induction of Decision Trees ID3 Attribute selection Entropy, Information, Information Gain Gain
CHAPTER-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
Artificial 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
Decision 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
Lecture 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
Decision 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
Inductive 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
Artificial Intelligence Decision Trees
Artificial Intelligence Decision Trees Andrea Torsello Decision Trees Complex decisions can often be expressed in terms of a series of questions: What to do this Weekend? If my parents are visiting We
Classification: 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
( 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.,
Classification: 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
Decision 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:
Chapter 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
Typical 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)
Slides for Data Mining by I. H. Witten and E. Frank
Slides for Data Mining by I. H. Witten and E. Frank 4 Algorithms: The basic methods Simplicity first: 1R Use all attributes: Naïve Bayes Decision trees: ID3 Covering algorithms: decision rules: PRISM Association
Classification 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 ()
Decision 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
Machine Learning Chapter 4. Algorithms
Machine Learning Chapter 4. Algorithms 4 Algorithms: The basic methods Simplicity first: 1R Use all attributes: Naïve Bayes Decision trees: ID3 Covering algorithms: decision rules: PRISM Association rules
Artificial Intelligence EDAF70
Artificial Intelligence EDAF70 Pierre Nugues Lund University Pierre.Nugues@cs.lth.se http://cs.lth.se/pierre_nugues/ February 7, 2018 Pierre Nugues Artificial Intelligence EDAF70 February 7, 2018 1 / 54
Decision 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
Tutorial 6. By:Aashmeet Kalra
Tutorial 6 By:Aashmeet Kalra AGENDA Candidate Elimination Algorithm Example Demo of Candidate Elimination Algorithm Decision Trees Example Demo of Decision Trees Concept and Concept Learning A Concept
Chapter 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
Bayesian 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
Classification 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
10-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,
2018 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