Text Mining. Exercise: Business Intelligence (Part 7) Summer Term 2014 Stefan Feuerriegel

Size: px
Start display at page:

Download "Text Mining. Exercise: Business Intelligence (Part 7) Summer Term 2014 Stefan Feuerriegel"

Transcription

1 Text Mining Exercise: Business Intelligence (Part 7) Summer Term 2014 Stefan Feuerriegel

2 Tday s Lecture Objectives 1 Being able t perfrm preprcessing steps fr text mining 2 Learning the representatin as a term-dcument matrix 3 Understanding hw a dictinary-based sentiment analysis wrks Text Mining 2

3 Outline 1 Recap 2 Text Mining 3 Excursus: Sentiment Analysis Text Mining 3

4 Outline 1 Recap 2 Text Mining 3 Excursus: Sentiment Analysis Text Mining: Recap 4

5 Artificial Neural Netwrks Neurns are arranged in three (r mre) layers First layer: Input neurns receive the input vectr x X Hidden layer(s): Cnnect input and utput neurns Final layer: Output neurns cmpute a respnse ỹ Y Input Hidden Output x 1 z 1 x N z M y 1 y 2 When neurns are cnnected as a directed graph withut cycles, this is called a feed-frward ANN Text Mining: Recap 5

6 Supprt Vectr Machine (SVM) Which f these linear separatrs is ptimal? Idea: Maximize separating margin (here: A) Data pints n the margin are called supprt vectrs When calculating decisin bundary, nly supprt vectrs matter; ther training data is ignred Frmulatin as cnvex ptimizatin prblem with glbal slutin y B A x Text Mining: Recap 6

7 Predictive Perfrmance Cnfusin matrix (als named cntingency table r errr matrix) displays predictive perfrmance Cnditin (as determined by Gld standard) True False Psitive Outcme True Psitive (TP) False Psitive (FP) Type I Errr False Alarm Precisin r Psitive Predictive Value = TP TP+FP Negative Outcme False Negative (FN) Type II Errr / Miss True Negative (TN) Sensitivity = TP Rate = TP TP+FN Specificity = TN Rate = TN FP+TN Accuracy = TP+TN Ttal Equivalent with hit rate and recall Text Mining: Recap 7

8 Sensitivity Receiver Operating Characteristic (ROC) ROC illustrates trade-ff between sensitivity and specificity Interpretatin: Curve A is randm guessing (50% crrect guesses) Curve frm mdel B perfrms better than A, but wrse than C Curve C frm perfect predictin C B A Area suth-east f curve is named area under the curve and shuld be maximized Specifity Text Mining: Recap 8

9 Predictive vs. Explanatry Pwer Significant difference between predicting and explaining: 1 Empirical Mdels fr Predictin Empirical predictive mdels (e. g. statistical mdels, methds frm data mining) designed t predict new/future bservatins Predictive Analytics describes the evaluatin f the predictive pwer, such as accuracy r precisin 2 Empirical Mdels fr Explanatin Any type f statistical mdel used fr testing causal hypthesis Use methds fr evaluating the explanatry pwer, such as statistical tests r measures like R 2 Text Mining: Recap 9

10 Overfitting When learning algrithm is perfrmed fr t lng, the learner may adjust t very specific randm features nt related t the target functin Overfitting: Perfrmance n training data (in gray) still increases, while the perfrmance n unseen data (in red) becmes wrse y Mean Squared Errr x Flexibility Text Mining: Recap 10

11 Outline 1 Recap 2 Text Mining 3 Excursus: Sentiment Analysis 11

12 Text Mining Text mining seeks patterns in textual cntent, i. e. unstructured data Idea: Impse (mathematical) structure first, then analyze it Examples: Summarizatin Categrizatin Infrmatin extractin Sentiment analysis Lad necessary library tm in R t d text mining library(tm) 12

13 Outline 2 Text Mining Creating the Crpus Transfrming the Crpus Term-Dcument Matrix 13

14 Creating the Crpus Cllectin f textual materials are called crpus Surces can vary frm XML t text files, as well as data frames Crpus(...) creates data representatin frm chsen surce Frequently anntated by additinal metadata (e. g. time stamps) inspect(crpus) displays the structure f a crpus Example: Access sample crpus cnsisting f Reuters crude il news reut21578 <- system.file("texts", "crude", package="tm") reuters <- Crpus(DirSurce(reut21578), readercntrl=list(reader=readreut21578xml)) 14

15 Outline 2 Text Mining Creating the Crpus Transfrming the Crpus Term-Dcument Matrix 15

16 Crpus Transfrmatin Additinal peratins necessary t transfrm unstructured text int a mathematical representatin Perfrm transfrmatins via tm_map(crpus, traf) 1 Remve all nn-text tkens 2 Make all letters lwer case 3 Remve redundant, nn-discriminating tkens (numbers & stpwrds) 4 Reduce all inflected wrd frms t cmmn base, i. e. the stem Example: "Details are given in Sectin 2." "detail are giv in sect" 16

17 Example: Remving HTML/XML Tags # Crpus cntains dcuments in XML frmat; remve the XML tags if (packageversin("tm")$minr <= 5) { reuters <- tm_map(reuters, as.plaintextdcument) } else { reuters <- tm_map(reuters, PlainTextDcument) } inspect(reuters[1]) A crpus with 1 text dcument The metadata cnsists f 2 tag-value pairs and a data frame Available tags are: create_date creatr Available variables in the data frame are: MetaID $`reut xml` DIAMOND SHAMROCK (DIA) CUTS CRUDE PRICES NEW YORK, FEB 26 - Diamnd Shamrck Crp said that effective tday it had cut its cntract prices fr crude il by 1.50 dlrs a barrel. The reductin brings its psted price fr West Texas Intermediate t dlrs a barrel, the cpany said. "The price reductin tday was made in the light f falling il prduct prices and a weak crude il market," a cmpany spkeswman said. Diamnd is the latest in a line f U.S. il cmpanies that have cut its cntract, r psted, prices ver the last tw days citing weak il markets. Reuter 17

18 Example: Stripping Whitespaces reuters <- tm_map(reuters, stripwhitespace) inspect(reuters[1]) A crpus with 1 text dcument The metadata cnsists f 2 tag-value pairs and a data frame Available tags are: create_date creatr Available variables in the data frame are: MetaID $`reut xml` DIAMOND SHAMROCK (DIA) CUTS CRUDE PRICES NEW YORK, FEB 26 - Diamnd Shamrck Crp said that effective tday it had cut its cntract prices fr crude il by 18

19 Example: Remving punctuatins reuters <- tm_map(reuters, remvepunctuatin) inspect(reuters[1]) A crpus with 1 text dcument The metadata cnsists f 2 tag-value pairs and a data frame Available tags are: create_date creatr Available variables in the data frame are: MetaID $`reut xml` DIAMOND SHAMROCK DIA CUTS CRUDE PRICES NEW YORK FEB 26 Diamnd Shamrck Crp said that effective tday it had cut its cntract prices fr crude il by 19

