Presentation is loading. Please wait.

Presentation is loading. Please wait.

CS4445/B12 Provided by: Kenneth J. Loomis. genrecritics-reviewsratingIMAXlikes comedythumbs-upRFALSEno comedythumbs-upRTRUEno comedyneutralRFALSEno actionthumbs-downPG-13TRUEno.

Published byRoss Tyler Modified over 9 years ago

Similar presentations

Presentation on theme: "CS4445/B12 Provided by: Kenneth J. Loomis. genrecritics-reviewsratingIMAXlikes comedythumbs-upRFALSEno comedythumbs-upRTRUEno comedyneutralRFALSEno actionthumbs-downPG-13TRUEno."— Presentation transcript:

1 CS4445/B12 Provided by: Kenneth J. Loomis

2 genrecritics-reviewsratingIMAXlikes comedythumbs-upRFALSEno comedythumbs-upRTRUEno comedyneutralRFALSEno actionthumbs-downPG-13TRUEno actionneutralRTRUEno comedythumbs-downPG-13FALSEyes comedyneutralPG-13TRUEyes dramathumbs-upRFALSEyes dramathumbs-downPG-13TRUEyes dramaneutralRTRUEyes dramathumbs-upPG-13FALSEyes actionneutralRFALSEyes actionthumbs-downPG-13FALSEyes actionneutralPG-13FALSEyes

3 genre =comedy =drama=action genrecritics-reviewsratingIMAXlikes actionthumbs-downPG-13TRUEno actionneutralRTRUEno actionneutralRFALSEyes actionthumbs-downPG-13FALSEyes actionneutralPG-13FALSEyes comedythumbs-upRFALSEno comedythumbs-upRTRUEno comedyneutralRFALSEno comedythumbs-downPG-13FALSEyes comedyneutralPG-13TRUEyes dramathumbs-upRFALSEyes dramathumbs-downPG-13TRUEyes dramaneutralRTRUEyes dramathumbs-upPG-13FALSEyes

4 genrecritics-reviewsratingIMAXlikes actionneutralRTRUEno comedyneutralRFALSEno actionneutralRFALSEyes actionneutralPG-13FALSEyes comedyneutralPG-13TRUEyes dramaneutralRTRUEyes actionthumbs-downPG-13TRUEno actionthumbs-downPG-13FALSEyes comedythumbs-downPG-13FALSEyes dramathumbs-downPG-13TRUEyes comedythumbs-upRFALSEno comedythumbs-upRTRUEno dramathumbs-upRFALSEyes dramathumbs-upPG-13FALSEyes critics- reviews =thumbs-up=neutral =thumbs-down

5 genrecritics-reviewsratingIMAXlikes actionthumbs-downPG-13TRUEno actionneutralPG-13FALSEyes comedyneutralPG-13TRUEyes actionthumbs-downPG-13FALSEyes comedythumbs-downPG-13FALSEyes dramathumbs-downPG-13TRUEyes dramathumbs-upPG-13FALSEyes actionneutralRTRUEno comedyneutralRFALSEno comedythumbs-upRFALSEno comedythumbs-upRTRUEno actionneutralRFALSEyes dramaneutralRTRUEyes dramathumbs-upRFALSEyes rating =PG-13 =R

6 genrecritics-reviewsratingIMAXlikes comedyneutralRFALSEno comedythumbs-upRFALSEno actionneutralPG-13FALSEyes actionthumbs-downPG-13FALSEyes comedythumbs-downPG-13FALSEyes dramathumbs-upPG-13FALSEyes actionneutralRFALSEyes dramathumbs-upRFALSEyes actionthumbs-downPG-13TRUEno actionneutralRTRUEno comedythumbs-upRTRUEno comedyneutralPG-13TRUEyes dramathumbs-downPG-13TRUEyes dramaneutralRTRUEyes IMAX =FALSE=TRUE

7 genre =comedy =drama=action We can see that genre provides us with the lowest entropy, thus it becomes the root node of our ID3 tree.

8 genre =comedy =drama=action Options: critics-reviews rating IMAX ? We now move on to the left child node of our tree. What attribute do we choose for this node?

9 genre =comedy =drama=action critics- reviews =thumbs-up=neutral =thumbs-down genrecritics-reviewsratingIMAXlikes comedyneutralRFALSEno comedyneutralPG-13TRUEyes comedythumbs-downPG-13FALSEyes comedythumbs-upRFALSEno comedythumbs-upRTRUEno

10 genre =comedy =drama=action rating =R=PG-13 genrecritics-reviewsratingIMAXlikes comedyneutralPG-13TRUEyes comedythumbs-downPG-13FALSEyes comedyneutralRFALSEno comedythumbs-upRFALSEno comedythumbs-upRTRUEno

11 genre =comedy =drama=action IMAX =R=PG-13 genrecritics-reviewsratingIMAXlikes comedyneutralRFALSEno comedythumbs-upRFALSEno comedythumbs-downPG-13FALSEyes comedythumbs-upRTRUEno comedyneutralPG-13TRUEyes

