Designing a learning system
|
|
- Phyllis Parrish
- 6 years ago
- Views:
Transcription
1 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 to obtai a copy of Matlab: A brief tutorial o Matlab ext week
2 Learig: first look Assume we get a dataset D that cosists of pairs (x, y) Goal: lear the mappig f : X Y to is able to predict well y for some future x. Questio: How do we lear f? y x Learig: first look. Data: D { d, d,.., d}. Model selectio: Select a model or a set of models (with parameters) E.g. y ax b 3. Choose the objective (error) fuctio Squared error Error( D, ( axi ) i. Learig: Fid the set of parameters ( optimizig the error fuctio a, b ) arg max Error( D, ( ( 5. Applicatio Apply the leared model to ew data E.g. predict ys for the ew iput x f ( x) a x b
3 Learig: first look. Data: D { d, d,.., d}. Model selectio: Select a model or a set of models (with parameters) E.g. y ax y b 3. Choose the objective (error) fuctio Squared error Error( D, ( axi ) i -. Learig: - Fid the set of parameters ( optimizig the error - fuctio - ( a, b ) - arg max ( Error( D, x Applicatio Apply the leared model to ew data E.g. predict ys for the ew iput x f ( x) a x b Learig: first look. Data: D { d, d,.., d}. Model selectio: Select a model or a set of models (with parameters) E.g. y ax b 3. Choose the objective (error) fuctio Squared error y Error( D, ( axi ) i. Learig: Fid the set of parameters ( optimizig the error fuctio a, b ) -arg max Error( D, ( ( - 5. Applicatio - Apply the leared - model to ew data E.g. predict ys for the ew iput x f ( x) a x b
4 Learig: first look. Data: D { d, d,.., d}. Model selectio: Select a model or a set of models (with parameters) E.g. y ax b 3. Choose the objective (error) fuctio Squared error Error( D, ( axi ) i. Learig: Fid the set of parameters ( optimizig the error fuctio a, b ) arg max Error( D, ( ( 5. Applicatio - - Apply the leared model to ew data - - E.g. predict ys for the ew iput x - f ( x) a x b Learig: first look. Data: D { d, d,.., d}. Model selectio: Select a modelor a set of models (with parameters) - - E.g. y ax b Choose the objective (error) fuctio - Squared error Error( D, ( axi ) i. Learig: Fid the set of parameters ( optimizig the error fuctio a, b ) arg max Error( D, ( ( 5. Applicatio Apply the leared model to ew data E.g. predict ys for the ew iput x f ( x) a x b
5 Learig: first look. Data: D { d, d,.., d}. Model selectio: Select a model or a set of models (with parameters) E.g. y ax b 3. Choose the objective (error) fuctio Squared error Error( D, ( axi ) i. Learig: x - - Fid the set of parameters - ( optimizig the error - fuctio a, b ) arg max Error( D,.5 ( ( 5. Applicatio Apply the leared model to ew data E.g. predict ys for the ew iput x f ( x) a x b Learig: first look. Data: D { d, d,.., d}. Model selectio: Select a model or a set of models (with parameters) E.g. y ax b 3. Choose the objective (error) fuctio Squared error Error( D, ( axi ) i. Learig: Fid the set of parameters ( optimizig the error fuctio ( a, b ) arg max ( Error( D, 5. Applicatio * Apply the leared model to ew data f ( x) a x b Looks straightforward, but there are problems. * 5
6 Learig: geeralizatio error We fit the model based o past examples observed i D Traiig data: Data used to fit the parameters of the model Traiig error: Error( D, ( f ( xi )) Problem: Ultimately we are iterested i learig the mappig that performs well o the whole populatio of examples i True (geeralizatio) error (over the whole populatio): Error( E( x, y) [( y f ( x)) ] Mea squared error Traiig error tries to approximate the true error!!!! Does a good traiig error imply a good geeralizatio error? Overfittig Assume we have a set of poits ad we cosider polyomial fuctios as our possible models
7 Overfittig Fittig a liear fuctio with the square error Error is ozero. Why? Overfittig Fittig a liear fuctio with the square error Error is ozero: Error( D, f ) ( f ( xi )) i
8 Overfittig Assume i additio to a liear model: y f ( x) ax b 3 also: y f ( x) a3x ax ax b Which model would give us a smaller error for the least squares fit? Overfittig Liear vs. cubic polyomial Higher order polyomial leads to a better fit, smaller error
9 Overfittig Is it always good to miimize the error of the observed data? Overfittig 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?
10 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? 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 complexity of the model)
11 How to evaluate the learer s performace? Geeralizatio error is the true error for the populatio of examples we would like to optimize E( x, y )[( y f ( x)) ] But it caot be computed exactly Sample mea oly approximates 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 assess the geeralizatio error? i f ( x )) i How to evaluate the learer s performace? Geeralizatio error is the true error for the populatio of examples we would like to optimize Sample mea oly approximates it Two ways to assess the geeralizatio error is: Theoretical: Law of Large umbers statistical bouds o the differece betwee true 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 ( x j )) m j,.. m
12 Assessmet of the geeralizatio performace Simple holdout method Divide the data ito the disjoit traiig ad test data Dataset Traiig set Testig set Evaluate Lear (fit) Predictive model Typically /3 traiig ad /3 testig Testig of models: regressio Data set Traiig set Test set Lear o the traiig set The model Evaluate o the test set
13 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 approximatio of the quality measure we would really like to optimize 3
14 Evaluatio measures 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 ax b 3. Choose the objective fuctio Squared error ( f ( xi )) 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 (x) CS 75 Machie Learig
15 A learig system: basic cycle. Data: D { d, d,.., d}. Model selectio: Select a y model ax or b a set of models (with parameters) E.g. x 3. Choose the objective fuctio ( f ( xi )) x x i x x - Squared error - x - x. 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 (x) 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 ax b 3. Choose the objective fuctio Squared error ( f ( xi )) 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 (x) CS 75 Machie Learig 5
16 Steps take whe desigig a ML system Data Model selectio Choice of Error fuctio Learig/optimizatio Evaluatio Applicatio Add some complexity Data Data cleaig/preprocessig Feature selectio/dimesioality reductio Model selectio Choice of Error fuctio Learig/optimizatio Evaluatio Applicatio
17 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 7
18 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 uexpected results whe data used for aalysis ad learig are biased Results (coclusios) derived for a biased dataset do ot hold i geeral!!! CS 75 Machie Learig Data biases Example: Assume you wat to build a ML program for predictig the stock behavior ad for choosig your ivestmet strategy Data extractio: pick compaies that are traded o the stock market o Jauary 7 Go back 3 years ad extract 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
19 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 9
20 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 Problem: How to safely represet the differet categories as umbers whe o order exists? Solutio: Use idicator vector (or oe-hot) represetatio. Example: Red, Blue, Gree colors 3 categories use a vector of biary (,) values of size 3 Ecodig: Red: (,,); Blue: (,,); ad Gree: (,,) Data preprocessig Rescalig (ormalizatio): cotiuous values trasformed to some rage, typically [-, ] or [,]. 5 - Why ormalizatio? Some learig algorithms are sesitive to the values recorded i the specific iput field ad its magitude
21 Data preprocessig Discretizatio (biig): cotiuous values to a fiite set of discrete values Example: Group Group Group 3 Example : Data preprocessig Abstractio: merge together categorical values Aggregatio: summary or aggregatio operatios, such miimum value, maximum value, average etc. New attributes: example: obesity-factor = weight/height
Designing a learning system
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
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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 informationChapter 2 and 3, Data Pre-processing
CSI 4352, Itroductio to Data Miig Chapter 2 ad 3, Data Pre-processig Youg-Rae Cho Associate Professor Departmet of Computer Sciece Baylor Uiversity Why Need Data Pre-processig? Icomplete Data Missig values,
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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 informationLower Bounds for Sorting
Liear Sortig Topics Covered: Lower Bouds for Sortig Coutig Sort Radix Sort Bucket Sort Lower Bouds for Sortig Compariso vs. o-compariso sortig Decisio tree model Worst case lower boud Compariso Sortig
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 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 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 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 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 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 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 informationAnalysis of Algorithms
Presetatio for use with the textbook, Algorithm Desig ad Applicatios, by M. T. Goodrich ad R. Tamassia, Wiley, 2015 Aalysis of Algorithms Iput 2015 Goodrich ad Tamassia Algorithm Aalysis of Algorithms
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 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 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 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 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 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 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 informationAn Efficient Algorithm for Graph Bisection of Triangularizations
Applied Mathematical Scieces, Vol. 1, 2007, o. 25, 1203-1215 A Efficiet Algorithm for Graph Bisectio of Triagularizatios Gerold Jäger Departmet of Computer Sciece Washigto Uiversity Campus Box 1045, Oe
More informationData Preprocessing. Motivation
Data Preprocessig Mirek Riedewald Some slides based o presetatio by Jiawei Ha ad Michelie Kamber Motivatio Garbage-i, garbage-out Caot get good miig results from bad data Need to uderstad data properties
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 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 informationCSC 220: Computer Organization Unit 11 Basic Computer Organization and Design
College of Computer ad Iformatio Scieces Departmet of Computer Sciece CSC 220: Computer Orgaizatio Uit 11 Basic Computer Orgaizatio ad Desig 1 For the rest of the semester, we ll focus o computer architecture:
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 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. An aside: text classification. Text: raw data. Admin 9/27/16. Assignment 3 graded. Assignment 5. David Kauchak CS 158 Fall 2016
Adi Assiget 3 graded Assiget 5! Course feedback GRADIENT DESCENT David Kauchak CS 158 Fall 2016 A aside: text classificatio Text: ra data Ra data labels Ra data labels Features? Chardoay Chardoay Piot
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 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 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 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 informationHash Tables. Presentation for use with the textbook Algorithm Design and Applications, by M. T. Goodrich and R. Tamassia, Wiley, 2015.
Presetatio for use with the textbook Algorithm Desig ad Applicatios, by M. T. Goodrich ad R. Tamassia, Wiley, 2015 Hash Tables xkcd. http://xkcd.com/221/. Radom Number. Used with permissio uder Creative
More informationExact Minimum Lower Bound Algorithm for Traveling Salesman Problem
Exact Miimum Lower Boud Algorithm for Travelig Salesma Problem Mohamed Eleiche GeoTiba Systems mohamed.eleiche@gmail.com Abstract The miimum-travel-cost algorithm is a dyamic programmig algorithm to compute
More informationUNIT 4 Section 8 Estimating Population Parameters using Confidence Intervals
UNIT 4 Sectio 8 Estimatig Populatio Parameters usig Cofidece Itervals To make ifereces about a populatio that caot be surveyed etirely, sample statistics ca be take from a SRS of the populatio ad used
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 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 informationIntroduction. Nature-Inspired Computing. Terminology. Problem Types. Constraint Satisfaction Problems - CSP. Free Optimization Problem - FOP
Nature-Ispired Computig Hadlig Costraits Dr. Şima Uyar September 2006 Itroductio may practical problems are costraied ot all combiatios of variable values represet valid solutios feasible solutios ifeasible
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 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 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 informationAn improved support vector machine based on particle swarm optimization in laser ultrasonic defect detection
A improved support vector machie based o particle swarm optimizatio i laser ultrasoic defect detectio School of Sciece, North Uiversity of Chia, aiyua, Shaxi 35, Chia xut98@63.com,hhp9@63.com,xywag@6.com,43497@qq.com
More informationx x 2 x Iput layer = quatity of classificatio mode X T = traspositio matrix The core of such coditioal probability estimatig method is calculatig the
COMPARATIVE RESEARCHES ON PROBABILISTIC NEURAL NETWORKS AND MULTI-LAYER PERCEPTRON NETWORKS FOR REMOTE SENSING IMAGE SEGMENTATION Liu Gag a, b, * a School of Electroic Iformatio, Wuha Uiversity, 430079,
More informationEnhancements to basic decision tree induction, C4.5
Ehacemets to basic decisio tree iductio, C4.5 1 This is a decisio tree for credit risk assessmet It classifies all examples of the table correctly ID3 selects a property to test at the curret ode of the
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 informationECE4050 Data Structures and Algorithms. Lecture 6: Searching
ECE4050 Data Structures ad Algorithms Lecture 6: Searchig 1 Search Give: Distict keys k 1, k 2,, k ad collectio L of records of the form (k 1, I 1 ), (k 2, I 2 ),, (k, I ) where I j is the iformatio associated
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 informationSOFTWARE usually does not work alone. It must have
Proceedigs of the 203 Federated Coferece o Computer Sciece ad Iformatio Systems pp. 343 348 A method for selectig eviromets for software compatibility testig Łukasz Pobereżik AGH Uiversity of Sciece ad
More informationFilter design. 1 Design considerations: a framework. 2 Finite impulse response (FIR) filter design
Filter desig Desig cosideratios: a framework C ı p ı p H(f) Aalysis of fiite wordlegth effects: I practice oe should check that the quatisatio used i the implemetatio does ot degrade the performace of
More information1 Graph Sparsfication
CME 305: Discrete Mathematics ad Algorithms 1 Graph Sparsficatio I this sectio we discuss the approximatio of a graph G(V, E) by a sparse graph H(V, F ) o the same vertex set. I particular, we cosider
More informationTask scenarios Outline. Scenarios in Knowledge Extraction. Proposed Framework for Scenario to Design Diagram Transformation
6-0-0 Kowledge Trasformatio from Task Scearios to View-based Desig Diagrams Nima Dezhkam Kamra Sartipi {dezhka, sartipi}@mcmaster.ca Departmet of Computig ad Software McMaster Uiversity CANADA SEKE 08
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 informationENGR Spring Exam 1
ENGR 300 Sprig 03 Exam INSTRUCTIONS: Duratio: 60 miutes Keep your eyes o your ow work! Keep your work covered at all times!. Each studet is resposible for followig directios. Read carefully.. MATLAB ad
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 information