20 Example: Cnverting t Lwer Case reuters <- tm_map(reuters, tlwer) inspect(reuters[1]) A crpus with 1 text dcument The metadata cnsists f 2 tag-value pairs and a data frame Available tags are: create_date creatr Available variables in the data frame are: MetaID $`reut xml` diamnd shamrck dia cuts crude prices new yrk feb 26 diamnd shamrck crp said that effective tday it had cut its cntract prices fr crude il by 20

21 Example: Remving Numbers reuters <- tm_map(reuters, remvenumbers) inspect(reuters[1]) A crpus with 1 text dcument The metadata cnsists f 2 tag-value pairs and a data frame Available tags are: create_date creatr Available variables in the data frame are: MetaID $`reut xml` diamnd shamrck dia cuts crude prices new yrk feb diamnd shamrck crp said that effective tday it had cut its cntract prices fr crude il by 21

22 Stpwrds Stpwrds are shrt functin wrds Occur frequently but n deep meaning Remval f stpwrds in rder t cncentrate n mre imprtant wrds (that are unique/specific fr the text) Examples: the, is, at, which, and n Cmmn apprach is t use predefined list f stpwrds Get such a built-in list via stpwrds(language) sw <- stpwrds("english") length(sw) [1] 174 head(sw) [1] "i" "me" "my" "myself" "we" "ur" 22

23 Example: Remving Stpwrds reuters <- tm_map(reuters, remvewrds, stpwrds("english")) inspect(reuters[1]) A crpus with 1 text dcument The metadata cnsists f 2 tag-value pairs and a data frame Available tags are: create_date creatr Available variables in the data frame are: MetaID $`reut xml` diamnd shamrck dia cuts crude prices new yrk feb diamnd shamrck crp said effective tday cut cntract prices crude il dlrs barrel r 23

24 Stemming Stemming is the prcess f reducing inflected (r smetimes derived) wrds t their stem, base r rt frm Depending n the algrithm, the stem is nt a valid rt frm, but a shrted frm withut an ending Aims t grup wrds with (pssibly) the same meaning Examples: fishing, fished, fish, fisher fish argue, argued, argues, arguing, argus argu argument and arguments argument 24

25 Example: Stemming reuters <- tm_map(reuters, stemdcument, language = "english") inspect(reuters[1]) A crpus with 1 text dcument The metadata cnsists f 2 tag-value pairs and a data frame Available tags are: create_date creatr Available variables in the data frame are: MetaID $`reut xml` diamnd shamrck dia cut crude price new yrk feb diamnd shamrck crp said effect tday cut cntract price crude il dlrs barrel reduc 25

26 Summary: Crpus Transfrmatins Perfrm transfrmatins via tm_map(crpus, traf) R Functin PlainTextDcument stripwhitespace remvepunctuatin tlwer remvenumbers remvewrds stemdcument Transfrmatin Rule Remve HTML/XML tags Eliminate unnecessary spaces, e. g. line breaks Remve punctuatin Cnvert t lwer case letters Remve all numbers Remve stpwrds given by additinal parameter Reduce inflected wrds t stem Results can be represented as a term-dcument matrix fr further evaluatin 26

27 Outline 2 Text Mining Creating the Crpus Transfrming the Crpus Term-Dcument Matrix 27

28 Term-Dcument Matrix Term-dcument matrix is a mathematical matrix that describes the frequency f terms ccurring in dcuments Example: D 1 = "I like prgramming" D 2 = "I hate hate prgramming" Term-dcument matrix given by D 1 D 2 I 1 1 like 1 0 hate 0 2 prgramming 1 1 Term-dcument matrix is input t further machine learning prcedures, such as clustering, classificatin r predictin 28

29 Term-Dcument Matrix Create matrix via TermDcumentMatrix(crpus) frm crpus tdm <- TermDcumentMatrix(reuters) inspect(tdm[200:205, 1:5]) A term-dcument matrix (6 terms, 5 dcuments) Nn-/sparse entries: 4/26 Sparsity : 87% Maximal term length: 10 Weighting : term frequency (tf) Dcs Terms dhabi dia diamnd differenti difficulti dillard

30 Term-Dcument Matrix Use findfreqterms(tdm, n) t find terms that ccur at least n times # Retrieve wrds that ccur at least 10 times findfreqterms(tdm, 10) [1] "accrd" "analyst" "arabia" "barrel" "bpd" [6] "crude" "dlrs" "futur" "gvern" "grup" [11] "increas" "industri" "kuwait" "last" "march" [16] "market" "meet" "minist" "mln" "mnth" [21] "new" "ffici" "il" "ne" "pec" [26] "utput" "pct" "petrleum" "pst" "price" [31] "prduc" "prduct" "quta" "reprt" "reserv" [36] "reuter" "said" "saudi" "say" "sheikh" [41] "studi" "will" "wrld" "year" 30

31 Text Mining Operatins Assciatins are terms that frequently ccur tgether in dcuments Measured by crrelatin between rws in term-dcument matrix findasscs(tdm, term, p) finds assciatins with a crrelatin f at least p fr a term # Find assciatins fr the term 'pec' with a crrelatin f at least 0.8 findasscs(tdm, "pec", 0.8) meet analyst name il want emerg buyer said tri

32 Sparsity f Term-Dcument Matrix Prblem: Term-dcument matrices get very big, with many entries at zer Remval f these s-called sparse entries by deleting wrds that ccur in less than p (in %) f all dcuments remvesparseterms(tdm, p) # Remves wrds that ccur in less than 40% f dcuments tdm.rm.sparse <- remvesparseterms(tdm, 0.4) inspect(tdm.rm.sparse[, 1:5]) A term-dcument matrix (6 terms, 5 dcuments) Nn-/sparse entries: 23/7 Sparsity : 23% Maximal term length: 6 Weighting : term frequency (tf) Dcs Terms barrel march il price reuter said

33 Analyzing a Dictinary f Terms Study nly a subset f wrds f interest, specified by dictinary =... # select relevant terms f interest d <- c("price", "crude", "il") # term-dcument matrix is created nly fr thse entries tdm.small <- TermDcumentMatrix(reuters, list(dictinary = d)) inspect(tdm.small[, 1:5]) A term-dcument matrix (3 terms, 5 dcuments) Nn-/sparse entries: 12/3 Sparsity : 20% Maximal term length: 5 Weighting : term frequency (tf) Dcs Terms crude il price

34 Summary: Term-Dcument Matrix Create term-dcument matrix frm crpus via TermDcumentMatrix(crpus) R Functin findfreqterms(tdm, n) findasscs(tdm, term, p) remvesparseterms(tdm, p) dictinary =... Inspectin Terms ccurring at least n times Terms with a crrelatin f at least p Delete sparse terms with many zers Select a subset f wrds Term-dcument matrix is input t machine learning prcedures, such as clustering, classificatin r predictin 34

