Classification Part 4. Model Evaluation

Size: px
Start display at page:

Download "Classification Part 4. Model Evaluation"

Transcription

1 Clssifiction Prt 4 Dr. Snjy Rnk Professor Computer nd Informtion Science nd Engineering University of Florid, Ginesville Model Evlution Metrics for Performnce Evlution How to evlute the performnce of model Methods for Performnce Evlution How to obtin relible estimtes Methods for Model Comprison How to compre the reltive performnce mong competing models Dt Mining Snjy Rnk Fll

2 Metrics for Performnce Evlution Focus on the predictive cpbility of model Rther thn how fst it tkes to clssify or build models, sclbility, etc. Confusion Mtrix: PREDICTED c b d : TP (true positive) b: FN (flse negtive) c: FP (flse positive) d: TN (true negtive) Dt Mining Snjy Rnk Fll Metrics for Performnce Evlution PREDICTED (TP) c (FP) B (FN) d (TN) Most widelyused metric: d TP TN Accurcy = = b c d TP TN FP FN Dt Mining Snjy Rnk Fll

3 Cost Mtrix PREDICTED C(i j) C(Yes Yes) C(No Yes) C(Yes No) C(No No) C(i j): Cost of misclssifying clss j exmple s clss i Accurcy is useful mesure if C(Yes No)=C(No Yes) nd C(Yes Yes)=C(No No) P(Yes) = P(No) (clss distribution re equl) Dt Mining Snjy Rnk Fll Cost vs. Accurcy Cost Mtrix PREDICTED C(i j) 00 0 Model M PREDICTED Model M 2 PREDICTED C(i j) C(i j) Accurcy = 80% Cost = 390 Accurcy = 90% Cost = 4255 Dt Mining Snjy Rnk Fll

4 CostSensitive Mesures Precision (p) = c Recll (r) = b 2rp 2 F mesure (F) = = r p 2 b c Precision is bised towrds C(Yes Yes) & C(Yes No) Recll is bised towrds C(Yes Yes) & C(No Yes) Fmesure is bised towrds ll except C(No No) w w d 4 Weighted Accurcy = w w b w c w d Dt Mining Snjy Rnk Fll Methods for Performnce Evlution How to obtin relible estimte of performnce Performnce of model my depend on other fctors besides the lerning lgorithm: Clss distribution Cost of misclssifiction Size of trining nd test sets Dt Mining Snjy Rnk Fll

5 Lerning Curve Lerning curve shows how ccurcy chnges with vrying smple size Requires smpling schedule for creting lerning curve Arithmetic smpling Geometric smpling Effect of smll smple size Bis in the estimte Vrince of the estimte Dt Mining Snjy Rnk Fll Methods for Estimtion Holdout Reserve 2/3 for trining nd /3 for testing Rndom subsmpling Repeted holdout Cross vlidtion Prtition dt into k disjoint subsets kfold: trin on k prtitions, test on the remining one Leveoneout: k=n Strtified smpling Oversmpling vs. Undersmpling Bootstrp Smpling with replcement Dt Mining Snjy Rnk Fll

6 Receiver Operting Chrcteristic (ROC) Developed in 950s for signl detection theory to nlyze noisy signls Chrcterize the trdeoff between positive hits nd flse lrms ROC curve plots TP (on the yxis) ginst FP (on the xxis) Performnce of ech clssifier represented s point on the ROC curve chnging the threshold of lgorithm, smple distribution or cost mtrix chnges the loction of the point Dt Mining Snjy Rnk Fll 2003 ROC Curve dimensionl dt set contining 2 clsses (positive nd negtive) Any point locted t x > t is clssified s positive At threshold t: TP=0.5, FN=0.5, FP=0.2, FN=0.88 Dt Mining Snjy Rnk Fll

7 (TP,FP): (0,0): declre everything to be negtive clss (,): declre everything to be positive clss (,0): idel ROC Curve Digonl line: Rndom guessing Below digonl line: prediction is opposite of the true clss Dt Mining Snjy Rnk Fll Using ROC for Model Comprison No model consistently outperforms the other M is better for smll FPR M2 is better for lrge FPR Are under the ROC curve Idel, re = Rndom guess, re = 0.5 Dt Mining Snjy Rnk Fll

Evaluation & Credibility Issues

Evaluation & Credibility Issues Evaluation & Credibility Issues What measure should we use? accuracy might not be enough. How reliable are the predicted results? How much should we believe in what was learned? Error on the training data

More information

A general framework for estimating similarity of datasets and decision trees: exploring semantic similarity of decision trees

A general framework for estimating similarity of datasets and decision trees: exploring semantic similarity of decision trees A generl frmework for estimting similrity of dtsets nd decision trees: exploring semntic similrity of decision trees Irene Ntoutsi Alexndros Klousis Ynnis Theodoridis Abstrct Decision trees re mong the

More information

Solution for Assignment 1 : Intro to Probability and Statistics, PAC learning

