Decision Tree  Decision tree is a popular classifier.

Slides:



Advertisements
Similar presentations
Rule-Based Classifiers. Rule-Based Classifier Classify records by using a collection of “if…then…” rules Rule: (Condition)  y –where Condition is a conjunctions.
Advertisements

Rule Generation from Decision Tree Decision tree classifiers are popular method of classification due to it is easy understanding However, decision tree.
Data Mining Techniques: Classification. Classification What is Classification? –Classifying tuples in a database –In training set E each tuple consists.
Hunt’s Algorithm CIT365: Data Mining & Data Warehousing Bajuna Salehe
Decision Tree Approach in Data Mining
Classification with Multiple Decision Trees
Introduction Training Complexity, Pruning CART vs. ID3 vs. C4.5
Non-Metric Methods: Decision Trees Alexandros Potamianos Dept of ECE, Tech. Univ. of Crete Fall
Bab /44 Bab 4 Classification: Basic Concepts, Decision Trees & Model Evaluation Part 1 Classification With Decision tree.
Classification: Definition Given a collection of records (training set ) –Each record contains a set of attributes, one of the attributes is the class.
1 Data Mining Classification Techniques: Decision Trees (BUSINESS INTELLIGENCE) Slides prepared by Elizabeth Anglo, DISCS ADMU.
Decision Tree.
Data Mining Classification: Basic Concepts, Decision Trees, and Model Evaluation Lecture Notes for Chapter 4 Introduction to Data Mining by Tan, Steinbach,
Classification Techniques: Decision Tree Learning
Chapter 7 – Classification and Regression Trees
Chapter 7 – Classification and Regression Trees
Lecture outline Classification Decision-tree classification.
Online Algorithms – II Amrinder Arora Permalink:
ID3 Algorithm Abbas Rizvi CS157 B Spring What is the ID3 algorithm? ID3 stands for Iterative Dichotomiser 3 Algorithm used to generate a decision.
Ensemble Learning: An Introduction
Data Mining with Decision Trees Lutz Hamel Dept. of Computer Science and Statistics University of Rhode Island.
Classification.
Ordinal Decision Trees Qinghua Hu Harbin Institute of Technology
Gini Index (IBM IntelligentMiner)
Machine Learning Lecture 10 Decision Trees G53MLE Machine Learning Dr Guoping Qiu1.
ID3 Algorithm Allan Neymark CS157B – Spring 2007.
Data Mining: Classification
Learning what questions to ask. 8/29/03Decision Trees2  Job is to build a tree that represents a series of questions that the classifier will ask of.
Bayesian Networks. Male brain wiring Female brain wiring.
1 Data Mining Lecture 3: Decision Trees. 2 Classification: Definition l Given a collection of records (training set ) –Each record contains a set of attributes,
Chapter 9 – Classification and Regression Trees
Decision Trees Jyh-Shing Roger Jang ( 張智星 ) CSIE Dept, National Taiwan University.
Decision Tree Learning Debapriyo Majumdar Data Mining – Fall 2014 Indian Statistical Institute Kolkata August 25, 2014.
Decision Trees. Decision trees Decision trees are powerful and popular tools for classification and prediction. The attractiveness of decision trees is.
Business Intelligence and Decision Modeling Week 9 Customer Profiling Decision Trees (Part 2) CHAID CRT.
Machine Learning II 부산대학교 전자전기컴퓨터공학과 인공지능연구실 김민호
Decision Tree (Rule Induction)
Chapter 6 Classification and Prediction Dr. Bernard Chen Ph.D. University of Central Arkansas.
Decision Trees Example of a Decision Tree categorical continuous class Refund MarSt TaxInc YES NO YesNo Married Single, Divorced < 80K> 80K Splitting.
Classification and Prediction
DECISION TREE Ge Song. Introduction ■ Decision Tree: is a supervised learning algorithm used for classification or regression. ■ Decision Tree Graph:
1 Illustration of the Classification Task: Learning Algorithm Model.
Bootstrapped Optimistic Algorithm for Tree Construction
1 Classification: predicts categorical class labels (discrete or nominal) classifies data (constructs a model) based on the training set and the values.
Data Mining By Farzana Forhad CS 157B. Agenda Decision Tree and ID3 Rough Set Theory Clustering.
Analyzing Stock Quotes using Data Mining Techniques Name of Student: To Yi Fun University Number: First Presentation, Final Year Project, 2013.
Decision Trees.
Combining multiple learners Usman Roshan. Decision tree From Alpaydin, 2010.
Decision Trees Prof. Carolina Ruiz Dept. of Computer Science WPI.
BY International School of Engineering {We Are Applied Engineering} Disclaimer: Some of the Images and content have been taken from multiple online sources.
DATA MINING TECHNIQUES (DECISION TREES ) Presented by: Shweta Ghate MIT College OF Engineering.
Review of Decision Tree Learning Bamshad Mobasher DePaul University Bamshad Mobasher DePaul University.
By N.Gopinath AP/CSE.  A decision tree is a flowchart-like tree structure, where each internal node (nonleaf node) denotes a test on an attribute, each.
DECISION TREES An internal node represents a test on an attribute.
Privacy-Preserving Data Mining
Decision Trees.
Ch9: Decision Trees 9.1 Introduction A decision tree:
Chapter 6 Classification and Prediction
© 2013 ExcelR Solutions. All Rights Reserved Data Mining - Supervised Decision Tree & Random Forest.
Classification and Prediction
ID3 Algorithm.
Introduction to Data Mining, 2nd Edition by
Classification by Decision Tree Induction
Data Mining – Chapter 3 Classification
Statistical Learning Dong Liu Dept. EEIS, USTC.
©Jiawei Han and Micheline Kamber
Decision Tree (Rule Induction)
Decision Tree  Decision tree is a popular classifier.
Classification 1.
400 students are asked how they travel to school.
Presentation transcript:

Decision Tree  Decision tree is a popular classifier.  It is supervised learning.  Given a training data, we can induce a decision tree.  From a decision tree we can easily create rules about the data.  Using decision tree, we can easily predict the classification of unseen records. What is Decision Tree?  Decision tree is a hierarchical tree structure that used to classify classes based on a series of questions (or rules) about the attributes of the class. Let us start with an example Attributes Classes Gender Car ownership Travel Cost ($)/km Income Level Transportation mode Male Cheap Low Bus 1 Medium Female Train Standard Expensive High 2 Based on above training data, we can induce a decision tree as the following:

because based on the given data attribute “travel cost per km” would Notice that attribute “income level” is not included in the decision tree because based on the given data attribute “travel cost per km” would produce better classification than “income level”. How to use a decision tree?  Decision tree can be used to predict a pattern or to classify the class of a data.  Suppose we have new unseen records of a person from the same location where the data sample was taken.  The following data are called test data (in contrast to training data) because we would like to examine the classes of these data. Person name Gender Car ownership Travel Cost ($)/km Income Level Transportation Mode Alex Male 1 Standard High ? Buddy Cheap Mediu Cherry Female  The question is what transportation mode would Alex, Buddy and Cheery use?  Using the decision  We can start from the root node which contains Travel cost per km attribute.  If the travel cost per km is expensive, the person uses car.  If the travel cost per km is standard price, the person uses train.  If the travel cost is cheap, the decision tree needs to ask next question about the gender of the person.  If the person is a male, then he uses bus.  If the gender is female, the decision tree needs to ask again on how many cars she own in her household.  If she has no car, she uses bus, otherwise she uses train.

The rules generated from the decision tree above are mutually exclusive and exhaustive for each class label on the leaf node of the tree:  Rule 1: If Travel cost/km is expensive then mode = car  Rule 2: If Travel cost/km is standard then mode = train  Rule 3: If Travel cost/km is cheap and gender is male then mode = bus  Rule 4: If Travel cost/km is cheap and gender is female and she owns no car then mode = bus  Rule 5: If Travel cost/km is cheap and gender is female and she owns 1 car then mode = train Person Name Travel Cost ($)/km Gender Car ownership Transportation Mode Alex Standard Male 1 Train Buddy Cheap Bus Cherry Female How to generate a decision tree?  How to measure impurity? Entropy Gini Index Classification error  How a decision tree algorithm work? Improvement through gain ratio