35 Dcument Clustering by k-means Example: Term-dcument matrix can be used t cluster dcuments accrding t cntent using k-means kmeans(t(tdm.small), 2) K-means clustering with 2 clusters f sizes 15, 5 Cluster means: crude il price Clustering vectr: Within cluster sum f squares by cluster: [1] (between_ss / ttal_ss = 50.9 %) Available cmpnents: [1] "cluster" "centers" "ttss" "withinss" [5] "tt.withinss" "betweenss" "size" 35

36 Outline 1 Recap 2 Text Mining 3 Excursus: Sentiment Analysis Text Mining: Sentiment Analysis 36

37 Frm News t Sentiment Methds that use the textual representatin f dcuments t measure the psitivity and negativity f the cntent are referred t as pinin mining r sentiment analysis Flw diagram Filtering Preprcessing Sentiment Analysis Evaluatin Crpus Stpwrds Dictinaries Text Mining: Sentiment Analysis 37

38 Sentiment Analysis Frequent apprach utilizes dictinaries cntaining wrds labeled as psitive r negative Let W ps dente the number f psitive wrds, W neg the negative and W tt the ttal number f wrds S-called Net-Optimism sentiment S NO [ 1,+1] is given by S NO = W ps W neg W tt Gives nrmalized rati between psitive and negative terms Example During the first nine mnths f 2008 KRONES remained n curse fr grwth, despite the cyclical dwnturn. On a like-fr-like basis, sales rse by 12.5 % t reach Eur 1,765.9 m. During the perid under review, the cmpany benefited frm the increasing number f clients lking fr all-inclusive jbs. Anther grwth driver during the year s first three quarters was the grup s Plastics Technlgy Divisin. KRONES is the wrld s leading vendr f machines and... Psitive wrds marked in blue Negative wrds marked in red S NO = = Text Mining: Sentiment Analysis 38

39 Sentiment Analysis in R Read dictinaries with psitive/negative wrds int data frame Create crrespnding term-dcument matrices ps <- as.data.frame(read.csv("psitivity.txt", header=false)) tdm.ps <- TermDcumentMatrix(reuters, list(dictinary = t(ps))) neg <- as.data.frame(read.csv("negativity.txt", header=false)) tdm.neg <- TermDcumentMatrix(reuters, list(dictinary = t(neg))) Text Mining: Sentiment Analysis 39

40 Sentiment Analysis in R Calculate Net-Optimism sentiment fr each dcument # Initialize empty vectr t stre results sentiment <- numeric(length(reuters)) # Iterate ver all dcuments fr (i in 1:length(reuters)) { # Calculate Net-Optimism sentiment sentiment[i] <- (sum(tdm.ps[, i]) - sum(tdm.neg[, i]))/sum(tdm[, i]) } # Output results sentiment [1] [8] [15] Sentiment scres are input t data analysis (e. g. regressin) r predictin (e. g. Supprt Vectr Machine) Text Mining: Sentiment Analysis 40

Data Mining with Linear Discriminants. Exercise: Business Intelligence (Part 6) Summer Term 2014 Stefan Feuerriegel

Data Mining with Linear Discriminants. Exercise: Business Intelligence (Part 6) Summer Term 2014 Stefan Feuerriegel Data Mining with Linear Discriminants Exercise: Business Intelligence (Part 6) Summer Term 2014 Stefan Feuerriegel Tday s Lecture Objectives 1 Recgnizing the ideas f artificial neural netwrks and their

More information

Pattern Recognition 2014 Support Vector Machines