Solution for Assignment 1 : Intro to Probability and Statistics, PAC learning Solution for Assignment 1 : Intro to Probbility nd Sttistics, PAC lerning 10-701/15-781: Mchine Lerning (Fll 004) Due: Sept. 30th 004, Thursdy, Strt of clss Question 1. Bsic Probbility ( 18 pts) 1.1 (

More information

Driving Cycle Construction of City Road for Hybrid Bus Based on Markov Process Deng Pan1, a, Fengchun Sun1,b*, Hongwen He1, c, Jiankun Peng1, d

Driving Cycle Construction of City Road for Hybrid Bus Based on Markov Process Deng Pan1, a, Fengchun Sun1,b*, Hongwen He1, c, Jiankun Peng1, d Interntionl Industril Informtics nd Computer Engineering Conference (IIICEC 15) Driving Cycle Construction of City Rod for Hybrid Bus Bsed on Mrkov Process Deng Pn1,, Fengchun Sun1,b*, Hongwen He1, c,

More information

Hidden Markov Models

Hidden Markov Models Hidden Mrkov Models Huptseminr Mchine Lerning 18.11.2003 Referent: Nikols Dörfler 1 Overview Mrkov Models Hidden Mrkov Models Types of Hidden Mrkov Models Applictions using HMMs Three centrl problems:

More information

Performance Evaluation

Performance Evaluation Performance Evaluation Confusion Matrix: Detected Positive Negative Actual Positive A: True Positive B: False Negative Negative C: False Positive D: True Negative Recall or Sensitivity or True Positive

More information

Riemann is the Mann! (But Lebesgue may besgue to differ.)

Riemann is the Mann! (But Lebesgue may besgue to differ.) Riemnn is the Mnn! (But Lebesgue my besgue to differ.) Leo Livshits My 2, 2008 1 For finite intervls in R We hve seen in clss tht every continuous function f : [, b] R hs the property tht for every ɛ >

More information

Data Mining Models and Evaluation Techniques

Data Mining Models and Evaluation Techniques Dt Mining Models nd Evlution Techniques Shuhm Pchori 12BCE55 DEPARTMENT OF COMPUTER ENGINEERING AHMEDABAD -382424 Novemer 214 Dt Mining Models And Evlution Techniques Seminr Sumitted in prtil fulfillment

More information

Stein-Rule Estimation and Generalized Shrinkage Methods for Forecasting Using Many Predictors

Stein-Rule Estimation and Generalized Shrinkage Methods for Forecasting Using Many Predictors Stein-Rule Estimtion nd Generlized Shrinkge Methods for Forecsting Using Mny Predictors Eric Hillebrnd CREATES Arhus University, Denmrk ehillebrnd@cretes.u.dk Te-Hwy Lee University of Cliforni, Riverside

More information

Section 11.5 Estimation of difference of two proportions

Section 11.5 Estimation of difference of two proportions ection.5 Estimtion of difference of two proportions As seen in estimtion of difference of two mens for nonnorml popultion bsed on lrge smple sizes, one cn use CLT in the pproximtion of the distribution

More information

How do we solve these things, especially when they get complicated? How do we know when a system has a solution, and when is it unique?

How do we solve these things, especially when they get complicated? How do we know when a system has a solution, and when is it unique? XII. LINEAR ALGEBRA: SOLVING SYSTEMS OF EQUATIONS Tody we re going to tlk bout solving systems of liner equtions. These re problems tht give couple of equtions with couple of unknowns, like: 6 2 3 7 4

More information

5.1 How do we Measure Distance Traveled given Velocity? Student Notes

5.1 How do we Measure Distance Traveled given Velocity? Student Notes . How do we Mesure Distnce Trveled given Velocity? Student Notes EX ) The tle contins velocities of moving cr in ft/sec for time t in seconds: time (sec) 3 velocity (ft/sec) 3 A) Lel the x-xis & y-xis

More information

7.2 Riemann Integrable Functions

7.2 Riemann Integrable Functions 7.2 Riemnn Integrble Functions Theorem 1. If f : [, b] R is step function, then f R[, b]. Theorem 2. If f : [, b] R is continuous on [, b], then f R[, b]. Theorem 3. If f : [, b] R is bounded nd continuous

More information

Behavior-based Authentication Systems. Multimedia Security

Behavior-based Authentication Systems. Multimedia Security Behvior-bsed Authentiction Systems Multimedi Security Prt 1: User Authentiction Through Typing Biometrics Fetures Prt 2: User Re-Authentiction vi Mouse Movements 2 User Authentiction Through Typing Biometrics

More information

Section 6: Area, Volume, and Average Value

Section 6: Area, Volume, and Average Value Chpter The Integrl Applied Clculus Section 6: Are, Volume, nd Averge Vlue Are We hve lredy used integrls to find the re etween the grph of function nd the horizontl xis. Integrls cn lso e used to find

More information

8 Laplace s Method and Local Limit Theorems

8 Laplace s Method and Local Limit Theorems 8 Lplce s Method nd Locl Limit Theorems 8. Fourier Anlysis in Higher DImensions Most of the theorems of Fourier nlysis tht we hve proved hve nturl generliztions to higher dimensions, nd these cn be proved

More information

1 Online Learning and Regret Minimization

1 Online Learning and Regret Minimization 2.997 Decision-Mking in Lrge-Scle Systems My 10 MIT, Spring 2004 Hndout #29 Lecture Note 24 1 Online Lerning nd Regret Minimiztion In this lecture, we consider the problem of sequentil decision mking in

More information

Hybrid Group Acceptance Sampling Plan Based on Size Biased Lomax Model

Hybrid Group Acceptance Sampling Plan Based on Size Biased Lomax Model Mthemtics nd Sttistics 2(3): 137-141, 2014 DOI: 10.13189/ms.2014.020305 http://www.hrpub.org Hybrid Group Acceptnce Smpling Pln Bsed on Size Bised Lomx Model R. Subb Ro 1,*, A. Ng Durgmmb 2, R.R.L. Kntm