12 genre =comedy =drama=action rating =R=PG-13 We can see that rating provides us with the lowest entropy, thus it becomes the left child node of our ID3 tree.

13 genre =comedy =drama=action rating =R=PG-13 This also makes this split homogeneous so we can add our leaf nodes here. [yes][no] genrecritics-reviewsratingIMAXlikes comedyneutralPG-13TRUEyes comedythumbs-downPG-13FALSEyes comedyneutralRFALSEno comedythumbs-upRFALSEno comedythumbs-upRTRUEno

14 genre = comedy = drama = action rating =R = PG-13 We can see that genre = drama provides us with a homogeneous sub-set, so we can provide a leaf node here. [yes] genrecritics-reviewsratingIMAXlikes dramathumbs-upRFALSEyes dramathumbs-downPG-13TRUEyes dramaneutralRTRUEyes dramathumbs-upPG-13FALSEyes [yes][no]

15 genre = comedy = drama = action rating =R = PG-13 We now move on to the right child node of our tree. What attribute do we choose for this node? Options: critics-reviews rating IMAX ? [yes][no] [yes]

16 genre = comedy = drama = action rating =R = PG-13 Critics- reviews =thumbs-up = neutral =thumbs-down genrecritics-reviewsratingIMAXlikes actionneutralRTRUEno actionneutralRFALSEyes actionneutralPG-13FALSEyes actionthumbs-downPG-13TRUEno actionthumbs-downPG-13FALSEyes [yes][no] [yes]

17 genre = comedy = drama = action rating =R = PG-13 rating =R = PG-13 genrecritics-reviewsratingIMAXlikes actionthumbs-downPG-13TRUEno actionneutralPG-13FALSEyes actionthumbs-downPG-13FALSEyes actionneutralRTRUEno actionneutralRFALSEyes [yes][no] [yes]

18 genre = comedy = drama = action rating =R = PG-13 IMAX =TRUE = FALSE genrecritics-reviewsratingIMAXlikes actionneutralPG-13FALSEyes actionthumbs-downPG-13FALSEyes actionneutralRFALSEyes actionthumbs-downPG-13TRUEno actionneutralRTRUEno [yes][no] [yes]

19 genre = comedy = drama = action rating =R = PG-13 IMAX =TRUE = FALSE We can see that IMAX provides us with the lowest entropy, thus it becomes the right child node of our ID3 tree. [yes][no] [yes]

20 genre = comedy = drama = action rating =R = PG-13 IMAX =TRUE = FALSE This also makes this split homogeneous so we can add our leaf nodes here. genrecritics-reviewsratingIMAXlikes actionneutralPG-13FALSEyes actionthumbs-downPG-13FALSEyes actionneutralRFALSEyes actionthumbs-downPG-13TRUEno actionneutralRTRUEno [yes][no] [yes] [no]

21 genre = comedy = drama = action rating =R = PG-13 IMAX =TRUE = FALSE Since we have only leaf nodes remaining we are finished building our tree. [yes][no] [yes] [no]

22 genre = comedy = drama = action rating =R = PG-13 IMAX =TRUE = FALSE How can we handle missing values using this decision tree? Given an instance: Genre = action Critics-reviews = ? Rating = R IMAX = ? How do we classify it? [yes][no] [yes] [no]

23 Consider adding frequency counts to each leaf node: shown here in curly braces. genre = comedy = drama = action rating =R = PG-13 IMAX =TRUE = FALSE [yes] {2}[no] {3} [yes] {4} [yes] {3}[no] {2}

24 Genre = action Critics-reviews = ? Rating = R IMAX = ? Traverse the tree. genre = comedy = drama = action rating =R = PG-13 IMAX =TRUE = FALSE [yes] {2}[no] {3} [yes] {4} [yes] {3}[no] {2}

25 Genre = action Critics-reviews = ? Rating = R IMAX = ? Traverse the decision tree normally when the attribute value is known. genre = comedy = drama = action rating =R = PG-13 IMAX =TRUE = FALSE [yes] {2}[no] {3} [yes] {4} [yes] {3}[no] {2}

26 Genre = action Critics-reviews = ? Rating = R IMAX = ? Traverse every possible path when a missing value is encountered. genre = comedy = drama = action rating =R = PG-13 IMAX =TRUE = FALSE [yes] {2}[no] {3} [yes] {4} [yes] {3}[no] {2}

27 Genre = action Critics-reviews = ? Rating = R IMAX = ? genre = comedy = drama = action rating =R = PG-13 IMAX =TRUE = FALSE [yes] {2}[no] {3} [yes] {4} [yes] {3}[no] {2}

28 Genre = action Critics-reviews = ? Rating = R IMAX = ? like = yes genre = comedy = drama = action rating =R = PG-13 IMAX =TRUE = FALSE [yes] {2}[no] {3} [yes] {4} [yes] {3}[no] {2}

