{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

class_10_12

# class_10_12 - Statistical Data Mining ORIE 474 Fall 2007...

This preview shows pages 1–5. Sign up to view the full content.

Statistical Data Mining ORIE 474 Fall 2007 Tatiyana Apanasovich 10/12/07 DM Algorithms Ex: Classification and Regression Trees (CART)

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

View Full Document
5.1 Introduction A DM algorithm is a well-defined procedure that takes data as input and produces output in the form of models or pattern. Well-defined in the sense that the procedure can be stated as a finite set of rules Algorithm : The procedure must always terminate after a finite number of steps and produce some output Steepest descent search technique is computational method To implement steepest descent as an algorithm we have to Initialize, specify how to identify the direction of steepest descent, how far to move in chosen direction, when to terminate
Components of a DM Algorithm Components Description Ex: CART Task Visualization, clustering, classification, regression, etc. Classification & regression Structure Linear regression model, hierarchical clustering model, etc. Decision tree Score Function Misclassification error, squared error, etc. Should reflect the relative practical utility of different parameterizations of the model or pattern structures Cross-validated loss function Search Method To search over parameters and structures Issues: computational method & search- related parameters Greedy search over structures Data Mgmt Technique To be used for storing, indexing and retrieving data Unspecified

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

View Full Document
5.2 Ex: Classification and
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page1 / 16

class_10_12 - Statistical Data Mining ORIE 474 Fall 2007...

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

View Full Document
Ask a homework question - tutors are online