Pattern Recognition 2014 Support Vector Machines Pattern Recgnitin 2014 Supprt Vectr Machines Ad Feelders Universiteit Utrecht Ad Feelders ( Universiteit Utrecht ) Pattern Recgnitin 1 / 55 Overview 1 Separable Case 2 Kernel Functins 3 Allwing Errrs (Sft

More information

COMP 551 Applied Machine Learning Lecture 11: Support Vector Machines

COMP 551 Applied Machine Learning Lecture 11: Support Vector Machines COMP 551 Applied Machine Learning Lecture 11: Supprt Vectr Machines Instructr: (jpineau@cs.mcgill.ca) Class web page: www.cs.mcgill.ca/~jpineau/cmp551 Unless therwise nted, all material psted fr this curse

More information

COMP 551 Applied Machine Learning Lecture 9: Support Vector Machines (cont d)

COMP 551 Applied Machine Learning Lecture 9: Support Vector Machines (cont d) COMP 551 Applied Machine Learning Lecture 9: Supprt Vectr Machines (cnt d) Instructr: Herke van Hf (herke.vanhf@mail.mcgill.ca) Slides mstly by: Class web page: www.cs.mcgill.ca/~hvanh2/cmp551 Unless therwise

More information

CHAPTER 24: INFERENCE IN REGRESSION. Chapter 24: Make inferences about the population from which the sample data came.

CHAPTER 24: INFERENCE IN REGRESSION. Chapter 24: Make inferences about the population from which the sample data came. MATH 1342 Ch. 24 April 25 and 27, 2013 Page 1 f 5 CHAPTER 24: INFERENCE IN REGRESSION Chapters 4 and 5: Relatinships between tw quantitative variables. Be able t Make a graph (scatterplt) Summarize the

More information

Lecture 2: Supervised vs. unsupervised learning, bias-variance tradeoff

Lecture 2: Supervised vs. unsupervised learning, bias-variance tradeoff Lecture 2: Supervised vs. unsupervised learning, bias-variance tradeff Reading: Chapter 2 STATS 202: Data mining and analysis September 27, 2017 1 / 20 Supervised vs. unsupervised learning In unsupervised

More information

Lecture 2: Supervised vs. unsupervised learning, bias-variance tradeoff

Lecture 2: Supervised vs. unsupervised learning, bias-variance tradeoff Lecture 2: Supervised vs. unsupervised learning, bias-variance tradeff Reading: Chapter 2 STATS 202: Data mining and analysis September 27, 2017 1 / 20 Supervised vs. unsupervised learning In unsupervised

More information

COMP 551 Applied Machine Learning Lecture 5: Generative models for linear classification

COMP 551 Applied Machine Learning Lecture 5: Generative models for linear classification COMP 551 Applied Machine Learning Lecture 5: Generative mdels fr linear classificatin Instructr: Herke van Hf (herke.vanhf@mail.mcgill.ca) Slides mstly by: Jelle Pineau Class web page: www.cs.mcgill.ca/~hvanh2/cmp551

More information

k-nearest Neighbor How to choose k Average of k points more reliable when: Large k: noise in attributes +o o noise in class labels

k-nearest Neighbor How to choose k Average of k points more reliable when: Large k: noise in attributes +o o noise in class labels Mtivating Example Memry-Based Learning Instance-Based Learning K-earest eighbr Inductive Assumptin Similar inputs map t similar utputs If nt true => learning is impssible If true => learning reduces t

More information

Resampling Methods. Cross-validation, Bootstrapping. Marek Petrik 2/21/2017

Resampling Methods. Cross-validation, Bootstrapping. Marek Petrik 2/21/2017 Resampling Methds Crss-validatin, Btstrapping Marek Petrik 2/21/2017 Sme f the figures in this presentatin are taken frm An Intrductin t Statistical Learning, with applicatins in R (Springer, 2013) with

More information

IAML: Support Vector Machines

IAML: Support Vector Machines 1 / 22 IAML: Supprt Vectr Machines Charles Suttn and Victr Lavrenk Schl f Infrmatics Semester 1 2 / 22 Outline Separating hyperplane with maimum margin Nn-separable training data Epanding the input int

More information

Simple Linear Regression (single variable)

Simple Linear Regression (single variable) Simple Linear Regressin (single variable) Intrductin t Machine Learning Marek Petrik January 31, 2017 Sme f the figures in this presentatin are taken frm An Intrductin t Statistical Learning, with applicatins

More information

NUMBERS, MATHEMATICS AND EQUATIONS

NUMBERS, MATHEMATICS AND EQUATIONS AUSTRALIAN CURRICULUM PHYSICS GETTING STARTED WITH PHYSICS NUMBERS, MATHEMATICS AND EQUATIONS An integral part t the understanding f ur physical wrld is the use f mathematical mdels which can be used t

More information

PSU GISPOPSCI June 2011 Ordinary Least Squares & Spatial Linear Regression in GeoDa

PSU GISPOPSCI June 2011 Ordinary Least Squares & Spatial Linear Regression in GeoDa There are tw parts t this lab. The first is intended t demnstrate hw t request and interpret the spatial diagnstics f a standard OLS regressin mdel using GeDa. The diagnstics prvide infrmatin abut the

More information

CHAPTER 2 Algebraic Expressions and Fundamental Operations

CHAPTER 2 Algebraic Expressions and Fundamental Operations CHAPTER Algebraic Expressins and Fundamental Operatins OBJECTIVES: 1. Algebraic Expressins. Terms. Degree. Gruping 5. Additin 6. Subtractin 7. Multiplicatin 8. Divisin Algebraic Expressin An algebraic

More information

COMP 551 Applied Machine Learning Lecture 4: Linear classification

COMP 551 Applied Machine Learning Lecture 4: Linear classification COMP 551 Applied Machine Learning Lecture 4: Linear classificatin Instructr: Jelle Pineau (jpineau@cs.mcgill.ca) Class web page: www.cs.mcgill.ca/~jpineau/cmp551 Unless therwise nted, all material psted

More information

CS 477/677 Analysis of Algorithms Fall 2007 Dr. George Bebis Course Project Due Date: 11/29/2007

CS 477/677 Analysis of Algorithms Fall 2007 Dr. George Bebis Course Project Due Date: 11/29/2007 CS 477/677 Analysis f Algrithms Fall 2007 Dr. Gerge Bebis Curse Prject Due Date: 11/29/2007 Part1: Cmparisn f Srting Algrithms (70% f the prject grade) The bjective f the first part f the assignment is

More information

ENSC Discrete Time Systems. Project Outline. Semester

ENSC Discrete Time Systems. Project Outline. Semester ENSC 49 - iscrete Time Systems Prject Outline Semester 006-1. Objectives The gal f the prject is t design a channel fading simulatr. Upn successful cmpletin f the prject, yu will reinfrce yur understanding

More information

Section 6-2: Simplex Method: Maximization with Problem Constraints of the Form ~

Section 6-2: Simplex Method: Maximization with Problem Constraints of the Form ~ Sectin 6-2: Simplex Methd: Maximizatin with Prblem Cnstraints f the Frm ~ Nte: This methd was develped by Gerge B. Dantzig in 1947 while n assignment t the U.S. Department f the Air Frce. Definitin: Standard

More information

Dataflow Analysis and Abstract Interpretation

Dataflow Analysis and Abstract Interpretation Dataflw Analysis and Abstract Interpretatin Cmputer Science and Artificial Intelligence Labratry MIT Nvember 9, 2015 Recap Last time we develped frm first principles an algrithm t derive invariants. Key

More information

CHAPTER 3 INEQUALITIES. Copyright -The Institute of Chartered Accountants of India

CHAPTER 3 INEQUALITIES. Copyright -The Institute of Chartered Accountants of India CHAPTER 3 INEQUALITIES Cpyright -The Institute f Chartered Accuntants f India INEQUALITIES LEARNING OBJECTIVES One f the widely used decisin making prblems, nwadays, is t decide n the ptimal mix f scarce

More information

Evaluating enterprise support: state of the art and future challenges. Dirk Czarnitzki KU Leuven, Belgium, and ZEW Mannheim, Germany

Evaluating enterprise support: state of the art and future challenges. Dirk Czarnitzki KU Leuven, Belgium, and ZEW Mannheim, Germany Evaluating enterprise supprt: state f the art and future challenges Dirk Czarnitzki KU Leuven, Belgium, and ZEW Mannheim, Germany Intrductin During the last decade, mircecnmetric ecnmetric cunterfactual

More information

Tutorial 3: Building a spectral library in Skyline

Tutorial 3: Building a spectral library in Skyline SRM Curse 2013 Tutrial 3 Spectral Library Tutrial 3: Building a spectral library in Skyline Spectral libraries fr SRM methd design and fr data analysis can be either directly added t a Skyline dcument

More information

NAME: Prof. Ruiz. 1. [5 points] What is the difference between simple random sampling and stratified random sampling?

NAME: Prof. Ruiz. 1. [5 points] What is the difference between simple random sampling and stratified random sampling? CS4445 ata Mining and Kwledge iscery in atabases. B Term 2014 Exam 1 Nember 24, 2014 Prf. Carlina Ruiz epartment f Cmputer Science Wrcester Plytechnic Institute NAME: Prf. Ruiz Prblem I: Prblem II: Prblem

More information

Early detection of mining truck failure by modelling its operation with neural networks classification algorithms

Early detection of mining truck failure by modelling its operation with neural networks classification algorithms RU, Rand GOLOSINSKI, T.S. Early detectin f mining truck failure by mdelling its peratin with neural netwrks classificatin algrithms. Applicatin f Cmputers and Operatins Research ill the Minerals Industries,

More information

West Deptford Middle School 8th Grade Curriculum Unit 4 Investigate Bivariate Data

West Deptford Middle School 8th Grade Curriculum Unit 4 Investigate Bivariate Data West Deptfrd Middle Schl 8th Grade Curriculum Unit 4 Investigate Bivariate Data Office f Curriculum and Instructin West Deptfrd Middle Schl 675 Grve Rd, Paulsbr, NJ 08066 wdeptfrd.k12.nj.us (856) 848-1200

More information

the results to larger systems due to prop'erties of the projection algorithm. First, the number of hidden nodes must

the results to larger systems due to prop'erties of the projection algorithm. First, the number of hidden nodes must M.E. Aggune, M.J. Dambrg, M.A. El-Sharkawi, R.J. Marks II and L.E. Atlas, "Dynamic and static security assessment f pwer systems using artificial neural netwrks", Prceedings f the NSF Wrkshp n Applicatins

More information

ENG2410 Digital Design Sequencing and Control

ENG2410 Digital Design Sequencing and Control ENG24 igital esign equencing and ntrl atapath cnsists f: Parts f PU Registers, Multiplers, dders, ubtractrs and lgic t perfrm peratins n data (mb Lgic) ntrl unit Generates signals t cntrl data-path ccepts

More information

BASD HIGH SCHOOL FORMAL LAB REPORT

BASD HIGH SCHOOL FORMAL LAB REPORT BASD HIGH SCHOOL FORMAL LAB REPORT *WARNING: After an explanatin f what t include in each sectin, there is an example f hw the sectin might lk using a sample experiment Keep in mind, the sample lab used

More information

Multiple Source Multiple. using Network Coding

Multiple Source Multiple. using Network Coding Multiple Surce Multiple Destinatin Tplgy Inference using Netwrk Cding Pegah Sattari EECS, UC Irvine Jint wrk with Athina Markpulu, at UCI, Christina Fraguli, at EPFL, Lausanne Outline Netwrk Tmgraphy Gal,

More information

The blessing of dimensionality for kernel methods

The blessing of dimensionality for kernel methods fr kernel methds Building classifiers in high dimensinal space Pierre Dupnt Pierre.Dupnt@ucluvain.be Classifiers define decisin surfaces in sme feature space where the data is either initially represented

More information

Chapter 3: Cluster Analysis

Chapter 3: Cluster Analysis Chapter 3: Cluster Analysis } 3.1 Basic Cncepts f Clustering 3.1.1 Cluster Analysis 3.1. Clustering Categries } 3. Partitining Methds 3..1 The principle 3.. K-Means Methd 3..3 K-Medids Methd 3..4 CLARA