More information

= x x 2 = 25 2

= x x 2 = 25 2 9.1 Wrm Up Solve the eqution. 1. 4 2 + 3 2 = x 2 2. 13 2 + x 2 = 25 2 3. 3 2 2 + x 2 = 5 2 2 4. 5 2 + x 2 = 12 2 Mrh 7, 2016 Geometry 9.1 The Pythgoren Theorem 1 Geometry 9.1 The Pythgoren Theorem 9.1

More information

Lecture INF4350 October 12008

Lecture INF4350 October 12008 Biosttistics ti ti Lecture INF4350 October 12008 Anj Bråthen Kristoffersen Biomedicl Reserch Group Deprtment of informtics, UiO Gol Presenttion of dt descriptive tbles nd grphs Sensitivity, specificity,

More information

Jack Simons, Henry Eyring Scientist and Professor Chemistry Department University of Utah

Jack Simons, Henry Eyring Scientist and Professor Chemistry Department University of Utah 1. Born-Oppenheimer pprox.- energy surfces 2. Men-field (Hrtree-Fock) theory- orbitls 3. Pros nd cons of HF- RHF, UHF 4. Beyond HF- why? 5. First, one usully does HF-how? 6. Bsis sets nd nottions 7. MPn,

More information

Probabilistic Investigation of Sensitivities of Advanced Test- Analysis Model Correlation Methods

Probabilistic Investigation of Sensitivities of Advanced Test- Analysis Model Correlation Methods Probbilistic Investigtion of Sensitivities of Advnced Test- Anlysis Model Correltion Methods Liz Bergmn, Mtthew S. Allen, nd Dniel C. Kmmer Dept. of Engineering Physics University of Wisconsin-Mdison Rndll

More information

Best Approximation in the 2-norm

Best Approximation in the 2-norm Jim Lmbers MAT 77 Fll Semester 1-11 Lecture 1 Notes These notes correspond to Sections 9. nd 9.3 in the text. Best Approximtion in the -norm Suppose tht we wish to obtin function f n (x) tht is liner combintion

More information

Discrete Mathematics and Probability Theory Spring 2013 Anant Sahai Lecture 17

Discrete Mathematics and Probability Theory Spring 2013 Anant Sahai Lecture 17 EECS 70 Discrete Mthemtics nd Proility Theory Spring 2013 Annt Shi Lecture 17 I.I.D. Rndom Vriles Estimting the is of coin Question: We wnt to estimte the proportion p of Democrts in the US popultion,

More information

u( t) + K 2 ( ) = 1 t > 0 Analyzing Damped Oscillations Problem (Meador, example 2-18, pp 44-48): Determine the equation of the following graph.

u( t) + K 2 ( ) = 1 t > 0 Analyzing Damped Oscillations Problem (Meador, example 2-18, pp 44-48): Determine the equation of the following graph. nlyzing Dmped Oscilltions Prolem (Medor, exmple 2-18, pp 44-48): Determine the eqution of the following grph. The eqution is ssumed to e of the following form f ( t) = K 1 u( t) + K 2 e!"t sin (#t + $

More information

Math 426: Probability Final Exam Practice

Math 426: Probability Final Exam Practice Mth 46: Probbility Finl Exm Prctice. Computtionl problems 4. Let T k (n) denote the number of prtitions of the set {,..., n} into k nonempty subsets, where k n. Argue tht T k (n) kt k (n ) + T k (n ) by

More information

Fast Frequent Free Tree Mining in Graph Databases

Fast Frequent Free Tree Mining in Graph Databases The Chinese University of Hong Kong Fst Frequent Free Tree Mining in Grph Dtses Peixing Zho Jeffrey Xu Yu The Chinese University of Hong Kong Decemer 18 th, 2006 ICDM Workshop MCD06 Synopsis Introduction

More information

Normal Distribution. Lecture 6: More Binomial Distribution. Properties of the Unit Normal Distribution. Unit Normal Distribution

