09-decision_trees - Decision Tree Example: BigTip great...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
1 Foundations of Artificial Intelligence Decision Tree Learning CS472 – Fall 2007 Thorsten Joachims Decision Tree Example: BigTip Food Price Speedy no yes no no yes great mediocre yikes yes no adequate high Food (3) Chat (2) Speedy (2) Price (2) Bar (2) BigTip 1 great yes yes adequate no yes 2 great no yes adequate no yes 3 mediocre yes no high no no 4 great yes yes adequate yes yes Top-Down Induction of DT (simplified) Training Data: TDIDF(D,c def ) • IF(all examples in D have same class c) – Return leaf with class c (or class c def , if D is empty) • ELSE IF(no attributes left to test) – Return leaf with class c of majority in D • ELSE – Pick A as the “best” decision attribute for next node – FOR each value v i of A create a new descendent of node •S u b t r e e t i for v i is TDIDT(D i ,c def ) – RETURN tree with A as root and t i as subtrees } v value has x of A attribute : D y) , x {( D i i r r = )} y , x ( , ), y , x {( D n n 1 1 r r = Example: Text Classification
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 02/19/2008 for the course CS 4700 taught by Professor Joachims during the Fall '07 term at Cornell University (Engineering School).

Page1 / 2

09-decision_trees - Decision Tree Example: BigTip great...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online