More information

x 1 Outline IAML: Logistic Regression Decision Boundaries Example Data

x 1 Outline IAML: Logistic Regression Decision Boundaries Example Data Outline IAML: Lgistic Regressin Charles Suttn and Victr Lavrenk Schl f Infrmatics Semester Lgistic functin Lgistic regressin Learning lgistic regressin Optimizatin The pwer f nn-linear basis functins Least-squares

More information

Physical Layer: Outline

Physical Layer: Outline 18-: Intrductin t Telecmmunicatin Netwrks Lectures : Physical Layer Peter Steenkiste Spring 01 www.cs.cmu.edu/~prs/nets-ece Physical Layer: Outline Digital Representatin f Infrmatin Characterizatin f Cmmunicatin

More information

GENESIS Structural Optimization for ANSYS Mechanical

GENESIS Structural Optimization for ANSYS Mechanical P3 STRUCTURAL OPTIMIZATION (Vl. II) GENESIS Structural Optimizatin fr ANSYS Mechanical An Integrated Extensin that adds Structural Optimizatin t ANSYS Envirnment New Features and Enhancements Release 2017.03

More information

Biplots in Practice MICHAEL GREENACRE. Professor of Statistics at the Pompeu Fabra University. Chapter 13 Offprint

Biplots in Practice MICHAEL GREENACRE. Professor of Statistics at the Pompeu Fabra University. Chapter 13 Offprint Biplts in Practice MICHAEL GREENACRE Prfessr f Statistics at the Pmpeu Fabra University Chapter 13 Offprint CASE STUDY BIOMEDICINE Cmparing Cancer Types Accrding t Gene Epressin Arrays First published:

More information

Query Expansion. Lecture Objectives. Text Technologies for Data Science INFR Learn about Query Expansion. Implement: 10/24/2017

Query Expansion. Lecture Objectives. Text Technologies for Data Science INFR Learn about Query Expansion. Implement: 10/24/2017 Tet Technlgies fr Data Science INFR11145 Query Epansin Instructr: Walid Magdy 24-Oct-2017 Lecture Objectives Learn abut Query Epansin Query epansin methds Relevance feedback in IR Rcchi s algrithm PRF

More information

In SMV I. IAML: Support Vector Machines II. This Time. The SVM optimization problem. We saw:

In SMV I. IAML: Support Vector Machines II. This Time. The SVM optimization problem. We saw: In SMV I IAML: Supprt Vectr Machines II Nigel Gddard Schl f Infrmatics Semester 1 We sa: Ma margin trick Gemetry f the margin and h t cmpute it Finding the ma margin hyperplane using a cnstrained ptimizatin

More information

Resampling Methods. Chapter 5. Chapter 5 1 / 52

Resampling Methods. Chapter 5. Chapter 5 1 / 52 Resampling Methds Chapter 5 Chapter 5 1 / 52 1 51 Validatin set apprach 2 52 Crss validatin 3 53 Btstrap Chapter 5 2 / 52 Abut Resampling An imprtant statistical tl Pretending the data as ppulatin and

More information

5 th grade Common Core Standards

5 th grade Common Core Standards 5 th grade Cmmn Cre Standards In Grade 5, instructinal time shuld fcus n three critical areas: (1) develping fluency with additin and subtractin f fractins, and develping understanding f the multiplicatin

More information

T Algorithmic methods for data mining. Slide set 6: dimensionality reduction

T Algorithmic methods for data mining. Slide set 6: dimensionality reduction T-61.5060 Algrithmic methds fr data mining Slide set 6: dimensinality reductin reading assignment LRU bk: 11.1 11.3 PCA tutrial in mycurses (ptinal) ptinal: An Elementary Prf f a Therem f Jhnsn and Lindenstrauss,

More information

Distributions, spatial statistics and a Bayesian perspective

Distributions, spatial statistics and a Bayesian perspective Distributins, spatial statistics and a Bayesian perspective Dug Nychka Natinal Center fr Atmspheric Research Distributins and densities Cnditinal distributins and Bayes Thm Bivariate nrmal Spatial statistics

More information

Determining the Accuracy of Modal Parameter Estimation Methods

Determining the Accuracy of Modal Parameter Estimation Methods Determining the Accuracy f Mdal Parameter Estimatin Methds by Michael Lee Ph.D., P.E. & Mar Richardsn Ph.D. Structural Measurement Systems Milpitas, CA Abstract The mst cmmn type f mdal testing system

More information

Building to Transformations on Coordinate Axis Grade 5: Geometry Graph points on the coordinate plane to solve real-world and mathematical problems.

Building to Transformations on Coordinate Axis Grade 5: Geometry Graph points on the coordinate plane to solve real-world and mathematical problems. Building t Transfrmatins n Crdinate Axis Grade 5: Gemetry Graph pints n the crdinate plane t slve real-wrld and mathematical prblems. 5.G.1. Use a pair f perpendicular number lines, called axes, t define

More information

Kinetic Model Completeness

Kinetic Model Completeness 5.68J/10.652J Spring 2003 Lecture Ntes Tuesday April 15, 2003 Kinetic Mdel Cmpleteness We say a chemical kinetic mdel is cmplete fr a particular reactin cnditin when it cntains all the species and reactins

More information

o o IMPORTANT REMINDERS Reports will be graded largely on their ability to clearly communicate results and important conclusions.