Normal Distribution. Lecture 6: More Binomial Distribution. Properties of the Unit Normal Distribution. Unit Normal Distribution Norml Distribution Lecture 6: More Binomil Distribution If X is rndom vrible with norml distribution with men µ nd vrince σ 2, X N (µ, σ 2, then P(X = x = f (x = 1 e 1 (x µ 2 2 σ 2 σ Sttistics 104 Colin

More information

4.5 JACOBI ITERATION FOR FINDING EIGENVALUES OF A REAL SYMMETRIC MATRIX. be a real symmetric matrix. ; (where we choose θ π for.

4.5 JACOBI ITERATION FOR FINDING EIGENVALUES OF A REAL SYMMETRIC MATRIX. be a real symmetric matrix. ; (where we choose θ π for. 4.5 JACOBI ITERATION FOR FINDING EIGENVALUES OF A REAL SYMMETRIC MATRIX Some reliminries: Let A be rel symmetric mtrix. Let Cos θ ; (where we choose θ π for Cos θ 4 purposes of convergence of the scheme)

More information

Designing Information Devices and Systems I Discussion 8B

Designing Information Devices and Systems I Discussion 8B Lst Updted: 2018-10-17 19:40 1 EECS 16A Fll 2018 Designing Informtion Devices nd Systems I Discussion 8B 1. Why Bother With Thévenin Anywy? () Find Thévenin eqiuvlent for the circuit shown elow. 2kΩ 5V

More information

Lecture 1: Introduction to integration theory and bounded variation

Lecture 1: Introduction to integration theory and bounded variation Lecture 1: Introduction to integrtion theory nd bounded vrition Wht is this course bout? Integrtion theory. The first question you might hve is why there is nything you need to lern bout integrtion. You

More information

5: The Definite Integral

5: The Definite Integral 5: The Definite Integrl 5.: Estimting with Finite Sums Consider moving oject its velocity (meters per second) t ny time (seconds) is given y v t = t+. Cn we use this informtion to determine the distnce

More information

A signalling model of school grades: centralized versus decentralized examinations

A signalling model of school grades: centralized versus decentralized examinations A signlling model of school grdes: centrlized versus decentrlized exmintions Mri De Pol nd Vincenzo Scopp Diprtimento di Economi e Sttistic, Università dell Clbri m.depol@unicl.it; v.scopp@unicl.it 1 The

More information

Math& 152 Section Integration by Parts

Math& 152 Section Integration by Parts Mth& 5 Section 7. - Integrtion by Prts Integrtion by prts is rule tht trnsforms the integrl of the product of two functions into other (idelly simpler) integrls. Recll from Clculus I tht given two differentible

More information

Population bottleneck : dramatic reduction of population size followed by rapid expansion,

Population bottleneck : dramatic reduction of population size followed by rapid expansion, Selection We hve defined nucleotide diversity denoted by π s the proportion of nucleotides tht differ between two rndomly chosen sequences. We hve shown tht E[π] = θ = 4 e µ where µ cn be estimted directly.

More information

Quantum Physics II (8.05) Fall 2013 Assignment 2

Quantum Physics II (8.05) Fall 2013 Assignment 2 Quntum Physics II (8.05) Fll 2013 Assignment 2 Msschusetts Institute of Technology Physics Deprtment Due Fridy September 20, 2013 September 13, 2013 3:00 pm Suggested Reding Continued from lst week: 1.

More information

Motion. Acceleration. Part 2: Constant Acceleration. October Lab Phyiscs. Ms. Levine 1. Acceleration. Acceleration. Units for Acceleration.

Motion. Acceleration. Part 2: Constant Acceleration. October Lab Phyiscs. Ms. Levine 1. Acceleration. Acceleration. Units for Acceleration. Motion ccelertion Prt : Constnt ccelertion ccelertion ccelertion ccelertion is the rte of chnge of elocity. = - o t = Δ Δt ccelertion = = - o t chnge of elocity elpsed time ccelertion is ector, lthough

More information

9.1 Day 1 Warm Up. Solve the equation = x x 2 = March 1, 2017 Geometry 9.1 The Pythagorean Theorem 1

9.1 Day 1 Warm Up. Solve the equation = x x 2 = March 1, 2017 Geometry 9.1 The Pythagorean Theorem 1 9.1 Dy 1 Wrm Up Solve the eqution. 1. 4 2 + 3 2 = x 2 2. 13 2 + x 2 = 25 2 3. 3 2 2 + x 2 = 5 2 2 4. 5 2 + x 2 = 12 2 Mrh 1, 2017 Geometry 9.1 The Pythgoren Theorem 1 9.1 Dy 2 Wrm Up Use the Pythgoren

More information

Jin-Fu Li. Department of Electrical Engineering National Central University Jhongli, Taiwan

Jin-Fu Li. Department of Electrical Engineering National Central University Jhongli, Taiwan Trnsprent BIST for RAMs Jin-Fu Li Advnced d Relible Systems (ARES) Lb. Deprtment of Electricl Engineering Ntionl Centrl University Jhongli, Tiwn Outline Introduction Concept of Trnsprent Test Trnsprent

More information

Monte Carlo method in solving numerical integration and differential equation

Monte Carlo method in solving numerical integration and differential equation Monte Crlo method in solving numericl integrtion nd differentil eqution Ye Jin Chemistry Deprtment Duke University yj66@duke.edu Abstrct: Monte Crlo method is commonly used in rel physics problem. The

More information

( dg. ) 2 dt. + dt. dt j + dh. + dt. r(t) dt. Comparing this equation with the one listed above for the length of see that

( dg. ) 2 dt. + dt. dt j + dh. + dt. r(t) dt. Comparing this equation with the one listed above for the length of see that Arc Length of Curves in Three Dimensionl Spce If the vector function r(t) f(t) i + g(t) j + h(t) k trces out the curve C s t vries, we cn mesure distnces long C using formul nerly identicl to one tht we

More information

A Brief Review on Akkar, Sandikkaya and Bommer (ASB13) GMPE

A Brief Review on Akkar, Sandikkaya and Bommer (ASB13) GMPE Southwestern U.S. Ground Motion Chrcteriztion Senior Seismic Hzrd Anlysis Committee Level 3 Workshop #2 October 22-24, 2013 A Brief Review on Akkr, Sndikky nd Bommer (ASB13 GMPE Sinn Akkr Deprtment of

More information

#6A&B Magnetic Field Mapping

#6A&B Magnetic Field Mapping #6A& Mgnetic Field Mpping Gol y performing this lb experiment, you will: 1. use mgnetic field mesurement technique bsed on Frdy s Lw (see the previous experiment),. study the mgnetic fields generted by

More information

Lecture 14: Quadrature

Lecture 14: Quadrature Lecture 14: Qudrture This lecture is concerned with the evlution of integrls fx)dx 1) over finite intervl [, b] The integrnd fx) is ssumed to be rel-vlues nd smooth The pproximtion of n integrl by numericl

More information

UvA-DARE (Digital Academic Repository) A robust Xbar control chart Schoonhoven, M.; Does, R.J.M.M.

UvA-DARE (Digital Academic Repository) A robust Xbar control chart Schoonhoven, M.; Does, R.J.M.M. UvA-DARE (Digitl Acdemic Repository) A robust Xbr control chrt Schoonhoven, M.; Does, R.J.M.M. Published in: Qulity nd Relibility Engineering Interntionl DOI: 1.12/qre.1447 Link to publiction Cittion for

More information

How do we solve these things, especially when they get complicated? How do we know when a system has a solution, and when is it unique?

How do we solve these things, especially when they get complicated? How do we know when a system has a solution, and when is it unique? XII. LINEAR ALGEBRA: SOLVING SYSTEMS OF EQUATIONS Tody we re going to tlk out solving systems of liner equtions. These re prolems tht give couple of equtions with couple of unknowns, like: 6= x + x 7=

More information

Physics 201 Lab 3: Measurement of Earth s local gravitational field I Data Acquisition and Preliminary Analysis Dr. Timothy C. Black Summer I, 2018

Physics 201 Lab 3: Measurement of Earth s local gravitational field I Data Acquisition and Preliminary Analysis Dr. Timothy C. Black Summer I, 2018 Physics 201 Lb 3: Mesurement of Erth s locl grvittionl field I Dt Acquisition nd Preliminry Anlysis Dr. Timothy C. Blck Summer I, 2018 Theoreticl Discussion Grvity is one of the four known fundmentl forces.

More information

A Signal-Level Fusion Model for Image-Based Change Detection in DARPA's Dynamic Database System

A Signal-Level Fusion Model for Image-Based Change Detection in DARPA's Dynamic Database System SPIE Aerosense 001 Conference on Signl Processing, Sensor Fusion, nd Trget Recognition X, April 16-0, Orlndo FL. (Minor errors in published version corrected.) A Signl-Level Fusion Model for Imge-Bsed

More information

Sufficient condition on noise correlations for scalable quantum computing

Sufficient condition on noise correlations for scalable quantum computing Sufficient condition on noise correltions for sclble quntum computing John Presill, 2 Februry 202 Is quntum computing sclble? The ccurcy threshold theorem for quntum computtion estblishes tht sclbility

More information

DATA Search I 魏忠钰. 复旦大学大数据学院 School of Data Science, Fudan University. March 7 th, 2018

DATA Search I 魏忠钰. 复旦大学大数据学院 School of Data Science, Fudan University. March 7 th, 2018 DATA620006 魏忠钰 Serch I Mrch 7 th, 2018 Outline Serch Problems Uninformed Serch Depth-First Serch Bredth-First Serch Uniform-Cost Serch Rel world tsk - Pc-mn Serch problems A serch problem consists of:

More information

Advanced Calculus: MATH 410 Notes on Integrals and Integrability Professor David Levermore 17 October 2004

Advanced Calculus: MATH 410 Notes on Integrals and Integrability Professor David Levermore 17 October 2004 Advnced Clculus: MATH 410 Notes on Integrls nd Integrbility Professor Dvid Levermore 17 October 2004 1. Definite Integrls In this section we revisit the definite integrl tht you were introduced to when

More information

Online Short Term Load Forecasting by Fuzzy ARTMAP Neural Network

Online Short Term Load Forecasting by Fuzzy ARTMAP Neural Network Online Short Term Lod Forecsting by Fuzzy ARTMAP Neurl Network SHAHRAM JAVADI Electricl Engineering Deprtment AZAD University Tehrn Centrl Brnch Moshnir Power Electric Compny IRAN Abstrct: This pper presents

More information

Reinforcement Learning

Reinforcement Learning Reinforcement Lerning Tom Mitchell, Mchine Lerning, chpter 13 Outline Introduction Comprison with inductive lerning Mrkov Decision Processes: the model Optiml policy: The tsk Q Lerning: Q function Algorithm

More information

SEMIPARAMETRIC INFERENTIAL PROCEDURES FOR COMPARING MULTIVARIATE ROC CURVES WITH INTERACTION TERMS

SEMIPARAMETRIC INFERENTIAL PROCEDURES FOR COMPARING MULTIVARIATE ROC CURVES WITH INTERACTION TERMS Sttistic Sinic 19 2009), 1203-1221 SEMIPARAMETRIC INFERENTIAL PROCEDURES FOR COMPARING MULTIVARIATE ROC CURVES WITH INTERACTION TERMS Linsheng Tng 1 nd Xio-Hu Zhou 2,3 1 George Mson University, 2 VA Puget

More information

Discrete Mathematics and Probability Theory Summer 2014 James Cook Note 17

Discrete Mathematics and Probability Theory Summer 2014 James Cook Note 17 CS 70 Discrete Mthemtics nd Proility Theory Summer 2014 Jmes Cook Note 17 I.I.D. Rndom Vriles Estimting the is of coin Question: We wnt to estimte the proportion p of Democrts in the US popultion, y tking

More information

p-adic Egyptian Fractions

p-adic Egyptian Fractions p-adic Egyptin Frctions Contents 1 Introduction 1 2 Trditionl Egyptin Frctions nd Greedy Algorithm 2 3 Set-up 3 4 p-greedy Algorithm 5 5 p-egyptin Trditionl 10 6 Conclusion 1 Introduction An Egyptin frction

More information

Operations with Polynomials

Operations with Polynomials 38 Chpter P Prerequisites P.4 Opertions with Polynomils Wht you should lern: How to identify the leding coefficients nd degrees of polynomils How to dd nd subtrct polynomils How to multiply polynomils

More information

Bayesian Networks: Approximate Inference

Bayesian Networks: Approximate Inference pproches to inference yesin Networks: pproximte Inference xct inference Vrillimintion Join tree lgorithm pproximte inference Simplify the structure of the network to mkxct inferencfficient (vritionl methods,

More information

Non-Linear & Logistic Regression

Non-Linear & Logistic Regression Non-Liner & Logistic Regression If the sttistics re boring, then you've got the wrong numbers. Edwrd R. Tufte (Sttistics Professor, Yle University) Regression Anlyses When do we use these? PART 1: find

More information

Chapter 3 Solving Nonlinear Equations

Chapter 3 Solving Nonlinear Equations Chpter 3 Solving Nonliner Equtions 3.1 Introduction The nonliner function of unknown vrible x is in the form of where n could be non-integer. Root is the numericl vlue of x tht stisfies f ( x) 0. Grphiclly,

More information

Goals: Determine how to calculate the area described by a function. Define the definite integral. Explore the relationship between the definite

Goals: Determine how to calculate the area described by a function. Define the definite integral. Explore the relationship between the definite Unit #8 : The Integrl Gols: Determine how to clculte the re described by function. Define the definite integrl. Eplore the reltionship between the definite integrl nd re. Eplore wys to estimte the definite

More information

Detection and Estimation Theory

Detection and Estimation Theory ESE 54 Detection nd Estimtion heory Joseph A. O Sullivn Smuel C. Schs Professor Electronic Systems nd Signls Reserch Lbortory Electricl nd Systems Engineering Wshington University Urbuer Hll 34-935-473

More information

Math 113 Fall Final Exam Review. 2. Applications of Integration Chapter 6 including sections and section 6.8

Math 113 Fall Final Exam Review. 2. Applications of Integration Chapter 6 including sections and section 6.8 Mth 3 Fll 0 The scope of the finl exm will include: Finl Exm Review. Integrls Chpter 5 including sections 5. 5.7, 5.0. Applictions of Integrtion Chpter 6 including sections 6. 6.5 nd section 6.8 3. Infinite

More information

Math 61CM - Solutions to homework 9

Math 61CM - Solutions to homework 9 Mth 61CM - Solutions to homework 9 Cédric De Groote November 30 th, 2018 Problem 1: Recll tht the left limit of function f t point c is defined s follows: lim f(x) = l x c if for ny > 0 there exists δ

More information

Chapter 9: Inferences based on Two samples: Confidence intervals and tests of hypotheses

Chapter 9: Inferences based on Two samples: Confidence intervals and tests of hypotheses Chpter 9: Inferences bsed on Two smples: Confidence intervls nd tests of hypotheses 9.1 The trget prmeter : difference between two popultion mens : difference between two popultion proportions : rtio of

More information

Recitation 3: More Applications of the Derivative

Recitation 3: More Applications of the Derivative Mth 1c TA: Pdric Brtlett Recittion 3: More Applictions of the Derivtive Week 3 Cltech 2012 1 Rndom Question Question 1 A grph consists of the following: A set V of vertices. A set E of edges where ech

More information

Multiscale Fourier Descriptor for Shape Classification

Multiscale Fourier Descriptor for Shape Classification Multiscle Fourier Descriptor for Shpe Clssifiction Iivri Kunttu, een epistö, Juhni Ruhm 2, nd Ari Vis Tmpere University of Technology Institute of Signl Processing P. O. Box 553, FI-330 Tmpere, Finlnd

More information

Fig. 1. Open-Loop and Closed-Loop Systems with Plant Variations

Fig. 1. Open-Loop and Closed-Loop Systems with Plant Variations ME 3600 Control ystems Chrcteristics of Open-Loop nd Closed-Loop ystems Importnt Control ystem Chrcteristics o ensitivity of system response to prmetric vritions cn be reduced o rnsient nd stedy-stte responses

More information

LUMS School of Science and Engineering

LUMS School of Science and Engineering LUMS School of Science nd Engineering PH- Solution of ssignment Mrch, 0, 0 Brvis Lttice Answer: We hve given tht c.5(î + ĵ + ˆk) 5 (î + ĵ + ˆk) 0 (î + ĵ + ˆk) c (î + ĵ + ˆk) î + ĵ + ˆk + b + c î, b ĵ nd

More information

1 Error Analysis of Simple Rules for Numerical Integration

1 Error Analysis of Simple Rules for Numerical Integration cs41: introduction to numericl nlysis 11/16/10 Lecture 19: Numericl Integrtion II Instructor: Professor Amos Ron Scries: Mrk Cowlishw, Nthnel Fillmore 1 Error Anlysis of Simple Rules for Numericl Integrtion

More information

Geometric Sequences. Geometric Sequence a sequence whose consecutive terms have a common ratio.

Geometric Sequences. Geometric Sequence a sequence whose consecutive terms have a common ratio. Geometric Sequences Geometric Sequence sequence whose consecutive terms hve common rtio. Geometric Sequence A sequence is geometric if the rtios of consecutive terms re the sme. 2 3 4... 2 3 The number

More information

Predict Global Earth Temperature using Linier Regression

Predict Global Earth Temperature using Linier Regression Predict Globl Erth Temperture using Linier Regression Edwin Swndi Sijbt (23516012) Progrm Studi Mgister Informtik Sekolh Teknik Elektro dn Informtik ITB Jl. Gnesh 10 Bndung 40132, Indonesi 23516012@std.stei.itb.c.id

More information

Synoptic Meteorology I: Finite Differences September Partial Derivatives (or, Why Do We Care About Finite Differences?

Synoptic Meteorology I: Finite Differences September Partial Derivatives (or, Why Do We Care About Finite Differences? Synoptic Meteorology I: Finite Differences 16-18 September 2014 Prtil Derivtives (or, Why Do We Cre About Finite Differences?) With the exception of the idel gs lw, the equtions tht govern the evolution

More information

Math 520 Final Exam Topic Outline Sections 1 3 (Xiao/Dumas/Liaw) Spring 2008

Math 520 Final Exam Topic Outline Sections 1 3 (Xiao/Dumas/Liaw) Spring 2008 Mth 520 Finl Exm Topic Outline Sections 1 3 (Xio/Dums/Liw) Spring 2008 The finl exm will be held on Tuesdy, My 13, 2-5pm in 117 McMilln Wht will be covered The finl exm will cover the mteril from ll of

More information

The graphs of Rational Functions

The graphs of Rational Functions Lecture 4 5A: The its of Rtionl Functions s x nd s x + The grphs of Rtionl Functions The grphs of rtionl functions hve severl differences compred to power functions. One of the differences is the behvior

More information

different methods (left endpoint, right endpoint, midpoint, trapezoid, Simpson s).

different methods (left endpoint, right endpoint, midpoint, trapezoid, Simpson s). Mth 1A with Professor Stnkov Worksheet, Discussion #41; Wednesdy, 12/6/217 GSI nme: Roy Zho Problems 1. Write the integrl 3 dx s limit of Riemnn sums. Write it using 2 intervls using the 1 x different

More information

{ } = E! & $ " k r t +k +1

{ } = E! & $  k r t +k +1 Chpter 4: Dynmic Progrmming Objectives of this chpter: Overview of collection of clssicl solution methods for MDPs known s dynmic progrmming (DP) Show how DP cn be used to compute vlue functions, nd hence,

More information

ADVANCEMENT OF THE CLOSELY COUPLED PROBES POTENTIAL DROP TECHNIQUE FOR NDE OF SURFACE CRACKS

ADVANCEMENT OF THE CLOSELY COUPLED PROBES POTENTIAL DROP TECHNIQUE FOR NDE OF SURFACE CRACKS ADVANCEMENT OF THE CLOSELY COUPLED PROBES POTENTIAL DROP TECHNIQUE FOR NDE OF SURFACE CRACKS F. Tkeo 1 nd M. Sk 1 Hchinohe Ntionl College of Technology, Hchinohe, Jpn; Tohoku University, Sendi, Jpn Abstrct:

More information

We partition C into n small arcs by forming a partition of [a, b] by picking s i as follows: a = s 0 < s 1 < < s n = b.

We partition C into n small arcs by forming a partition of [a, b] by picking s i as follows: a = s 0 < s 1 < < s n = b. Mth 255 - Vector lculus II Notes 4.2 Pth nd Line Integrls We begin with discussion of pth integrls (the book clls them sclr line integrls). We will do this for function of two vribles, but these ides cn

More information

Chapter 4: Dynamic Programming

Chapter 4: Dynamic Programming Chpter 4: Dynmic Progrmming Objectives of this chpter: Overview of collection of clssicl solution methods for MDPs known s dynmic progrmming (DP) Show how DP cn be used to compute vlue functions, nd hence,

More information

Results of quality assessment tasks of the optical -electronic complex using complex instrumentation background and astroclimatic conditions

Results of quality assessment tasks of the optical -electronic complex using complex instrumentation background and astroclimatic conditions Results of qulity ssessment tsks of the opticl -electronic complex using complex instrumenttion bckground nd stroclimtic conditions Chirov D.S., Grigoroshenko V.M. Abstrct The report presents the results

More information

First Midterm Examination

First Midterm Examination Çnky University Deprtment of Computer Engineering 203-204 Fll Semester First Midterm Exmintion ) Design DFA for ll strings over the lphet Σ = {,, c} in which there is no, no nd no cc. 2) Wht lnguge does

More information

Chapter 7 Notes, Stewart 8e. 7.1 Integration by Parts Trigonometric Integrals Evaluating sin m x cos n (x) dx...

Chapter 7 Notes, Stewart 8e. 7.1 Integration by Parts Trigonometric Integrals Evaluating sin m x cos n (x) dx... Contents 7.1 Integrtion by Prts................................... 2 7.2 Trigonometric Integrls.................................. 8 7.2.1 Evluting sin m x cos n (x)......................... 8 7.2.2 Evluting

More information

3.4 Numerical integration

3.4 Numerical integration 3.4. Numericl integrtion 63 3.4 Numericl integrtion In mny economic pplictions it is necessry to compute the definite integrl of relvlued function f with respect to "weight" function w over n intervl [,

More information

Temporally-Biased Sampling for Online Model Management

Temporally-Biased Sampling for Online Model Management Temporlly-Bised Smpling for Online Model Mngement Brin Hentschel Hrvrd University bhentschel@g.hrvrd.edu Peter J. Hs* University of Msschusetts phs@cs.umss.edu Yunyun Tin IBM Reserch Almden ytin@us.ibm.com

More information

Chapter Direct Method of Interpolation More Examples Civil Engineering

Chapter Direct Method of Interpolation More Examples Civil Engineering Chpter 5. Direct Method of Interpoltion More Exmples Civil Engineering Exmple o mximie ctch of bss in lke, it is suggested to throw the line to the depth of the thermocline. he chrcteristic feture of this

More information

CBE 291b - Computation And Optimization For Engineers

CBE 291b - Computation And Optimization For Engineers The University of Western Ontrio Fculty of Engineering Science Deprtment of Chemicl nd Biochemicl Engineering CBE 9b - Computtion And Optimiztion For Engineers Mtlb Project Introduction Prof. A. Jutn Jn

More information

APPROXIMATE INTEGRATION

APPROXIMATE INTEGRATION APPROXIMATE INTEGRATION. Introduction We hve seen tht there re functions whose nti-derivtives cnnot be expressed in closed form. For these resons ny definite integrl involving these integrnds cnnot be

More information

A Robust Feature-Based Digital Image Watermarking Scheme

A Robust Feature-Based Digital Image Watermarking Scheme Chpter 6 A Robust Feture-Bsed Digitl Imge Wtermrking Scheme 6.1 Introduction Attcks hve been developed to destroy wtermrks. These ttcks on wtermrks cn roughly be clssified s geometric distortions nd noise-like

More information

Lecture 21: Order statistics

Lecture 21: Order statistics Lecture : Order sttistics Suppose we hve N mesurements of sclr, x i =, N Tke ll mesurements nd sort them into scending order x x x 3 x N Define the mesured running integrl S N (x) = 0 for x < x = i/n for

More information

Vyacheslav Telnin. Search for New Numbers.

Vyacheslav Telnin. Search for New Numbers. Vycheslv Telnin Serch for New Numbers. 1 CHAPTER I 2 I.1 Introduction. In 1984, in the first issue for tht yer of the Science nd Life mgzine, I red the rticle "Non-Stndrd Anlysis" by V. Uspensky, in which

More information

Chapters 4 & 5 Integrals & Applications

Chapters 4 & 5 Integrals & Applications Contents Chpters 4 & 5 Integrls & Applictions Motivtion to Chpters 4 & 5 2 Chpter 4 3 Ares nd Distnces 3. VIDEO - Ares Under Functions............................................ 3.2 VIDEO - Applictions

More information

The Regulated and Riemann Integrals

The Regulated and Riemann Integrals Chpter 1 The Regulted nd Riemnn Integrls 1.1 Introduction We will consider severl different pproches to defining the definite integrl f(x) dx of function f(x). These definitions will ll ssign the sme vlue

More information

MAT 772: Numerical Analysis. James V. Lambers

MAT 772: Numerical Analysis. James V. Lambers MAT 772: Numericl Anlysis Jmes V. Lmbers August 23, 2016 2 Contents 1 Solution of Equtions by Itertion 7 1.1 Nonliner Equtions....................... 7 1.1.1 Existence nd Uniqueness................ 7 1.1.2

More information

LECTURE NOTE #12 PROF. ALAN YUILLE

LECTURE NOTE #12 PROF. ALAN YUILLE LECTURE NOTE #12 PROF. ALAN YUILLE 1. Clustering, K-mens, nd EM Tsk: set of unlbeled dt D = {x 1,..., x n } Decompose into clsses w 1,..., w M where M is unknown. Lern clss models p(x w)) Discovery of

More information

SUMMER KNOWHOW STUDY AND LEARNING CENTRE

SUMMER KNOWHOW STUDY AND LEARNING CENTRE SUMMER KNOWHOW STUDY AND LEARNING CENTRE Indices & Logrithms 2 Contents Indices.2 Frctionl Indices.4 Logrithms 6 Exponentil equtions. Simplifying Surds 13 Opertions on Surds..16 Scientific Nottion..18

More information

N 0 completions on partial matrices

N 0 completions on partial matrices N 0 completions on prtil mtrices C. Jordán C. Mendes Arújo Jun R. Torregros Instituto de Mtemátic Multidisciplinr / Centro de Mtemátic Universidd Politécnic de Vlenci / Universidde do Minho Cmino de Ver

More information

1 The Riemann Integral

1 The Riemann Integral The Riemnn Integrl. An exmple leding to the notion of integrl (res) We know how to find (i.e. define) the re of rectngle (bse height), tringle ( (sum of res of tringles). But how do we find/define n re

More information

Definition of Continuity: The function f(x) is continuous at x = a if f(a) exists and lim

Definition of Continuity: The function f(x) is continuous at x = a if f(a) exists and lim Mth 9 Course Summry/Study Guide Fll, 2005 [1] Limits Definition of Limit: We sy tht L is the limit of f(x) s x pproches if f(x) gets closer nd closer to L s x gets closer nd closer to. We write lim f(x)

More information

A-Level Mathematics Transition Task (compulsory for all maths students and all further maths student)

A-Level Mathematics Transition Task (compulsory for all maths students and all further maths student) A-Level Mthemtics Trnsition Tsk (compulsory for ll mths students nd ll further mths student) Due: st Lesson of the yer. Length: - hours work (depending on prior knowledge) This trnsition tsk provides revision

More information