Presentation is loading. Please wait.

Presentation is loading. Please wait.

R & Trees There are two tree libraries: tree: original

Published byGeoffrey Rich Modified over 5 years ago

Similar presentations

Presentation on theme: "R & Trees There are two tree libraries: tree: original"β€” Presentation transcript:

1 R & Trees There are two tree libraries: tree: original
rpart: New and used by Plant

2 Cost-Complexity Measure
Cost-Complexity Measure (cp) 𝑅 𝛼 𝑇 =𝑅 𝑇 +𝛼 𝑇 Relative error (rel error) Related to R2: R2 = 1 – Relative error Complexity Measure: 𝑇 - Number of terminal nodes 𝛼 – Complexity parameter

3 R Parameters Rpart.control() Creates the parameters to control fit
minsplit – minimum number of data points in a node before a split is tried cp – complexity parameter

4 If X>50 Value=1 Else Value=2

5

6

7

8 If (X>50) and (Y>50) Value=2
Else if (X<50) and (Y<50) Value=2 Else Value =1

9

10

11 Cross-Validation 10 fold Bootstrap

Download ppt "R & Trees There are two tree libraries: tree: original"

Similar presentations

Detecting Statistical Interactions with Additive Groves of Trees

Detecting Statistical Interactions with Additive Groves of Trees
Empirical Algorithmics Reading Group Oct 11, 2007 Tuning Search Algorithms for Real-World Applications: A Regression Tree Based Approach by Thomas Bartz-Beielstein.

Empirical Algorithmics Reading Group Oct 11, 2007 Tuning Search Algorithms for Real-World Applications: A Regression Tree Based Approach by Thomas Bartz-Beielstein.
Copyright Β© 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Slide 16- 1.

Copyright Β© 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Slide
NEURAL NETWORKS Backpropagation Algorithm

NEURAL NETWORKS Backpropagation Algorithm
Random Forest Predrag Radenković 3237/10

Random Forest Predrag Radenković 3237/10
O(N 1.5 ) divide-and-conquer technique for Minimum Spanning Tree problem Step 1: Divide the graph into οƒ– N sub-graph by clustering. Step 2: Solve each.

O(N 1.5 ) divide-and-conquer technique for Minimum Spanning Tree problem Step 1: Divide the graph into οƒ– N sub-graph by clustering. Step 2: Solve each.
Learning Rules from Data

Learning Rules from Data
Math 5364 Notes Chapter 4: Classification

Math 5364 Notes Chapter 4: Classification
CART: Classification and Regression Trees Chris Franck LISA Short Course March 26, 2013.

CART: Classification and Regression Trees Chris Franck LISA Short Course March 26, 2013.
Regression Tree Learning Gabor Melli July 18 th, 2013.

Regression Tree Learning Gabor Melli July 18 th, 2013.
Motion Planning for Tower Crane Operation. Motivation  Tower crane impacts the schedule greatly  Safety of tower crane operation is critical.

Motion Planning for Tower Crane Operation. Motivation  Tower crane impacts the schedule greatly  Safety of tower crane operation is critical.
Original Tree: 9876543210 2000011001000 1000001100100 1700010101010 1200001111000 5231000001011 4000110010000 3500101011110 8441101001100 7751100000111.

Original Tree:
Insert 2000 0 1 1 0 0 1 0 0 0 A tree starts with the dummy node D 0 0 0 0 0 0 0 0 0 0 D 200 D 7 Insert 1000 0 0 1 1 0 0 1 0 0 100 D 6 200 7.

Insert A tree starts with the dummy node D D 200 D 7 Insert D
Decision Tree Pruning. Problem Statement We like to output small decision tree  Model Selection The building is done until zero training error Option.

Decision Tree Pruning. Problem Statement We like to output small decision tree  Model Selection The building is done until zero training error Option.
End of Chapter 8 Neil Weisenfeld March 28, 2005.

End of Chapter 8 Neil Weisenfeld March 28, 2005.
Example of a Decision Tree categorical continuous class Splitting Attributes Refund Yes No NO MarSt Single, Divorced Married TaxInc NO < 80K > 80K.

Example of a Decision Tree categorical continuous class Splitting Attributes Refund Yes No NO MarSt Single, Divorced Married TaxInc NO < 80K > 80K.
CHAPTER 29 Classification and Regression Trees Dean L. Urban From: McCune, B. & J. B. Grace. 2002. Analysis of Ecological Communities. MjM Software Design,

CHAPTER 29 Classification and Regression Trees Dean L. Urban From: McCune, B. & J. B. Grace Analysis of Ecological Communities. MjM Software Design,
Insertion into a B+ Tree Null Tree Ptr Data Pointer * Tree Node Ptr After Adding 8 and then 5… 85 Insert 1 : causes overflow – add a new level * 5 * 158.

Insertion into a B+ Tree Null Tree Ptr Data Pointer * Tree Node Ptr After Adding 8 and then 5… 85 Insert 1 : causes overflow – add a new level * 5 * 158.
Chapter 11 Network Models. What You Need to Know For each of the three models: –What is the model? (what are given and what is to calculate) –What is.

Chapter 11 Network Models. What You Need to Know For each of the three models: –What is the model? (what are given and what is to calculate) –What is.
Evaluation of Results (classifiers, and beyond) Biplav Srivastava Sources: [Witten&Frank00] Witten, I.H. and Frank, E. Data Mining - Practical Machine.

Evaluation of Results (classifiers, and beyond) Biplav Srivastava Sources: [Witten&Frank00] Witten, I.H. and Frank, E. Data Mining - Practical Machine.

Similar presentations

Ads by Google