Designing a learning system
|
|
- Ross Jacob McGee
- 5 years ago
- Views:
Transcription
1 CS 75 Itro to Machie Learig Lecture Desigig a learig system Milos Hauskrecht milos@pitt.edu 539 Seott Square, -5 people.cs.pitt.edu/~milos/courses/cs75/ Admiistrivia No homework assigmet this week Please try to obtai a copy of Matlab: Net week: Recitatios: Matlab tutorial Tuesday: Review of algebra ad probability
2 Learig: first look Assume we see eamples of pairs (, y) i D ad we wat to lear the mappig f : X Y to predict y for some future We get the data D - what should we do? y Learig: first look Problem: may possible fuctios f : X Y eists for represetig the mappig betwee ad y Which oe to choose? May eamples still usee! y
3 Learig: first look Solutio: make a assumptio about the model, say, f ( ) a b y Learig: first look Choosig a parametric model or a set of models is ot eough Still too may fuctios f ( ) a b Oe for every pair of parameters b y
4 Learig: first look We wat the best set of model parameters reduce the misfit betwee the model M ad observed data D Or, (i other words) eplai the data the best How to measure the misfit? y Learig: first look We wat the best set of model parameters reduce the misfit betwee the model M ad observed data D Or, (i other words) eplai the data the best How to measure the misfit? y - The differece i the observed value of y ad model predictio
5 Learig: first look We wat the best set of model parameters reduce the misfit betwee the model M ad observed data D Or, (i other words) eplai the data the best How to measure the misfit? y Learig: first look We wat the best set of model parameters reduce the misfit betwee the model M ad observed data D Or, (i other words) eplai the data the best How to measure the misfit? Objective fuctio: Error (loss) fuctio: Measures the misfit betwee D ad M Eamples of error fuctios: Average Square Error Average Absolute Error i i ( y y i i f ( )) i i f ( ) 5
6 Learig: first look Liear regressio Miimizes the squared error fuctio for the liear model ( yi f ( i )) i y Learig: first look. Data: D { d, d,.., d}. Model selectio: Select a model or a set of models (with parameters) E.g. y a b 3. Choose the objective (error) fuctio Squared error Error( D, ( yi ai ) i. Learig: Fid the set of parameters ( optimizig the error fuctio * * a, b ) arg ma Error( D, ( ( 5. Applicatio Apply the leared model to ew data E.g. predict ys for the ew iput f * * ( ) a b
7 Learig: first look. Data: D { d, d,.., d}. Model selectio: Select a model or a set of models (with parameters) E.g. y 3. Choose the objective (error) fuctio Squared error Error( D, ( yi ai ) i -. Learig: - Fid the set of parameters ( optimizig the error - fuctio - * * ( a, b ) - arg ma ( Error( D, y a b Applicatio Apply the leared model to ew data E.g. predict ys for the ew iput f * * ( ) a b Learig: first look. Data: D { d, d,.., d}. Model selectio: Select a model or a set of models (with parameters) E.g. y a b 3. Choose the objective (error) fuctio Squared error y Error( D, ( yi ai ) i. Learig: Fid the set of parameters ( optimizig the error fuctio * * a, b ) -arg ma Error( D, ( ( - 5. Applicatio - Apply the leared - model to ew data E.g. predict ys for the ew iput f * * ( ) a b
8 Learig: first look. Data: D { d, d,.., d}. Model selectio: Select a model or a set of models (with parameters) E.g. 3. Choose the objective (error) fuctio Squared error Error( D, ( yi ai ) i. Learig: Fid the set of parameters ( optimizig the error fuctio * * a, b ) arg ma Error( D, y a b ( ( 5. Applicatio - - Apply the leared model to ew data - - E.g. predict ys for the ew iput - f * * ( ) a b Learig: first look. Data: D { d, d,.., d}. Model selectio: Select a modelor a set of models (with parameters) - - E.g. y a b Choose the objective (error) fuctio - Squared error Error( D, ( yi ai ) i. Learig: Fid the set of parameters ( optimizig the error fuctio * * a, b ) arg ma Error( D, ( ( 5. Applicatio Apply the leared model to ew data E.g. predict ys for the ew iput f * * ( ) a b
9 Learig: first look. Data: D { d, d,.., d}. Model selectio: Select a model or a set of models (with parameters) E.g. 3. Choose the objective (error) fuctio Squared error Error( D, ( yi ai ) i. Learig: - - Fid the set of parameters - ( optimizig the error - fuctio * * a, b ) arg ma Error( D,.5 y a b ( ( 5. Applicatio Apply the leared model to ew data E.g. predict ys for the ew iput f * * ( ) a b Learig: first look. Data: D { d, d,.., d}. Model selectio: Select a model or a set of models (with parameters) E.g. y a b 3. Choose the objective (error) fuctio Squared error Error( D, ( yi ai ) i. Learig: Fid the set of parameters ( optimizig the error fuctio * * ( a, b ) arg ma ( Error( D, 5. Applicatio * Apply the leared model to ew data f ( ) a b Looks straightforward, but there are problems. * 9
10 Learig: geeralizatio error We fit the model based o past eamples observed i D Traiig data: Data used to fit the parameters of the model Traiig error: Error( D, ( yi f ( i )) Problem: Ultimately we are iterested i learig the mappig that performs well o the whole populatio of eamples i True (geeralizatio) error (over the whole populatio): Error( E [( y f ( (, y) )) ] Mea squared error Traiig error tries to approimate the true error!!!! Does a good traiig error imply a good geeralizatio error? Traiig vs Geeralizatio error Assume we have a set of poits ad we cosider polyomial fuctios as our possible models
11 Traiig vs Geeralizatio error Fittig a liear fuctio with the square error Error is ozero Traiig vs Geeralizatio error Liear vs. cubic polyomial
12 Traiig vs Geeralizatio error Liear vs. cubic polyomial Higher order polyomial leads to a better fit, smaller error Traiig vs Geeralizatio error Is it always good to miimize the error of the observed data? Remember: our goal is to optimize future errors CS 75 Machie Learig
13 Traiig vs Geeralizatio error For data poits, the degree 9 polyomial gives a perfect fit (Lagrage iterpolatio). Error is zero. Is it always good to miimize the traiig error? CS 75 Machie Learig Overfittig For data poits, degree 9 polyomial gives a perfect fit (Lagrage iterpolatio). Error is zero. Is it always good to miimize the traiig error? NO!! More importat: How do we perform o the usee data? CS 75 Machie Learig 3
14 Overfittig Situatio whe the traiig error is low ad the geeralizatio error is high. Causes of the pheomeo: Model with a large umber of parameters (degrees of freedom) Small data size (as compared to the compleity of the model) CS 75 Machie Learig How to evaluate the learer s performace? Geeralizatio error is the true error for the populatio of eamples we would like to optimize E(, y )[( y f ( )) ] But it caot be computed eactly Sample mea oly approimates the true mea Optimizig the traiig error ca lead to the overfit, i.e. traiig error may ot reflect properly the geeralizatio error i,.. ( y So how to test the geeralizatio error? i f ( )) i
15 How to evaluate the learer s performace? Geeralizatio error is the true error for the populatio of eamples we would like to optimize Sample mea oly approimates it Two ways to assess the geeralizatio error is: Theoretical: Law of Large umbers statistical bouds o the differece betwee true geeralizatio ad sample mea errors Practical: Use a separate data set with m data samples to test the model (Average) test error Error( Dtest, f ) ( y j f ( j )) m j,.. m Evaluatio of the geeralizatio performace Split available data D ito two disjoit sets: traiig set D trai testig set D test Dataset Traiig set Testig set Optimize trai error Lear (fit) Also called: Simple holdout method Typically /3 traiig ad /3 testig Predictive model Evaluate Calculate test error 5
16 Assessmet of model performace Assessmet of the geeralizatio performace of the model: Basic rule: Never ever touch the test data durig the learig/model buildig process Test data should be used for the fial evaluatio oly Testig of models: regressio Data set Traiig set Test set Lear o the traiig set The model Evaluate o the test set
17 Testig of models: classificatio Data set Traiig set Test set case cotrol case cotrol Lear o the traiig set The model Evaluate o the test set Evaluatio measures Easiest way to evaluate the model: Error fuctio used i the optimizatio is adopted also i the evaluatio Advatage: may help us to see model overfittig. Simply compare the error o the traiig ad testig data. Evaluatio of the models ofte cosiders: Other aspects or statistics of the model ad its performace Moreover the Error fuctio used for the optimizatio may be a coveiet approimatio of the quality measure we would really like to optimize 7
18 Evaluatio measures: classificatio Biary classificatio: Predictio Case Cotrol Case TP.3 FN. Actual Cotrol FP. TN. Misclassificatio error: E FP FN Sesitivity: TP SN TP FN Specificity: TN SP TN FP A learig system: basic cycle. Data: D { d, d,.., d}. Model selectio: Select a model or a set of models (with parameters) E.g. y a b 3. Choose the objective fuctio Squared error ( yi f ( i )) i. Learig: Fid the set of parameters optimizig the error fuctio The model ad parameters with the smallest error 5. Testig/validatio: Evaluate o the test data. Applicatio Apply the leared model to ew data f ()
19 A learig system: basic cycle. Data: D { d, d,.., d}. Model selectio: Select a model or a set of models (with parameters) E.g. 3. Choose the objective fuctio ( yi f ( i )) i - Squared error - -. Learig: Fid the set of parameters optimizig the error fuctio The model ad parameters with the smallest error Testig/validatio: Evaluate o the test data. Applicatio Apply the leared model to ew data f () y a b A learig system: basic cycle. Data: D { d, d,.., d}. Model selectio: Select a model or a set of models (with parameters) E.g. y a b 3. Choose the objective fuctio Squared error ( yi f ( i )) i. Learig: Fid the set of parameters optimizig the error fuctio The model ad parameters with the smallest error 5. Testig/validatio: Evaluate o the test data. Applicatio Apply the leared model to ew data f () CS 75 Machie Learig 9
20 Steps take whe desigig a ML system Data Model selectio Choice of Error fuctio Learig/optimizatio Evaluatio Applicatio Add some compleity Data Data cleaig/preprocessig Feature selectio/dimesioality reductio Model selectio Choice of Error fuctio Learig/optimizatio Evaluatio Applicatio
21 Desigig a ML solutio Data Data cleaig/preprocessig Feature selectio/dimesioality reductio Model selectio Choice of Error fuctio Learig/optimizatio Evaluatio Applicatio Desigig a ML solutio Data Data cleaig/preprocessig Feature selectio/dimesioality reductio Model selectio Choice of Error fuctio Learig/optimizatio Evaluatio Applicatio
22 Data source ad data biases Uderstad the data source Uderstad the data your models will be applied to Watch out for data biases: Make sure the data we make coclusios o are the same as data we used i the aalysis It is very easy to derive uepected results whe data used for aalysis ad learig are biased Results (coclusios) derived for a biased dataset do ot hold i geeral!!! Data biases Eample: Assume you wat to build a ML program for predictig the stock behavior ad for choosig your ivestmet strategy Data etractio: pick compaies that are traded o the stock market o Jauary 7 Go back 3 years ad etract all the data for these compaies Use the data to build a ML model supportig your future ivestmets Questio: Would you trust the model? Are there ay biases i the data? CS 75 Machie Learig
23 Steps take whe desigig a ML system Data Data cleaig/preprocessig Feature selectio/dimesioality reductio Model selectio Choice of Error fuctio Learig/optimizatio Evaluatio Applicatio Data cleaig ad preprocessig Data you receive may ot be perfect: Cleaig Preprocessig (coversios) Cleaig: Get rid of errors, oise, Removal of redudacies Preprocessig: Reamig Rescalig (ormalizatio) Discretizatios Abstractio Aggregatio New attributes CS 75 Machie Learig 3
24 Data preprocessig Reamig (relabelig) categorical values to umbers dagerous i cojuctio with some learig methods umbers will impose a order that is ot warrated Eample: assume the followig ecodig of values High, Normal, Low High Normal Low > implies High > Normal: Is it OK? > implies Normal > Low: Is it OK? > implies High > Low: Is it OK?? Data preprocessig Reamig (relabelig) categorical values to umbers dagerous i cojuctio with some learig methods umbers will impose a order that is ot warrated Eample: assume the followig ecodig of values High, Normal, Low High Normal Low > implies High > Normal: Is it OK? > implies Normal > Low: Is it OK? > implies High > Low: Is it OK?
25 Data preprocessig Reamig (relabelig) categorical values to umbers dagerous i cojuctio with some learig methods umbers will impose a order that is ot warrated High Normal Low True False Ukow? Data preprocessig Reamig (relabelig) categorical values to umbers dagerous i cojuctio with some learig methods umbers will impose a order that is ot warrated High Normal Low True False Ukow Red Blue Gree? 5
26 Data preprocessig Reamig (relabelig) categorical values to umbers dagerous i cojuctio with some learig methods umbers will impose a order that is ot warrated High Normal Low True False Ukow Red Blue Gree Data preprocessig Reamig (relabelig) categorical values to umbers Problem: How to safely represet the differet categories as umbers whe o order eists? Solutio: Use idicator vector (or oe-hot) represetatio. Eample: Red, Blue, Gree colors 3 categories use a vector of size 3 with biary values Ecodig: Red: (,,); Blue: (,,); Gree: (,,)
Designing a learning system
CS 75 Machie Learig Lecture Desigig a learig system Milos Hauskrecht milos@cs.pitt.edu 539 Seott Square, x-5 people.cs.pitt.edu/~milos/courses/cs75/ Admiistrivia No homework assigmet this week Please try
More informationPattern Recognition Systems Lab 1 Least Mean Squares
Patter Recogitio Systems Lab 1 Least Mea Squares 1. Objectives This laboratory work itroduces the OpeCV-based framework used throughout the course. I this assigmet a lie is fitted to a set of poits usig
More informationNumerical Methods Lecture 6 - Curve Fitting Techniques
Numerical Methods Lecture 6 - Curve Fittig Techiques Topics motivatio iterpolatio liear regressio higher order polyomial form expoetial form Curve fittig - motivatio For root fidig, we used a give fuctio
More informationAnalysis Metrics. Intro to Algorithm Analysis. Slides. 12. Alg Analysis. 12. Alg Analysis
Itro to Algorithm Aalysis Aalysis Metrics Slides. Table of Cotets. Aalysis Metrics 3. Exact Aalysis Rules 4. Simple Summatio 5. Summatio Formulas 6. Order of Magitude 7. Big-O otatio 8. Big-O Theorems
More informationEM375 STATISTICS AND MEASUREMENT UNCERTAINTY LEAST SQUARES LINEAR REGRESSION ANALYSIS
EM375 STATISTICS AND MEASUREMENT UNCERTAINTY LEAST SQUARES LINEAR REGRESSION ANALYSIS I this uit of the course we ivestigate fittig a straight lie to measured (x, y) data pairs. The equatio we wat to fit
More informationEuclidean Distance Based Feature Selection for Fault Detection Prediction Model in Semiconductor Manufacturing Process
Vol.133 (Iformatio Techology ad Computer Sciece 016), pp.85-89 http://dx.doi.org/10.1457/astl.016. Euclidea Distace Based Feature Selectio for Fault Detectio Predictio Model i Semicoductor Maufacturig
More informationOnes Assignment Method for Solving Traveling Salesman Problem
Joural of mathematics ad computer sciece 0 (0), 58-65 Oes Assigmet Method for Solvig Travelig Salesma Problem Hadi Basirzadeh Departmet of Mathematics, Shahid Chamra Uiversity, Ahvaz, Ira Article history:
More informationAdministrative UNSUPERVISED LEARNING. Unsupervised learning. Supervised learning 11/25/13. Final project. No office hours today
Admiistrative Fial project No office hours today UNSUPERVISED LEARNING David Kauchak CS 451 Fall 2013 Supervised learig Usupervised learig label label 1 label 3 model/ predictor label 4 label 5 Supervised
More informationLearning to Shoot a Goal Lecture 8: Learning Models and Skills
Learig to Shoot a Goal Lecture 8: Learig Models ad Skills How do we acquire skill at shootig goals? CS 344R/393R: Robotics Bejami Kuipers Learig to Shoot a Goal The robot eeds to shoot the ball i the goal.
More informationCIS 121 Data Structures and Algorithms with Java Fall Big-Oh Notation Tuesday, September 5 (Make-up Friday, September 8)
CIS 11 Data Structures ad Algorithms with Java Fall 017 Big-Oh Notatio Tuesday, September 5 (Make-up Friday, September 8) Learig Goals Review Big-Oh ad lear big/small omega/theta otatios Practice solvig
More informationOur second algorithm. Comp 135 Machine Learning Computer Science Tufts University. Decision Trees. Decision Trees. Decision Trees.
Comp 135 Machie Learig Computer Sciece Tufts Uiversity Fall 2017 Roi Khardo Some of these slides were adapted from previous slides by Carla Brodley Our secod algorithm Let s look at a simple dataset for
More informationThe isoperimetric problem on the hypercube
The isoperimetric problem o the hypercube Prepared by: Steve Butler November 2, 2005 1 The isoperimetric problem We will cosider the -dimesioal hypercube Q Recall that the hypercube Q is a graph whose
More informationConsider the following population data for the state of California. Year Population
Assigmets for Bradie Fall 2016 for Chapter 5 Assigmet sheet for Sectios 5.1, 5.3, 5.5, 5.6, 5.7, 5.8 Read Pages 341-349 Exercises for Sectio 5.1 Lagrage Iterpolatio #1, #4, #7, #13, #14 For #1 use MATLAB
More informationcondition w i B i S maximum u i
ecture 10 Dyamic Programmig 10.1 Kapsack Problem November 1, 2004 ecturer: Kamal Jai Notes: Tobias Holgers We are give a set of items U = {a 1, a 2,..., a }. Each item has a weight w i Z + ad a utility
More informationA New Morphological 3D Shape Decomposition: Grayscale Interframe Interpolation Method
A ew Morphological 3D Shape Decompositio: Grayscale Iterframe Iterpolatio Method D.. Vizireau Politehica Uiversity Bucharest, Romaia ae@comm.pub.ro R. M. Udrea Politehica Uiversity Bucharest, Romaia mihea@comm.pub.ro
More informationCSCI 5090/7090- Machine Learning. Spring Mehdi Allahyari Georgia Southern University
CSCI 5090/7090- Machie Learig Sprig 018 Mehdi Allahyari Georgia Souther Uiversity Clusterig (slides borrowed from Tom Mitchell, Maria Floria Balca, Ali Borji, Ke Che) 1 Clusterig, Iformal Goals Goal: Automatically
More information15 UNSUPERVISED LEARNING
15 UNSUPERVISED LEARNING [My father] advised me to sit every few moths i my readig chair for a etire eveig, close my eyes ad try to thik of ew problems to solve. I took his advice very seriously ad have
More informationMATHEMATICAL METHODS OF ANALYSIS AND EXPERIMENTAL DATA PROCESSING (Or Methods of Curve Fitting)
MATHEMATICAL METHODS OF ANALYSIS AND EXPERIMENTAL DATA PROCESSING (Or Methods of Curve Fittig) I this chapter, we will eamie some methods of aalysis ad data processig; data obtaied as a result of a give
More informationPseudocode ( 1.1) Analysis of Algorithms. Primitive Operations. Pseudocode Details. Running Time ( 1.1) Estimating performance
Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Pseudocode ( 1.1) High-level descriptio of a algorithm More structured
More informationANN WHICH COVERS MLP AND RBF
ANN WHICH COVERS MLP AND RBF Josef Boští, Jaromír Kual Faculty of Nuclear Scieces ad Physical Egieerig, CTU i Prague Departmet of Software Egieerig Abstract Two basic types of artificial eural etwors Multi
More informationFuzzy Membership Function Optimization for System Identification Using an Extended Kalman Filter
Fuzzy Membership Fuctio Optimizatio for System Idetificatio Usig a Eteded Kalma Filter Srikira Kosaam ad Da Simo Clevelad State Uiversity NAFIPS Coferece Jue 4, 2006 Embedded Cotrol Systems Research Lab
More informationImproving Template Based Spike Detection
Improvig Template Based Spike Detectio Kirk Smith, Member - IEEE Portlad State Uiversity petra@ee.pdx.edu Abstract Template matchig algorithms like SSE, Covolutio ad Maximum Likelihood are well kow for
More informationEvaluation of Support Vector Machine Kernels for Detecting Network Anomalies
Evaluatio of Support Vector Machie Kerels for Detectig Network Aomalies Prera Batta, Maider Sigh, Zhida Li, Qigye Dig, ad Ljiljaa Trajković Commuicatio Networks Laboratory http://www.esc.sfu.ca/~ljilja/cl/
More informationSolving Fuzzy Assignment Problem Using Fourier Elimination Method
Global Joural of Pure ad Applied Mathematics. ISSN 0973-768 Volume 3, Number 2 (207), pp. 453-462 Research Idia Publicatios http://www.ripublicatio.com Solvig Fuzzy Assigmet Problem Usig Fourier Elimiatio
More informationBig-O Analysis. Asymptotics
Big-O Aalysis 1 Defiitio: Suppose that f() ad g() are oegative fuctios of. The we say that f() is O(g()) provided that there are costats C > 0 ad N > 0 such that for all > N, f() Cg(). Big-O expresses
More informationLecture 13: Validation
Lecture 3: Validatio Resampli methods Holdout Cross Validatio Radom Subsampli -Fold Cross-Validatio Leave-oe-out The Bootstrap Bias ad variace estimatio Three-way data partitioi Itroductio to Patter Recoitio
More informationImage Segmentation EEE 508
Image Segmetatio Objective: to determie (etract) object boudaries. It is a process of partitioig a image ito distict regios by groupig together eighborig piels based o some predefied similarity criterio.
More informationRunning Time. Analysis of Algorithms. Experimental Studies. Limitations of Experiments
Ruig Time Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Most algorithms trasform iput objects ito output objects. The
More informationNeural Networks A Model of Boolean Functions
Neural Networks A Model of Boolea Fuctios Berd Steibach, Roma Kohut Freiberg Uiversity of Miig ad Techology Istitute of Computer Sciece D-09596 Freiberg, Germay e-mails: steib@iformatik.tu-freiberg.de
More informationOur Learning Problem, Again
Noparametric Desity Estimatio Matthew Stoe CS 520, Sprig 2000 Lecture 6 Our Learig Problem, Agai Use traiig data to estimate ukow probabilities ad probability desity fuctios So far, we have depeded o describig
More informationSD vs. SD + One of the most important uses of sample statistics is to estimate the corresponding population parameters.
SD vs. SD + Oe of the most importat uses of sample statistics is to estimate the correspodig populatio parameters. The mea of a represetative sample is a good estimate of the mea of the populatio that
More informationCS 2710 Foundations of AI Lecture 22. Machine learning. Machine Learning
CS 7 Foudatos of AI Lecture Mache learg Mlos Hauskrecht mlos@cs.ptt.edu 539 Seott Square Mache Learg The feld of mache learg studes the desg of computer programs (agets) capable of learg from past eperece
More informationRunning Time ( 3.1) Analysis of Algorithms. Experimental Studies. Limitations of Experiments
Ruig Time ( 3.1) Aalysis of Algorithms Iput Algorithm Output A algorithm is a step- by- step procedure for solvig a problem i a fiite amout of time. Most algorithms trasform iput objects ito output objects.
More informationAnalysis of Algorithms
Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Ruig Time Most algorithms trasform iput objects ito output objects. The
More information4.2.1 Bayesian Principal Component Analysis Weighted K Nearest Neighbor Regularized Expectation Maximization
4 DATA PREPROCESSING 4.1 Data Normalizatio 4.1.1 Mi-Max 4.1.2 Z-Score 4.1.3 Decimal Scalig 4.2 Data Imputatio 4.2.1 Bayesia Pricipal Compoet Aalysis 4.2.2 K Nearest Neighbor 4.2.3 Weighted K Nearest Neighbor
More informationLecture 1: Introduction and Strassen s Algorithm
5-750: Graduate Algorithms Jauary 7, 08 Lecture : Itroductio ad Strasse s Algorithm Lecturer: Gary Miller Scribe: Robert Parker Itroductio Machie models I this class, we will primarily use the Radom Access
More informationBezier curves. Figure 2 shows cubic Bezier curves for various control points. In a Bezier curve, only
Edited: Yeh-Liag Hsu (998--; recommeded: Yeh-Liag Hsu (--9; last updated: Yeh-Liag Hsu (9--7. Note: This is the course material for ME55 Geometric modelig ad computer graphics, Yua Ze Uiversity. art of
More informationOutline and Reading. Analysis of Algorithms. Running Time. Experimental Studies. Limitations of Experiments. Theoretical Analysis
Outlie ad Readig Aalysis of Algorithms Iput Algorithm Output Ruig time ( 3.) Pseudo-code ( 3.2) Coutig primitive operatios ( 3.3-3.) Asymptotic otatio ( 3.6) Asymptotic aalysis ( 3.7) Case study Aalysis
More informationOrientation. Orientation 10/28/15
Orietatio Orietatio We will defie orietatio to mea a object s istataeous rotatioal cofiguratio Thik of it as the rotatioal equivalet of positio 1 Represetig Positios Cartesia coordiates (x,y,z) are a easy
More informationLecture Notes 6 Introduction to algorithm analysis CSS 501 Data Structures and Object-Oriented Programming
Lecture Notes 6 Itroductio to algorithm aalysis CSS 501 Data Structures ad Object-Orieted Programmig Readig for this lecture: Carrao, Chapter 10 To be covered i this lecture: Itroductio to algorithm aalysis
More informationLecture 5. Counting Sort / Radix Sort
Lecture 5. Coutig Sort / Radix Sort T. H. Corme, C. E. Leiserso ad R. L. Rivest Itroductio to Algorithms, 3rd Editio, MIT Press, 2009 Sugkyukwa Uiversity Hyuseug Choo choo@skku.edu Copyright 2000-2018
More informationCSC165H1 Worksheet: Tutorial 8 Algorithm analysis (SOLUTIONS)
CSC165H1, Witer 018 Learig Objectives By the ed of this worksheet, you will: Aalyse the ruig time of fuctios cotaiig ested loops. 1. Nested loop variatios. Each of the followig fuctios takes as iput a
More informationOCR Statistics 1. Working with data. Section 3: Measures of spread
Notes ad Eamples OCR Statistics 1 Workig with data Sectio 3: Measures of spread Just as there are several differet measures of cetral tedec (averages), there are a variet of statistical measures of spread.
More informationData Structures and Algorithms. Analysis of Algorithms
Data Structures ad Algorithms Aalysis of Algorithms Outlie Ruig time Pseudo-code Big-oh otatio Big-theta otatio Big-omega otatio Asymptotic algorithm aalysis Aalysis of Algorithms Iput Algorithm Output
More informationArithmetic Sequences
. Arithmetic Sequeces COMMON CORE Learig Stadards HSF-IF.A. HSF-BF.A.1a HSF-BF.A. HSF-LE.A. Essetial Questio How ca you use a arithmetic sequece to describe a patter? A arithmetic sequece is a ordered
More informationn Some thoughts on software development n The idea of a calculator n Using a grammar n Expression evaluation n Program organization n Analysis
Overview Chapter 6 Writig a Program Bjare Stroustrup Some thoughts o software developmet The idea of a calculator Usig a grammar Expressio evaluatio Program orgaizatio www.stroustrup.com/programmig 3 Buildig
More information9.1. Sequences and Series. Sequences. What you should learn. Why you should learn it. Definition of Sequence
_9.qxd // : AM Page Chapter 9 Sequeces, Series, ad Probability 9. Sequeces ad Series What you should lear Use sequece otatio to write the terms of sequeces. Use factorial otatio. Use summatio otatio to
More informationarxiv: v2 [cs.ds] 24 Mar 2018
Similar Elemets ad Metric Labelig o Complete Graphs arxiv:1803.08037v [cs.ds] 4 Mar 018 Pedro F. Felzeszwalb Brow Uiversity Providece, RI, USA pff@brow.edu March 8, 018 We cosider a problem that ivolves
More informationWhat are we going to learn? CSC Data Structures Analysis of Algorithms. Overview. Algorithm, and Inputs
What are we goig to lear? CSC316-003 Data Structures Aalysis of Algorithms Computer Sciece North Carolia State Uiversity Need to say that some algorithms are better tha others Criteria for evaluatio Structure
More informationOn Infinite Groups that are Isomorphic to its Proper Infinite Subgroup. Jaymar Talledo Balihon. Abstract
O Ifiite Groups that are Isomorphic to its Proper Ifiite Subgroup Jaymar Talledo Baliho Abstract Two groups are isomorphic if there exists a isomorphism betwee them Lagrage Theorem states that the order
More informationCIS 121 Data Structures and Algorithms with Java Spring Stacks and Queues Monday, February 12 / Tuesday, February 13
CIS Data Structures ad Algorithms with Java Sprig 08 Stacks ad Queues Moday, February / Tuesday, February Learig Goals Durig this lab, you will: Review stacks ad queues. Lear amortized ruig time aalysis
More informationGRADIENT DESCENT. Admin 10/24/13. Assignment 5. David Kauchak CS 451 Fall 2013
Adi Assiget 5 GRADIENT DESCENT David Kauchak CS 451 Fall 2013 Math backgroud Liear odels A strog high-bias assuptio is liear separability: i 2 diesios, ca separate classes by a lie i higher diesios, eed
More informationMachine Learning Lecture 11
Course Outlie Machie Learig Lecture 11 Fudametals (2 weeks) Bayes Decisio Theory Probability Desity Estimatio AdaBoost & Decisio Trees 07.06.2016 Discrimiative Approaches (5 weeks) Liear Discrimiat Fuctios
More informationResearch on Identification Model of Financial Fraud of Listed Company Based on Data Mining Technology
208 2d Iteratioal Coferece o Systems, Computig, ad Applicatios (SYSTCA 208) Research o Idetificatio Model of Fiacial Fraud of Listed Compay Based o Data Miig Techology Jiaqi Hu, Xiao Che School of Busiess,
More informationA SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON
A SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON Roberto Lopez ad Eugeio Oñate Iteratioal Ceter for Numerical Methods i Egieerig (CIMNE) Edificio C1, Gra Capitá s/, 08034 Barceloa, Spai ABSTRACT I this work
More informationBACHMANN-LANDAU NOTATIONS. Lecturer: Dr. Jomar F. Rabajante IMSP, UPLB MATH 174: Numerical Analysis I 1 st Sem AY
BACHMANN-LANDAU NOTATIONS Lecturer: Dr. Jomar F. Rabajate IMSP, UPLB MATH 174: Numerical Aalysis I 1 st Sem AY 018-019 RANKING OF FUNCTIONS Name Big-Oh Eamples Costat O(1 10 Logarithmic O(log log, log(
More informationA new algorithm to build feed forward neural networks.
A ew algorithm to build feed forward eural etworks. Amit Thombre Cetre of Excellece, Software Techologies ad Kowledge Maagemet, Tech Mahidra, Pue, Idia Abstract The paper presets a ew algorithm to build
More informationIMP: Superposer Integrated Morphometrics Package Superposition Tool
IMP: Superposer Itegrated Morphometrics Package Superpositio Tool Programmig by: David Lieber ( 03) Caisius College 200 Mai St. Buffalo, NY 4208 Cocept by: H. David Sheets, Dept. of Physics, Caisius College
More informationBig-O Analysis. Asymptotics
Big-O Aalysis 1 Defiitio: Suppose that f() ad g() are oegative fuctios of. The we say that f() is O(g()) provided that there are costats C > 0 ad N > 0 such that for all > N, f() Cg(). Big-O expresses
More informationLecture 28: Data Link Layer
Automatic Repeat Request (ARQ) 2. Go ack N ARQ Although the Stop ad Wait ARQ is very simple, you ca easily show that it has very the low efficiecy. The low efficiecy comes from the fact that the trasmittig
More informationCS 111 Green: Program Design I Lecture 27: Speed (cont.); parting thoughts
CS 111 Gree: Program Desig I Lecture 27: Speed (cot.); partig thoughts By Nascarkig - Ow work, CC BY-SA 4.0, https://commos.wikimedia.org/w/idex.php?curid=38671041 Robert H. Sloa (CS) & Rachel Poretsky
More informationSouth Slave Divisional Education Council. Math 10C
South Slave Divisioal Educatio Coucil Math 10C Curriculum Package February 2012 12 Strad: Measuremet Geeral Outcome: Develop spatial sese ad proportioal reasoig It is expected that studets will: 1. Solve
More informationCSE 417: Algorithms and Computational Complexity
Time CSE 47: Algorithms ad Computatioal Readig assigmet Read Chapter of The ALGORITHM Desig Maual Aalysis & Sortig Autum 00 Paul Beame aalysis Problem size Worst-case complexity: max # steps algorithm
More informationPolynomial Functions and Models. Learning Objectives. Polynomials. P (x) = a n x n + a n 1 x n a 1 x + a 0, a n 0
Polyomial Fuctios ad Models 1 Learig Objectives 1. Idetify polyomial fuctios ad their degree 2. Graph polyomial fuctios usig trasformatios 3. Idetify the real zeros of a polyomial fuctio ad their multiplicity
More informationCriterion in selecting the clustering algorithm in Radial Basis Functional Link Nets
WSEAS TRANSACTIONS o SYSTEMS Ag Sau Loog, Og Hog Choo, Low Heg Chi Criterio i selectig the clusterig algorithm i Radial Basis Fuctioal Lik Nets ANG SAU LOONG 1, ONG HONG CHOON 2 & LOW HENG CHIN 3 Departmet
More informationRedundancy Allocation for Series Parallel Systems with Multiple Constraints and Sensitivity Analysis
IOSR Joural of Egieerig Redudacy Allocatio for Series Parallel Systems with Multiple Costraits ad Sesitivity Aalysis S. V. Suresh Babu, D.Maheswar 2, G. Ragaath 3 Y.Viaya Kumar d G.Sakaraiah e (Mechaical
More informationCOMP9318: Data Warehousing and Data Mining
COMP9318: Data Warehousig ad Data Miig L3: Data Preprocessig ad Data Cleaig COMP9318: Data Warehousig ad Data Miig 1 Why preprocess the data? COMP9318: Data Warehousig ad Data Miig 2 Why Data Preprocessig?
More informationPractical selection of SVM parameters and noise estimation for SVM regression
Neural Networks 17 (24) 113 126 www.elsevier.com/locate/euet Practical selectio of SVM parameters ad oise estimatio for SVM regressio Vladimir Cherkassky*, Yuqia Ma Departmet of Electrical ad Computer
More informationCIS 121 Data Structures and Algorithms with Java Spring Stacks, Queues, and Heaps Monday, February 18 / Tuesday, February 19
CIS Data Structures ad Algorithms with Java Sprig 09 Stacks, Queues, ad Heaps Moday, February 8 / Tuesday, February 9 Stacks ad Queues Recall the stack ad queue ADTs (abstract data types from lecture.
More informationprerequisites: 6.046, 6.041/2, ability to do proofs Randomized algorithms: make random choices during run. Main benefits:
Itro Admiistrivia. Sigup sheet. prerequisites: 6.046, 6.041/2, ability to do proofs homework weekly (first ext week) collaboratio idepedet homeworks gradig requiremet term project books. questio: scribig?
More informationDimensionality Reduction PCA
Dimesioality Reductio PCA Machie Learig CSE446 David Wadde (slides provided by Carlos Guestri) Uiversity of Washigto Feb 22, 2017 Carlos Guestri 2005-2017 1 Dimesioality reductio Iput data may have thousads
More informationA graphical view of big-o notation. c*g(n) f(n) f(n) = O(g(n))
ca see that time required to search/sort grows with size of We How do space/time eeds of program grow with iput size? iput. time: cout umber of operatios as fuctio of iput Executio size operatio Assigmet:
More informationMath 10C Long Range Plans
Math 10C Log Rage Plas Uits: Evaluatio: Homework, projects ad assigmets 10% Uit Tests. 70% Fial Examiatio.. 20% Ay Uit Test may be rewritte for a higher mark. If the retest mark is higher, that mark will
More informationImage Analysis. Segmentation by Fitting a Model
Image Aalysis Segmetatio by Fittig a Model Christophoros Nikou cikou@cs.uoi.gr Images take from: D. Forsyth ad J. Poce. Computer Visio: A Moder Approach, Pretice Hall, 2003. Computer Visio course by Svetlaa
More informationSorting in Linear Time. Data Structures and Algorithms Andrei Bulatov
Sortig i Liear Time Data Structures ad Algorithms Adrei Bulatov Algorithms Sortig i Liear Time 7-2 Compariso Sorts The oly test that all the algorithms we have cosidered so far is compariso The oly iformatio
More informationEE123 Digital Signal Processing
Last Time EE Digital Sigal Processig Lecture 7 Block Covolutio, Overlap ad Add, FFT Discrete Fourier Trasform Properties of the Liear covolutio through circular Today Liear covolutio with Overlap ad add
More informationParabolic Path to a Best Best-Fit Line:
Studet Activity : Fidig the Least Squares Regressio Lie By Explorig the Relatioship betwee Slope ad Residuals Objective: How does oe determie a best best-fit lie for a set of data? Eyeballig it may be
More informationRandom Graphs and Complex Networks T
Radom Graphs ad Complex Networks T-79.7003 Charalampos E. Tsourakakis Aalto Uiversity Lecture 3 7 September 013 Aoucemet Homework 1 is out, due i two weeks from ow. Exercises: Probabilistic iequalities
More informationHow do we evaluate algorithms?
F2 Readig referece: chapter 2 + slides Algorithm complexity Big O ad big Ω To calculate ruig time Aalysis of recursive Algorithms Next time: Litterature: slides mostly The first Algorithm desig methods:
More informationGE FUNDAMENTALS OF COMPUTING AND PROGRAMMING UNIT III
GE2112 - FUNDAMENTALS OF COMPUTING AND PROGRAMMING UNIT III PROBLEM SOLVING AND OFFICE APPLICATION SOFTWARE Plaig the Computer Program Purpose Algorithm Flow Charts Pseudocode -Applicatio Software Packages-
More informationCase Studies in the use of ROC Curve Analysis for Sensor-Based Estimates in Human Computer Interaction
Case Studies i the use of ROC Curve Aalysis for Sesor-Based Estimates i Huma Computer Iteractio James Fogarty Rya S. Baker Scott E. Hudso Huma Computer Iteractio Istitute Caregie Mello Uiversity Abstract
More informationAssignment and Travelling Salesman Problems with Coefficients as LR Fuzzy Parameters
Iteratioal Joural of Applied Sciece ad Egieerig., 3: 557 Assigmet ad Travellig Salesma Problems with Coefficiets as Fuzzy Parameters Amit Kumar ad Aila Gupta * School of Mathematics ad Computer Applicatios,
More informationFuzzy Rule Selection by Data Mining Criteria and Genetic Algorithms
Fuzzy Rule Selectio by Data Miig Criteria ad Geetic Algorithms Hisao Ishibuchi Dept. of Idustrial Egieerig Osaka Prefecture Uiversity 1-1 Gakue-cho, Sakai, Osaka 599-8531, JAPAN E-mail: hisaoi@ie.osakafu-u.ac.jp
More informationNormal Distributions
Normal Distributios Stacey Hacock Look at these three differet data sets Each histogram is overlaid with a curve : A B C A) Weights (g) of ewly bor lab rat pups B) Mea aual temperatures ( F ) i A Arbor,
More informationSection 7.2: Direction Fields and Euler s Methods
Sectio 7.: Directio ields ad Euler s Methods Practice HW from Stewart Tetbook ot to had i p. 5 # -3 9-3 odd or a give differetial equatio we wat to look at was to fid its solutio. I this chapter we will
More informationEE University of Minnesota. Midterm Exam #1. Prof. Matthew O'Keefe TA: Eric Seppanen. Department of Electrical and Computer Engineering
EE 4363 1 Uiversity of Miesota Midterm Exam #1 Prof. Matthew O'Keefe TA: Eric Seppae Departmet of Electrical ad Computer Egieerig Uiversity of Miesota Twi Cities Campus EE 4363 Itroductio to Microprocessors
More information15-859E: Advanced Algorithms CMU, Spring 2015 Lecture #2: Randomized MST and MST Verification January 14, 2015
15-859E: Advaced Algorithms CMU, Sprig 2015 Lecture #2: Radomized MST ad MST Verificatio Jauary 14, 2015 Lecturer: Aupam Gupta Scribe: Yu Zhao 1 Prelimiaries I this lecture we are talkig about two cotets:
More informationAnalysis of Algorithms
Aalysis of Algorithms Ruig Time of a algorithm Ruig Time Upper Bouds Lower Bouds Examples Mathematical facts Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite
More informationComputational Geometry
Computatioal Geometry Chapter 4 Liear programmig Duality Smallest eclosig disk O the Ageda Liear Programmig Slides courtesy of Craig Gotsma 4. 4. Liear Programmig - Example Defie: (amout amout cosumed
More informationCopyright 2016 Ramez Elmasri and Shamkant B. Navathe
Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe CHAPTER 18 Strategies for Query Processig Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Itroductio DBMS techiques to process a query Scaer idetifies
More informationCS 683: Advanced Design and Analysis of Algorithms
CS 683: Advaced Desig ad Aalysis of Algorithms Lecture 6, February 1, 2008 Lecturer: Joh Hopcroft Scribes: Shaomei Wu, Etha Feldma February 7, 2008 1 Threshold for k CNF Satisfiability I the previous lecture,
More information. Written in factored form it is easy to see that the roots are 2, 2, i,
CMPS A Itroductio to Programmig Programmig Assigmet 4 I this assigmet you will write a java program that determies the real roots of a polyomial that lie withi a specified rage. Recall that the roots (or
More informationLinearising Calibration Methods for a Generic Embedded Sensor Interface (GESI)
1st Iteratioal Coferece o Sesig Techology November 21-23, 2005 Palmersto North, New Zealad Liearisig Calibratio Methods for a Geeric Embedded Sesor Iterface (GESI) Abstract Amra Pašić Work doe i: PEI Techologies,
More informationAn Efficient Algorithm for Graph Bisection of Triangularizations
A Efficiet Algorithm for Graph Bisectio of Triagularizatios Gerold Jäger Departmet of Computer Sciece Washigto Uiversity Campus Box 1045 Oe Brookigs Drive St. Louis, Missouri 63130-4899, USA jaegerg@cse.wustl.edu
More informationWhich movie we can suggest to Anne?
ECOLE CENTRALE SUPELEC MASTER DSBI DECISION MODELING TUTORIAL COLLABORATIVE FILTERING AS A MODEL OF GROUP DECISION-MAKING You kow that the low-tech way to get recommedatios for products, movies, or etertaiig
More informationPython Programming: An Introduction to Computer Science
Pytho Programmig: A Itroductio to Computer Sciece Chapter 1 Computers ad Programs 1 Objectives To uderstad the respective roles of hardware ad software i a computig system. To lear what computer scietists
More informationComputer Science Foundation Exam. August 12, Computer Science. Section 1A. No Calculators! KEY. Solutions and Grading Criteria.
Computer Sciece Foudatio Exam August, 005 Computer Sciece Sectio A No Calculators! Name: SSN: KEY Solutios ad Gradig Criteria Score: 50 I this sectio of the exam, there are four (4) problems. You must
More information( n+1 2 ) , position=(7+1)/2 =4,(median is observation #4) Median=10lb
Chapter 3 Descriptive Measures Measures of Ceter (Cetral Tedecy) These measures will tell us where is the ceter of our data or where most typical value of a data set lies Mode the value that occurs most
More informationFrom last week. Lecture 5. Outline. Principles of programming languages
Priciples of programmig laguages From last week Lecture 5 http://few.vu.l/~silvis/ppl/2007 Natalia Silvis-Cividjia e-mail: silvis@few.vu.l ML has o assigmet. Explai how to access a old bidig? Is & for
More informationMathematical Stat I: solutions of homework 1
Mathematical Stat I: solutios of homework Name: Studet Id N:. Suppose we tur over cards simultaeously from two well shuffled decks of ordiary playig cards. We say we obtai a exact match o a particular
More information