29 Genre = ? Critics-reviews = ? Rating = R IMAX = TRUE like = no genre = comedy = drama = action rating =R = PG-13 IMAX =TRUE = FALSE [yes] {2}[no] {3} [yes] {4} [yes] {3}[no] {2}

30 Genre = ? Critics-reviews = ? Rating = ? IMAX = ? likes = yes genre = comedy = drama = action rating =R = PG-13 IMAX =TRUE = FALSE [yes] {2}[no] {3} [yes] {4} [yes] {3}[no] {2}

Download ppt "CS4445/B12 Provided by: Kenneth J. Loomis. genrecritics-reviewsratingIMAXlikes comedythumbs-upRFALSEno comedythumbs-upRTRUEno comedyneutralRFALSEno actionthumbs-downPG-13TRUEno."

Similar presentations

COMP3740 CR32: Knowledge Management and Adaptive Systems

COMP3740 CR32: Knowledge Management and Adaptive Systems
Rule-Based Classifiers. Rule-Based Classifier Classify records by using a collection of “if…then…” rules Rule: (Condition)  y –where Condition is a conjunctions.

Rule-Based Classifiers. Rule-Based Classifier Classify records by using a collection of “if…then…” rules Rule: (Condition)  y –where Condition is a conjunctions.
C4.5 algorithm Let the classes be denoted {C1, C2,…, Ck}. There are three possibilities for the content of the set of training samples T in the given node.

C4.5 algorithm Let the classes be denoted {C1, C2,…, Ck}. There are three possibilities for the content of the set of training samples T in the given node.
Paper By - Manish Mehta, Rakesh Agarwal and Jorma Rissanen

Paper By - Manish Mehta, Rakesh Agarwal and Jorma Rissanen
Huffman code and ID3 Prof. Sin-Min Lee Department of Computer Science.

Huffman code and ID3 Prof. Sin-Min Lee Department of Computer Science.
IT 433 Data Warehousing and Data Mining

IT 433 Data Warehousing and Data Mining
Decision Tree Approach in Data Mining

Decision Tree Approach in Data Mining
Data Mining Classification: Basic Concepts, Decision Trees, and Model Evaluation Lecture Notes for Chapter 4 Part I Introduction to Data Mining by Tan,

Data Mining Classification: Basic Concepts, Decision Trees, and Model Evaluation Lecture Notes for Chapter 4 Part I Introduction to Data Mining by Tan,
AVL Trees Balancing. The AVL Tree An AVL tree is a balanced binary search tree. What does it mean for a tree to be balanced? It means that for every node.

AVL Trees Balancing. The AVL Tree An AVL tree is a balanced binary search tree. What does it mean for a tree to be balanced? It means that for every node.
Classification: Definition Given a collection of records (training set ) –Each record contains a set of attributes, one of the attributes is the class.

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.

1 Data Mining Classification Techniques: Decision Trees (BUSINESS INTELLIGENCE) Slides prepared by Elizabeth Anglo, DISCS ADMU.
Decision Tree.

Decision Tree.
Data Mining Classification: Basic Concepts, Decision Trees, and Model Evaluation Lecture Notes for Chapter 4 Introduction to Data Mining by Tan, Steinbach,

Data Mining Classification: Basic Concepts, Decision Trees, and Model Evaluation Lecture Notes for Chapter 4 Introduction to Data Mining by Tan, Steinbach,
SUNY Oneonta Data Structures and Algorithms Visualization Teaching Materials Generation Group Binary Search Tree A running demonstration of binary search.

SUNY Oneonta Data Structures and Algorithms Visualization Teaching Materials Generation Group Binary Search Tree A running demonstration of binary search.
Classification Techniques: Decision Tree Learning

Classification Techniques: Decision Tree Learning
Decision Trees Jeff Storey. Overview What is a Decision Tree Sample Decision Trees How to Construct a Decision Tree Problems with Decision Trees Decision.

Decision Trees Jeff Storey. Overview What is a Decision Tree Sample Decision Trees How to Construct a Decision Tree Problems with Decision Trees Decision.
1 18.3 Decision Trees Instructor: Qiang Yang Hong Kong University of Science and Technology Thanks: Eibe Frank and Jiawei Han.

Decision Trees Instructor: Qiang Yang Hong Kong University of Science and Technology Thanks: Eibe Frank and Jiawei Han.
ID3 Algorithm Abbas Rizvi CS157 B Spring 2010. What is the ID3 algorithm? ID3 stands for Iterative Dichotomiser 3 Algorithm used to generate a decision.

ID3 Algorithm Abbas Rizvi CS157 B Spring What is the ID3 algorithm? ID3 stands for Iterative Dichotomiser 3 Algorithm used to generate a decision.
More on Decision Trees. Numerical attributes Tests in nodes can be of the form x j > constant Divides the space into rectangles.

More on Decision Trees. Numerical attributes Tests in nodes can be of the form x j > constant Divides the space into rectangles.
Induction of Decision Trees

Induction of Decision Trees

Similar presentations

Ads by Google