o o IMPORTANT REMINDERS Reports will be graded largely on their ability to clearly communicate results and important conclusions. BASD High Schl Frmal Lab Reprt GENERAL INFORMATION 12 pt Times New Rman fnt Duble-spaced, if required by yur teacher 1 inch margins n all sides (tp, bttm, left, and right) Always write in third persn (avid

More information

SUPPLEMENTARY MATERIAL GaGa: a simple and flexible hierarchical model for microarray data analysis

SUPPLEMENTARY MATERIAL GaGa: a simple and flexible hierarchical model for microarray data analysis SUPPLEMENTARY MATERIAL GaGa: a simple and flexible hierarchical mdel fr micrarray data analysis David Rssell Department f Bistatistics M.D. Andersn Cancer Center, Hustn, TX 77030, USA rsselldavid@gmail.cm

More information

Chapter Summary. Mathematical Induction Strong Induction Recursive Definitions Structural Induction Recursive Algorithms

Chapter Summary. Mathematical Induction Strong Induction Recursive Definitions Structural Induction Recursive Algorithms Chapter 5 1 Chapter Summary Mathematical Inductin Strng Inductin Recursive Definitins Structural Inductin Recursive Algrithms Sectin 5.1 3 Sectin Summary Mathematical Inductin Examples f Prf by Mathematical

More information

CAUSAL INFERENCE. Technical Track Session I. Phillippe Leite. The World Bank

CAUSAL INFERENCE. Technical Track Session I. Phillippe Leite. The World Bank CAUSAL INFERENCE Technical Track Sessin I Phillippe Leite The Wrld Bank These slides were develped by Christel Vermeersch and mdified by Phillippe Leite fr the purpse f this wrkshp Plicy questins are causal

More information

A New Evaluation Measure. J. Joiner and L. Werner. The problems of evaluation and the needed criteria of evaluation

A New Evaluation Measure. J. Joiner and L. Werner. The problems of evaluation and the needed criteria of evaluation III-l III. A New Evaluatin Measure J. Jiner and L. Werner Abstract The prblems f evaluatin and the needed criteria f evaluatin measures in the SMART system f infrmatin retrieval are reviewed and discussed.

More information

ECE 545 Project Deliverables

ECE 545 Project Deliverables ECE 545 Prject Deliverables Tp-level flder: _ Secnd-level flders: 1_assumptins 2_blck_diagrams 3_interface 4_ASM_charts 5_surce_cde 6_verificatin 7_timing_analysis 8_results

More information

Math Foundations 20 Work Plan

Math Foundations 20 Work Plan Math Fundatins 20 Wrk Plan Units / Tpics 20.8 Demnstrate understanding f systems f linear inequalities in tw variables. Time Frame December 1-3 weeks 6-10 Majr Learning Indicatrs Identify situatins relevant

More information

A Scalable Recurrent Neural Network Framework for Model-free

A Scalable Recurrent Neural Network Framework for Model-free A Scalable Recurrent Neural Netwrk Framewrk fr Mdel-free POMDPs April 3, 2007 Zhenzhen Liu, Itamar Elhanany Machine Intelligence Lab Department f Electrical and Cmputer Engineering The University f Tennessee

More information

CS 109 Lecture 23 May 18th, 2016

CS 109 Lecture 23 May 18th, 2016 CS 109 Lecture 23 May 18th, 2016 New Datasets Heart Ancestry Netflix Our Path Parameter Estimatin Machine Learning: Frmally Many different frms f Machine Learning We fcus n the prblem f predictin Want

More information

Medium Scale Integrated (MSI) devices [Sections 2.9 and 2.10]

Medium Scale Integrated (MSI) devices [Sections 2.9 and 2.10] EECS 270, Winter 2017, Lecture 3 Page 1 f 6 Medium Scale Integrated (MSI) devices [Sectins 2.9 and 2.10] As we ve seen, it s smetimes nt reasnable t d all the design wrk at the gate-level smetimes we just

More information

Agenda. What is Machine Learning? Learning Type of Learning: Supervised, Unsupervised and semi supervised Classification

Agenda. What is Machine Learning? Learning Type of Learning: Supervised, Unsupervised and semi supervised Classification Agenda Artificial Intelligence and its applicatins Lecture 6 Supervised Learning Prfessr Daniel Yeung danyeung@ieee.rg Dr. Patrick Chan patrickchan@ieee.rg Suth China University f Technlgy, China Learning

More information

SURVIVAL ANALYSIS WITH SUPPORT VECTOR MACHINES

SURVIVAL ANALYSIS WITH SUPPORT VECTOR MACHINES 1 SURVIVAL ANALYSIS WITH SUPPORT VECTOR MACHINES Wlfgang HÄRDLE Ruslan MORO Center fr Applied Statistics and Ecnmics (CASE), Humbldt-Universität zu Berlin Mtivatin 2 Applicatins in Medicine estimatin f

More information

What is Statistical Learning?

What is Statistical Learning? What is Statistical Learning? Sales 5 10 15 20 25 Sales 5 10 15 20 25 Sales 5 10 15 20 25 0 50 100 200 300 TV 0 10 20 30 40 50 Radi 0 20 40 60 80 100 Newspaper Shwn are Sales vs TV, Radi and Newspaper,

More information

DEFENSE OCCUPATIONAL AND ENVIRONMENTAL HEALTH READINESS SYSTEM (DOEHRS) ENVIRONMENTAL HEALTH SAMPLING ELECTRONIC DATA DELIVERABLE (EDD) GUIDE

DEFENSE OCCUPATIONAL AND ENVIRONMENTAL HEALTH READINESS SYSTEM (DOEHRS) ENVIRONMENTAL HEALTH SAMPLING ELECTRONIC DATA DELIVERABLE (EDD) GUIDE DEFENSE OCCUPATIOL AND ENVIRONMENTAL HEALTH READINESS SYSTEM (DOEHRS) ENVIRONMENTAL HEALTH SAMPLING ELECTRONIC DATA DELIVERABLE (EDD) GUIDE 20 JUNE 2017 V1.0 i TABLE OF CONTENTS 1 INTRODUCTION... 1 2 CONCEPT

More information

Revision: August 19, E Main Suite D Pullman, WA (509) Voice and Fax

Revision: August 19, E Main Suite D Pullman, WA (509) Voice and Fax .7.4: Direct frequency dmain circuit analysis Revisin: August 9, 00 5 E Main Suite D Pullman, WA 9963 (509) 334 6306 ice and Fax Overview n chapter.7., we determined the steadystate respnse f electrical

More information

4th Indian Institute of Astrophysics - PennState Astrostatistics School July, 2013 Vainu Bappu Observatory, Kavalur. Correlation and Regression

4th Indian Institute of Astrophysics - PennState Astrostatistics School July, 2013 Vainu Bappu Observatory, Kavalur. Correlation and Regression 4th Indian Institute f Astrphysics - PennState Astrstatistics Schl July, 2013 Vainu Bappu Observatry, Kavalur Crrelatin and Regressin Rahul Ry Indian Statistical Institute, Delhi. Crrelatin Cnsider a tw

More information

Writing Guidelines. (Updated: November 25, 2009) Forwards

Writing Guidelines. (Updated: November 25, 2009) Forwards Writing Guidelines (Updated: Nvember 25, 2009) Frwards I have fund in my review f the manuscripts frm ur students and research assciates, as well as thse submitted t varius jurnals by thers that the majr

More information

Least Squares Optimal Filtering with Multirate Observations

Least Squares Optimal Filtering with Multirate Observations Prc. 36th Asilmar Cnf. n Signals, Systems, and Cmputers, Pacific Grve, CA, Nvember 2002 Least Squares Optimal Filtering with Multirate Observatins Charles W. herrien and Anthny H. Hawes Department f Electrical

More information

Admin. MDP Search Trees. Optimal Quantities. Reinforcement Learning

Admin. MDP Search Trees. Optimal Quantities. Reinforcement Learning Admin Reinfrcement Learning Cntent adapted frm Berkeley CS188 MDP Search Trees Each MDP state prjects an expectimax-like search tree Optimal Quantities The value (utility) f a state s: V*(s) = expected

More information

A Correlation of. to the. South Carolina Academic Standards for Mathematics Precalculus

A Correlation of. to the. South Carolina Academic Standards for Mathematics Precalculus A Crrelatin f Suth Carlina Academic Standards fr Mathematics Precalculus INTRODUCTION This dcument demnstrates hw Precalculus (Blitzer), 4 th Editin 010, meets the indicatrs f the. Crrelatin page references

More information

Dead-beat controller design

Dead-beat controller design J. Hetthéssy, A. Barta, R. Bars: Dead beat cntrller design Nvember, 4 Dead-beat cntrller design In sampled data cntrl systems the cntrller is realised by an intelligent device, typically by a PLC (Prgrammable

More information

Support-Vector Machines

Support-Vector Machines Supprt-Vectr Machines Intrductin Supprt vectr machine is a linear machine with sme very nice prperties. Haykin chapter 6. See Alpaydin chapter 13 fr similar cntent. Nte: Part f this lecture drew material

More information

MODULE ONE. This module addresses the foundational concepts and skills that support all of the Elementary Algebra academic standards.

MODULE ONE. This module addresses the foundational concepts and skills that support all of the Elementary Algebra academic standards. Mdule Fundatinal Tpics MODULE ONE This mdule addresses the fundatinal cncepts and skills that supprt all f the Elementary Algebra academic standards. SC Academic Elementary Algebra Indicatrs included in

More information

Five Whys How To Do It Better

Five Whys How To Do It Better Five Whys Definitin. As explained in the previus article, we define rt cause as simply the uncvering f hw the current prblem came int being. Fr a simple causal chain, it is the entire chain. Fr a cmplex

More information

Computational modeling techniques

Computational modeling techniques Cmputatinal mdeling techniques Lecture 3: Mdeling change (2) Mdeling using prprtinality Mdeling using gemetric similarity In Petre Department f IT, Ab Akademi http://www.users.ab.fi/ipetre/cmpmd/ http://users.ab.fi/ipetre/cmpmd/

More information

Floating Point Method for Solving Transportation. Problems with Additional Constraints

Floating Point Method for Solving Transportation. Problems with Additional Constraints Internatinal Mathematical Frum, Vl. 6, 20, n. 40, 983-992 Flating Pint Methd fr Slving Transprtatin Prblems with Additinal Cnstraints P. Pandian and D. Anuradha Department f Mathematics, Schl f Advanced

More information

Elements of Machine Intelligence - I

Elements of Machine Intelligence - I ECE-175A Elements f Machine Intelligence - I Ken Kreutz-Delgad Nun Vascncels ECE Department, UCSD Winter 2011 The curse The curse will cver basic, but imprtant, aspects f machine learning and pattern recgnitin

More information

Hypothesis Tests for One Population Mean

Hypothesis Tests for One Population Mean Hypthesis Tests fr One Ppulatin Mean Chapter 9 Ala Abdelbaki Objective Objective: T estimate the value f ne ppulatin mean Inferential statistics using statistics in rder t estimate parameters We will be

More information

THE LIFE OF AN OBJECT IT SYSTEMS

THE LIFE OF AN OBJECT IT SYSTEMS THE LIFE OF AN OBJECT IT SYSTEMS Persns, bjects, r cncepts frm the real wrld, which we mdel as bjects in the IT system, have "lives". Actually, they have tw lives; the riginal in the real wrld has a life,

More information

Subject description processes

Subject description processes Subject representatin 6.1.2. Subject descriptin prcesses Overview Fur majr prcesses r areas f practice fr representing subjects are classificatin, subject catalging, indexing, and abstracting. The prcesses

More information

Reinforcement Learning" CMPSCI 383 Nov 29, 2011!

Reinforcement Learning CMPSCI 383 Nov 29, 2011! Reinfrcement Learning" CMPSCI 383 Nv 29, 2011! 1 Tdayʼs lecture" Review f Chapter 17: Making Cmple Decisins! Sequential decisin prblems! The mtivatin and advantages f reinfrcement learning.! Passive learning!

More information

Engineering Decision Methods

Engineering Decision Methods GSOE9210 vicj@cse.unsw.edu.au www.cse.unsw.edu.au/~gs9210 Maximin and minimax regret 1 2 Indifference; equal preference 3 Graphing decisin prblems 4 Dminance The Maximin principle Maximin and minimax Regret

More information

CONSTRUCTING STATECHART DIAGRAMS

CONSTRUCTING STATECHART DIAGRAMS CONSTRUCTING STATECHART DIAGRAMS The fllwing checklist shws the necessary steps fr cnstructing the statechart diagrams f a class. Subsequently, we will explain the individual steps further. Checklist 4.6

More information

ROUNDING ERRORS IN BEAM-TRACKING CALCULATIONS

ROUNDING ERRORS IN BEAM-TRACKING CALCULATIONS Particle Acceleratrs, 1986, Vl. 19, pp. 99-105 0031-2460/86/1904-0099/$15.00/0 1986 Grdn and Breach, Science Publishers, S.A. Printed in the United States f America ROUNDING ERRORS IN BEAM-TRACKING CALCULATIONS

More information

Lecture 02 CSE 40547/60547 Computing at the Nanoscale

Lecture 02 CSE 40547/60547 Computing at the Nanoscale PN Junctin Ntes: Lecture 02 CSE 40547/60547 Cmputing at the Nanscale Letʼs start with a (very) shrt review f semi-cnducting materials: - N-type material: Obtained by adding impurity with 5 valence elements

More information

AP Statistics Practice Test Unit Three Exploring Relationships Between Variables. Name Period Date

AP Statistics Practice Test Unit Three Exploring Relationships Between Variables. Name Period Date AP Statistics Practice Test Unit Three Explring Relatinships Between Variables Name Perid Date True r False: 1. Crrelatin and regressin require explanatry and respnse variables. 1. 2. Every least squares

More information

Lab 1 The Scientific Method

Lab 1 The Scientific Method INTRODUCTION The fllwing labratry exercise is designed t give yu, the student, an pprtunity t explre unknwn systems, r universes, and hypthesize pssible rules which may gvern the behavir within them. Scientific

More information

Computational modeling techniques

Computational modeling techniques Cmputatinal mdeling techniques Lecture 4: Mdel checing fr ODE mdels In Petre Department f IT, Åb Aademi http://www.users.ab.fi/ipetre/cmpmd/ Cntent Stichimetric matrix Calculating the mass cnservatin relatins

More information

NUROP CONGRESS PAPER CHINESE PINYIN TO CHINESE CHARACTER CONVERSION

NUROP CONGRESS PAPER CHINESE PINYIN TO CHINESE CHARACTER CONVERSION NUROP Chinese Pinyin T Chinese Character Cnversin NUROP CONGRESS PAPER CHINESE PINYIN TO CHINESE CHARACTER CONVERSION CHIA LI SHI 1 AND LUA KIM TENG 2 Schl f Cmputing, Natinal University f Singapre 3 Science

More information

MATCHING TECHNIQUES. Technical Track Session VI. Emanuela Galasso. The World Bank

MATCHING TECHNIQUES. Technical Track Session VI. Emanuela Galasso. The World Bank MATCHING TECHNIQUES Technical Track Sessin VI Emanuela Galass The Wrld Bank These slides were develped by Christel Vermeersch and mdified by Emanuela Galass fr the purpse f this wrkshp When can we use

More information

Fall 2013 Physics 172 Recitation 3 Momentum and Springs

Fall 2013 Physics 172 Recitation 3 Momentum and Springs Fall 03 Physics 7 Recitatin 3 Mmentum and Springs Purpse: The purpse f this recitatin is t give yu experience wrking with mmentum and the mmentum update frmula. Readings: Chapter.3-.5 Learning Objectives:.3.

More information

Department of Electrical Engineering, University of Waterloo. Introduction

Department of Electrical Engineering, University of Waterloo. Introduction Sectin 4: Sequential Circuits Majr Tpics Types f sequential circuits Flip-flps Analysis f clcked sequential circuits Mre and Mealy machines Design f clcked sequential circuits State transitin design methd

More information

Sections 15.1 to 15.12, 16.1 and 16.2 of the textbook (Robbins-Miller) cover the materials required for this topic.

Sections 15.1 to 15.12, 16.1 and 16.2 of the textbook (Robbins-Miller) cover the materials required for this topic. Tpic : AC Fundamentals, Sinusidal Wavefrm, and Phasrs Sectins 5. t 5., 6. and 6. f the textbk (Rbbins-Miller) cver the materials required fr this tpic.. Wavefrms in electrical systems are current r vltage

More information

Applying Kirchoff s law on the primary circuit. V = - e1 V+ e1 = 0 V.D. e.m.f. From the secondary circuit e2 = v2. K e. Equivalent circuit :

Applying Kirchoff s law on the primary circuit. V = - e1 V+ e1 = 0 V.D. e.m.f. From the secondary circuit e2 = v2. K e. Equivalent circuit : TRANSFORMERS Definitin : Transfrmers can be defined as a static electric machine which cnverts electric energy frm ne ptential t anther at the same frequency. It can als be defined as cnsists f tw electric

More information

Churn Prediction using Dynamic RFM-Augmented node2vec

Churn Prediction using Dynamic RFM-Augmented node2vec Churn Predictin using Dynamic RFM-Augmented nde2vec Sandra Mitrvić, Jchen de Weerdt, Bart Baesens & Wilfried Lemahieu Department f Decisin Sciences and Infrmatin Management, KU Leuven 18 September 2017,

More information

Enhancing Performance of MLP/RBF Neural Classifiers via an Multivariate Data Distribution Scheme

Enhancing Performance of MLP/RBF Neural Classifiers via an Multivariate Data Distribution Scheme Enhancing Perfrmance f / Neural Classifiers via an Multivariate Data Distributin Scheme Halis Altun, Gökhan Gelen Nigde University, Electrical and Electrnics Engineering Department Nigde, Turkey haltun@nigde.edu.tr

More information

Tree Structured Classifier

Tree Structured Classifier Tree Structured Classifier Reference: Classificatin and Regressin Trees by L. Breiman, J. H. Friedman, R. A. Olshen, and C. J. Stne, Chapman & Hall, 98. A Medical Eample (CART): Predict high risk patients

More information

1996 Engineering Systems Design and Analysis Conference, Montpellier, France, July 1-4, 1996, Vol. 7, pp

1996 Engineering Systems Design and Analysis Conference, Montpellier, France, July 1-4, 1996, Vol. 7, pp THE POWER AND LIMIT OF NEURAL NETWORKS T. Y. Lin Department f Mathematics and Cmputer Science San Jse State University San Jse, Califrnia 959-003 tylin@cs.ssu.edu and Bereley Initiative in Sft Cmputing*

More information

Linear Classification

Linear Classification Linear Classificatin CS 54: Machine Learning Slides adapted frm Lee Cper, Jydeep Ghsh, and Sham Kakade Review: Linear Regressin CS 54 [Spring 07] - H Regressin Given an input vectr x T = (x, x,, xp), we

More information

A Matrix Representation of Panel Data

A Matrix Representation of Panel Data web Extensin 6 Appendix 6.A A Matrix Representatin f Panel Data Panel data mdels cme in tw brad varieties, distinct intercept DGPs and errr cmpnent DGPs. his appendix presents matrix algebra representatins

More information

Differentiation Applications 1: Related Rates

Differentiation Applications 1: Related Rates Differentiatin Applicatins 1: Related Rates 151 Differentiatin Applicatins 1: Related Rates Mdel 1: Sliding Ladder 10 ladder y 10 ladder 10 ladder A 10 ft ladder is leaning against a wall when the bttm

More information

SAP Note Missing documentation on enhancement MDR10001

SAP Note Missing documentation on enhancement MDR10001 SAP Nte 303613 - Missing dcumentatin n enhancement Nte Language: English Versin: 2 Validity: Valid Since 31.07.2000 Summary Symptm Missing dcumentatin n SAP enhancement Additinal key wrds CMOD, rder quantity

More information

3.4 Shrinkage Methods Prostate Cancer Data Example (Continued) Ridge Regression

3.4 Shrinkage Methods Prostate Cancer Data Example (Continued) Ridge Regression 3.3.4 Prstate Cancer Data Example (Cntinued) 3.4 Shrinkage Methds 61 Table 3.3 shws the cefficients frm a number f different selectin and shrinkage methds. They are best-subset selectin using an all-subsets

More information

CHM112 Lab Graphing with Excel Grading Rubric

CHM112 Lab Graphing with Excel Grading Rubric Name CHM112 Lab Graphing with Excel Grading Rubric Criteria Pints pssible Pints earned Graphs crrectly pltted and adhere t all guidelines (including descriptive title, prperly frmatted axes, trendline

More information

Lesson Plan. Recode: They will do a graphic organizer to sequence the steps of scientific method.

Lesson Plan. Recode: They will do a graphic organizer to sequence the steps of scientific method. Lessn Plan Reach: Ask the students if they ever ppped a bag f micrwave ppcrn and nticed hw many kernels were unppped at the bttm f the bag which made yu wnder if ther brands pp better than the ne yu are

More information