Cluster-Based Profile Monitoring in Phase I Analysis. Yajuan Chen. Doctor of Philosophy In Statistics

Size: px
Start display at page:

Download "Cluster-Based Profile Monitoring in Phase I Analysis. Yajuan Chen. Doctor of Philosophy In Statistics"

Transcription

1 Cluster-Based Profle Montorng n Phase I Analyss Yajuan Chen Dssertaton submtted to the faculty of the Vrgna Polytechnc Insttute and State Unversty n partal fulfllment of the requrements for the degree of Doctor of Phlosophy In Statstcs Jeffery B Brch Pang Du Inyoung Km Wllam H. Woodall 1/31/014 Blacksburg VA Keywords: Cluster, Mxed Model, Phase I, Phase II, Robust, T Statstc

2 Cluster-Based Profle Montorng n Phase I Analyss Yajuan Chen ABSTRACT Profle montorng s a well-known approach used n statstcal process control where the qualty of the product or process s characterzed by a profle or a relatonshp between a response varable and one or more explanatory varables. Profle montorng s conducted over two phases, labeled as Phase I and Phase II. In Phase I profle montorng, regresson methods are used to model each profle and to detect the possble presence of out-of-control profles n the hstorcal data set (HDS). The out-of-control profles can be detected by usng the T stats- tc. However, prevous methods of calculatng the T statstc are based on usng all the data n the HDS ncludng the data from the out-of-control process. Consequently, the ablty of usng ths method can be dstorted f the HDS contans data from the out-of-control process. Ths work provdes a new profle montorng methodology for Phase I analyss. The proposed method, referred to as the cluster-based profle montorng method, ncorporates a cluster analyss phase before calculatng the T statstc. Before ntroducng our proposed cluster-based method n profle montorng, ths cluster-based method s demonstrated to work effcently n robust regresson, referred to as cluster-based bounded nfluence regresson or CBI. It wll be demonstrated that the CBI method provdes a robust, effcent and hgh breakdown regresson parameter estmator. The CBI method frst represents the data space va a specal set of ponts, referred to as anchor ponts. Then a collecton of sngle-pont-added ordnary least squares regresson estmators forms the bass of a metrc used n defnng the smlarty between any two observatons. Cluster analyss then yelds a man cluster contanng at least half the observatons, wth the remanng observatons comprsng one or more mnor clusters. An ntal regresson estmator arses from the man cluster, wth a group-addtve DFFITS argument used to carefully actvate the mnor clusters through a bounded nfluence regresson frame work. CBI acheves a 50% breakdown pont, s regresson equvarant, scale and affne equvarant and dstrbutonally s asymptotcally normal. Case studes and Monte Carlo results demonstrate the performance advantage of CBI over other popular robust regresson procedures regardng coeffcent stablty, scale estmaton and standard errors.

3 The cluster-based method n Phase I profle montorng frst replaces the data from each sampled unt wth an estmated profle, usng some approprate regresson method. The estmated parameters for the parametrc profles are obtaned from parametrc models whle the estmated parameters for the nonparametrc profles are obtaned from the p-splne model. The cluster phase clusters the profles based on ther estmated parameters and ths yelds an ntal man cluster whch contans at least half the profles. The ntal estmated parameters for the populaton average (PA) profle are obtaned by fttng a mxed model (parametrc or nonparametrc) to those profles n the man cluster. Profles that are not contaned n the ntal man cluster are teratvely added to the man cluster provded ther T statstcs are small and the mxed model (parametrc or nonparametrc) s used to update the estmated parameters for the PA profle. Those profles contaned n the fnal man cluster are consdered as resultng from the n-control process whle those not ncluded are consdered as resultng from an out-ofcontrol process. Ths cluster-based method has been appled to montor both parametrc and nonparametrc profles. A smulated example, a Monte Carlo study and an applcaton to a real data set demonstrates the detal of the algorthm and the performance advantage of ths proposed method over a non-cluster-based method s demonstrated wth respect to more accurate estmates of the PA parameters and mproved classfcaton performance crtera. When the profles can be represented by m p 1vectors, the profle montorng process s equvalent to the detecton of multvarate outlers. For ths reason, we also compared our proposed method to a popular method used to dentfy outlers when dealng wth a multvarate response. Our study demonstrated that when the out-of-control process corresponds to a sustaned shft, the cluster-based method usng the successve dfference estmator s clearly the superor method, among those methods we consdered, based on all performance crtera. In addton, the nfluence of accurate Phase I estmates on the performance of Phase II control charts s presented to show the further advantage of the proposed method. A smple example and Monte Carlo results show that more accurate estmates from Phase I would provde more effcent Phase II control charts.

4 Acknowledgments I would lke to express my wholehearted grattude to my advsor Dr. Jeffery B. Brch for hs nvaluable gudance, advce and countless hours of edtng to help me complete ths dssertaton. Hs encouragement, support and thoughtfulness are hghly apprecated. As a professor, Dr. Brch s an expert n hs statstcal areas and as a person, Dr. Brch s a very knd, organzed and postve man, I have learned a lot from hm durng my graduate study and he s the gude n my future lfe. Also, I would lke to thank Dr. Brch for hs excellent work as the drector of our graduate program. As a graduate student n the Department of Statstcs at Vrgna Tech, I feel so lucky to have hm here as he cares about every aspect of each student s lfe and provdes the help needed to make each graduate student s experence n our department an enjoyable one. I would lke to thank my commttee members: Dr. Pang Du, Dr. Inyoung Km, and Dr. Wllam H. Woodall. They were very helpful and provded me postve nput to further mprove ths work. I thank Dr. Woodall for hs great edtng and techncal advce for my dssertaton, papers and presentatons. I thank Dr. Km for her gude n nonparametrc analyss and I thank Dr. Du for hs gude n functonal data analyss. Many people on the faculty, staff and among the graduate students of the Department of Statstcs asssted and encouraged me n varous ways. I would lke to thank them. I would especally lke to thank our faculty for provdng excellent courses and consultng experences that have prepared me for my future career. Also, I thank all my frends n Blacksburg, whose frendshp have supported me and have brought me a lot of good memores n my lfe. I thank my parents and my brothers. They have been very supportve and encouragng n my lfe. I want to especally thank my brother Chuanwen, who gve me much help whenever t was needed. Further, I thank my parents-n-law for helpng us to take care of Ella so I have tme to fnsh ths dssertaton. Last but not least, I would lke to thank my sweet husband Y and my lovely daughter Ella. I thank them for comng nto my lfe, and for brngng me such v

5 joy and happness. I thank Y for hs love, support, patence and help durng my graduate studes. v

6 Contents Acknowledgments... v Contents... v Lst of Tables... x Lst of Fgures... x Acronyms... x Nomenclature... xv Chapter 1. Introducton and Motvaton Robust Estmaton n Regresson Robust estmaton n SPC Phase I and Phase II n SPC Robust estmaton n Phase I Profle Montorng n SPC Motvaton... 6 Chapter. Cluster-Based Bounded Influence Regresson Revew of Robust Regressons Revew of Selected Robust Regresson Methods Cluster-Based Bounded Influence Regresson Case Studes and Comparson Monte Carlo Study Chapter Summary Chapter 3. Profle Montorng Lterature Phase I and Phase II Profle Montorng Lterature Revew Multvarate T Statstcs Profle Montorng for Mxed Model v

7 3.4.1 Lnear Mxed Models and ts Parametrc Estmaton Nonparametrc Mxed Regresson and P-splne Estmaton Detectng the Out-of-control Process Detectng the Out-of-control Process Usng LMM Detectng Out-of-control Process Usng the P-splne Mxed Model Chapter Summary Chapter 4. Cluster-Based Profle Montorng n Phase I Motvaton Proposed Cluster-based Profle Montorng Method Detaled Smple Example Automoble Engne Applcaton A Monte Carlo Study Further Analyss based on the Monte Carlo Study Chapter Summary Chapter 5. Phase II Control Charts based on Phase I Analyss Profle Montorng n Phase II Detaled Smple Example ARL based on Monte Carlo Study Chapter Summary Chapter 6. Cluster-Based Nonparametrc Profle Montorng Cluster-Based Nonparametrc Profle Montorng An Automoble Engne Applcaton A Monte Carlo Study Concluson Chapter 7. Conclusons and Outlook for Future Work Conclusons Outlook for Future Work v

8 References Appendx v

9 Lst of Tables Table.1: Summary of the CBI regresson analyss of the PH dataset... 7 Table.: Robust analyss of parameter estmate summary of PH dataset... 8 Table.3: CBI analyss of parameter estmate summary of HBK dataset Table.4: Robust analyss of parameter estmate summary of HBK dataset Table.5: Smulaton results for Monte Carlo study... 3 Table.6: Standardzed average weght for observatons Table 4.1: Dataset for the example Table 4.:13 ˆB matrx; the parameter estmates for 1 profles Table 4.3: Smlarty matrx usng ˆ ˆ T 1 ˆ s ˆ ˆ j j D j β β V β β Table 4.4: Cluster hstory for example data Table 4.5: Eblups for the profles n C fnal Table 4.6: The Automotve Industry Data, Torque (T) vs. RPM... 7 Table 4.7: The parameter estmates for 0 engnes Table 4.8: Cluster hstory for 0 engnes Table 4.9: Classfcaton table for Phase I analyss Table 4.10: Average of performances based on a Monte Carlo study... 8 Table 4.11: Average of PA parameter estmates based on a Monte Carlo study Table 4.1: Classfcaton table for non-cluster-based method (shft=0.05) Table 4.13: Classfcaton table for cluster-based method (shft=0.05) Table 4.14: Classfcaton table for cluster-based method (shft=0.175) Table 4.15: Classfcaton table for cluster-based method (shft=0.175) Table 4.16: The parameter estmates for 30 profles (shft=0.3) Table 4.17: Classfcaton table for cluster-based method (shft=0.3)... 9 Table 4.18: Classfcaton table for cluster-based method (shft=0.3) Table 4.19: Performance of one smulaton study wth dfferent shft Table 5.1: ARL_CB and ARL_NCB wth ARL Table 5.: ARL_CB and ARL_NCB wth Phase I shft=0.05, ARL Table 5.3: ARL_CB and ARL_NCB wth Phase I shft=0.075, ARL x

10 Table 5.4: ARL_CB and ARL_NCB wth Phase I shft=0.1, ARL Table 5.5: ARL_CB and ARL_NCB wth Phase I shft=0.15, ARL Table 5.6: ARL_C and ARL_NCB wth Phase I shft=0.15, ARL Table 5.7: ARL_CB and ARL_NCB wth Phase I shft=0.175, ARL Table 5.8: ARL_CB and ARL_NCB wth Phase I shft=0., ARL Table 5.9: ARL_CB and ARL_NCB wth Phase I shft=0.5, ARL Table 5.10: ARL_CB and ARL_NCB wth Phase I shft=0.5, ARL Table 5.11: ARL_CB and ARL_NCB wth Phase I shft=0.75, ARL Table 5.1: ARL_CB and ARL_NCB wth Phase I shft=0.3, ARL Table 6.1: Estmated ˆ, 1,..14 for each engne Table 6.: Cluster hstory based on eblups for 0 engnes x

11 Lst of Fgures Fgure 1.1: The plot of 1 true profles... 9 Fgure.1: The ftted lne of the dfferent robust methods... 1 Fgure.: Cluster dendrogram and fnal observaton weghts of PH dataset... 8 Fgure.3: The fnal CBI regresson observaton weghts of HBK dataset Fgure 4.1: Plot of 1 observed profles Fgure 4.: Dendrogram for clusterng of example dataset Fgure 4.3: The raw data set for 0 automoble engnes Fgure 4.4: Dendrogram for clusterng of 0 engnes Fgure 4.5: Plot of true profles wth shft= Fgure 4.6: Plot of true profles wth shft= Fgure 4.7: Plot of true profles wth shft= Fgure 4.8: 3D Plot of estmated PA and PS parameter vectors when the shft= Fgure 4.9: 3D Plot of estmated PA and PS parameters Fgure 6.1: Dendrogram for clusterng of 0 engnes by nonparametrc approach Fgure 6.: Plot of PA profle wth dfferent values Fgure 6.3: FCC for dfferent shft values wth = Fgure 6.4: FCC for dfferent shft values wth = Fgure 6.5: FCC for dfferent shft values wth = Fgure 6.6: FPR for dfferent shft values wth = Fgure 6.7: FPR for dfferent shft values wth = Fgure 6.8: FPR for dfferent shft values wth = x

12 Acronyms ARL ARL 1 ARL 0 ARL_C ARL_NCB BI blup CBI eblup FCC FNR FPR HDS HKB hp LMM LMS LTS L-W MCD MLE MRPM MVE M1S OLS PA PH POS PS Average Run Length Out-of-Control ARL In-Control ARL ARL based on the cluster-based T control chart ARL based on the non-cluster-based T control chart Bounded Influence Best Lnear Unbased Predctor Cluster-based Bounded Influence Regresson Estmated Best Lnear Unbased Predctor Fracton Correctly Classfed False Negatve Rate False Postve Rate Hstorcal Data Set Hawkns DM, Bradu D, Gordon VK Hgh Influence Pont Lnear Mxed Model Least Medan Squares Least Trmmed Squares Lard-Ware Mnmum Covarate Determnant Maxmum Lkelhood Estmator Model Robust Profle Montorng Mnmum Volume Ellpsod Mallows 1-step Ordnary Least Square Populaton Average Pendleton and Hockng Probablty of Sgnal Profle Specfc x

13 REMLE REWLS RMCD SPC S1S Restrcted Maxmum Lkelhood Estmator Robust and Effcent Weghted Least Square Reweghted Mnmum Covarance Determnant Statstcal Process Control Schweppe s 1-step x

14 Nomenclature β A p 1 unknown parameter vector ˆβ A p 1estmated parameter vector β ˆM The p 1estmated parameter vector by usng M regresson β ˆCBI The p 1estmated parameter vector by usng CBI regresson ˆ P β The p 1estmated parameter vector for the th profle β ˆLMM The p 1estmated parameter vector for the PA profle by LMM approach β ˆREWLS The p 1estmated parameter vector by usng REWLS regresson b b 0 b 1 The ntercept parameter for the n-control PA The slope parameter for the n-control PA The quadratc parameter for the n-control PA The ntercept parameter for the out-of-control PA The slope parameter for the out-of-control PA The quadratc parameter for the out-of-control PA A vector of random effects that represent the eblups for the th profle The random ntercept effect for the th profle The random slope effect for the th profle b The random quadratc effect for the th profle f. True PA profle functon. f True th profle functon G The q q H h MVE1 y Hat matrx of X covarance matrx for the random effects b The th dagonal element of H Z The MVE center estmator for Z y xv

15 MVE m 1 m n y Z The MVE scale matrx estmator for Z y R A n n Number of the n-control profles Number of the total profles n HDS Number of observatons covarance matrx for the random error ε r A n1vector of resduals r rs The resdual for the th observaton The absolute scaled resdual for the th observaton T Hotellng's T statstc for or the th tme perod T Hotellng's MVE, T Hotellng's MCD, T statstcs for or the th tme perod based on MVE T statstc for or the th tme perod based on MCD T P1, Hotellng s T statstcs based on parametrc ftted value T P, Hotellng s T statstcs based on parametrc eblups T NP, Hotellng s T statstcs based on P-splne ftted value T NP1, Hotellng s T statstcs based on P-splne eblups t ˆ V V ˆD A vector of random effects represents the coeffcents for splne component Estmator of varance-covarance matrx The successve dfference estmator of varance-covarance matrx V The n n covarance matrx for the response vector y V ˆMVE Estmator of varance-covarance matrx based on MVE V ˆMCD Estmator of varance-covarance matrx based on MCD V ˆP The pooled sample estmator of varance-covarance matrx W The n ndagonal weght matrx w X The th dagonal element of W A desgn matrx xv

16 T x X The th row of desgn matrx X The n p matrx of explanatory varables for the th profle x j The fxed regressor for the th j observaton from the th profle μ A n 1estmated mean vector for the th tme perod ˆ μˆ MCD An estmated mean vector for the th tme perod based on MVE μ ˆ MVE An estmated mean vector the th tme perod based on MVE ˆ P PS, y A vector of parametrc ftted value for the th profle ˆ p s PS, y A vector of p-splne ftted value for the th profle ˆ p s PA y A vector of p-splne ftted value for the PA profle y ˆ PA A vector of parametrc ftted value for the PA profle y The n 1response vector for the th profle y j Z y The response value for the The nk th j observaton from the th profle matrx contanng only the k regressor varables Z The n pmatrx formed by augmentng the vector y to Z Z T z The n q matrx of explanatory varables for the th profle The th row of matrx Z T z y, The th row of matrx. Z y True th profle smooth functon ε j The random error term for the th profle The random error for the th j observaton from the th profle The smooth parameter for the penalzed regresson xv

17 Chapter 1. Introducton and Motvaton I n statstcal analyss, the observed data often does not fully conform to statstcal model assumptons. For example, as stated n Hampel et al. (1986) routne data are thought to contan 1% to 10% gross errors. Because of these errors, robust estmaton plays an mportant role n statstcal analyss. For example, n a regresson study, the abnormal data ponts can severely dstort the estmates and the true relatonshp between the covarates and the response. Consequently, the model s predcton ablty s smlarly dstorted. In other applcatons, such as n statstcal process control (SPC), robust statstcs are also provded so that the control lmts based on these statstcs are not dstorted by the abnormal measurements n the hstorcal data set (HDS). 1.1 Robust Estmaton n Regresson It s known that the regular ordnary least squares (OLS) estmator lacks resstance to as lttle as one unusual observaton. The correspondng coeffcents and ther standard errors, predctons, dagnostcs, hypothess tests, and other numercal measures can all become very msleadng due to a sngle anomalous observaton. Robust procedures are desgned to capture the general trend of the data n the presence of unusual data. Most of the robust regresson methodologes were provded by the early 1980 s. For example, M regresson (Huber (1981)), and bounded nfluence (BI) (Huber (1981)) regresson work well n the presence of low leverage outlers and at least one hgh nfluence pont, respectvely. However, they are unable to combat a small percentage of outlers. Repeated samplng based methods, such as Least medan squares (LMS) (Rousseeuw (1984)) regresson and least trmmed squares (LTS) (Ruppert and Carroll (1980)) regresson, on the other hand, are examples of hgh breakdown estmators as they possess the ablty to provde reasonable parameter estmates wth as much as 50% 1

18 of the data beng contamnated. Poor effcency and numercal/computatonal senstvty wth large datasets has typcally led to ther prmary use as an ntal estmator feedng nto other robust procedures such as M or BI estmators. Examples nclude Mallows 1- step (M1S) regresson (Smpson et al. (199)) and Schweppe s 1-step (S1S) regresson (Coakley and Hettmansperger (1993)), whch are one-step adjustments of LTS that ncrease effcency versus the LTS estmator. However, two vrtually dentcal LTS estmates may yeld dramatcally dfferent M1S (or S1S) estmators (Lawrence (003)), thereby llustratng a potental negatve ssue wth repeated samplng based methods. Another hgh breakdown one-step estmaton method s due to Gervn and Yoha (00). Ther robust and effcent weghted least square estmate (REWLS) procedure attans full asymptotc effcency wth the assumpton of normally dstrbuted random errors. However, the REWLS, on the average, fals to correctly dentfy the good and bad hgh leverage ponts when the error term s not deally normally dstrbuted (Lawrence (003)). A robust, effcent, hgh breakdown robust regresson methodology was proposed by Lawrence (003), called the cluster-based bounded nfluence regresson (CBI) method, whch combned a sutable clusterng method wth the bounded nfluence regresson method. In ths research, a revsed verson of ths method s presented and evaluated n Chapter. 1. Robust estmaton n SPC As prevously mentoned, statstcal data sets frequently contans errors. Not surprsngly, such data anomales can occur n the statstcal process control settng. Robust estmaton methods have also been proposed n SPC to avod the msleadng results from these errors Phase I and Phase II n SPC The SPC nvolves two phases, Phase I and Phase II. In Phase I, a HDS s analyzed to determne whch data ponts are from an n-control process and whch ones, n any, are from an out-of-control process. Data ponts determned to be from an out-ofcontrol process are usually removed and the remanng data ponts from the n-control

19 process are used to calculate the statstcs needed for computng control lmts used n Phase II analyss. In Phase II, future observatons are montored by usng the control lmts calculated from Phase I estmates to determne f the process contnues to be ncontrol. The control lmts n Phase I wll drectly affect the performance of Phase II analyss. Accurate control lmts n Phase I are desrable for the Phase II analyss. Ths research also focuses on the estmaton n Phase I and how these estmates affect performance n Phase II. 1.. Robust estmaton n Phase I Recall that the purpose of the Phase I analyss s to examne the HDS and obtan the control lmts that are suffcently accurate for Phase II montorng. However, lke the estmates of regresson analyss, the statstcs used for control lmts obtaned from the HDS can be pulled n the drecton of the multvarate outlers f the HDS contans data from an out-of-control process. Robust estmaton technques are used to obtan the control lmts that are not unduly nfluenced by unusual data ponts. Consequently, the control lmts wll be more accurate and effectve n Phase II analyss. In most prevous studes, products and processes were characterzed by ether unvarate qualty control data or multvarate qualty control data. Robust estmaton methods for unvarate qualty control data (such as those based on a medan or trmmed mean) are straghtforward and have receved attenton n past research (Rocke (1989); Tatum (1997); de Mast and Roes (004); Cal Mannng and Adams (005)). Robust methods for multvarate qualty control data are not as straghtforward, nor as easly mplemented. When dealng wth multvarate qualty control data, t s assumed that the HDS conssts of m tme ordered vectors that are ndependent of each other. Frequently the Hotellng s T statstcs s used to determne f a multvarate data pont results from an out-of-control process. In partcular, f each vector s of dmenson p and f μˆ denotes 3

20 a vector contanng p elements for the th tme perod, then the Hotellng's T statstc for the th tme perod s defned as m μˆ 1 where μ m T ˆ T μˆ μ V μˆ μ, 1,,..., m. (1.1) 1 and V ˆ s an estmator of the varance-covarance matrx V of μ ˆ (see secton 3 for more detals). The Hotellng s T s an example of a statstc that n not robust to outlyng observatons. One commonly used robust T statstc for multvarate data results by replacng the moment-based estmator of V, the one typcally used, by an estmator based on the mnmum volume ellpsod (MVE) estmator (Vargas (003)). The MVE estmator, frst proposed by Rousseeuw (1984), has been frequently used for the detecton of the multvarate outlers. The MVE estmator seeks to fnd the ellpsod of mnmum volume that covers a subset of at least half of the total data ponts. One well known algorthm for MVE estmator s provded by Rousseeuw and Leroy (1987) s an approxmate method usng a sub-samplng procedure. However, the problem of ths sub-samplng algorthm s that t lacks repeatablty and results n estmates wth poor effcency. An exact method to calculate the MVE estmator was later proposed by Cook et al. (1993) to avod the repeatablty problem. However, ths exact method s only computatonally feasble for small datasets (Cook et al. (1993)). Other computatonally feasble methods to fnd an approxmate MVE have been proposed. For example, Hawkns (1994) proposed a feasble soluton algorthm (FSA). Also, methods to fnd the MVE based on a heurstc search algorthms were proposed by Woodruff and Rocke (1993). The th tme perod based on MVE s denoted by T (Vargas (003)) MVE, T statstc for the T ˆ μˆ μˆ V μˆ μ ˆ, (1.) T 1 MVE, MVE MVE MVE 4

21 where μˆ MVE s the MVE estmator of multvarate mean and V ˆMVE s the MVE estmator of multvarate varance-covarance matrx. Another frequently used robust T statstc for multvarate data s based on the mnmum covarate determnant (MCD) estmator whch was also proposed by Rousseeuw (1984). The MCD estmator s obtaned by fndng the half set of the data ponts that gves the mnmum value of the determnant of the varance-covarance matrx. Smlar to the MVE estmator, there are both approxmate methods and exact methods to obtan the MCD estmates. For example, MCD estmates can be computed va the exact method provded by Cook et al. (1993). The sub-samplng approach of Rousseeuw and Leroy (1987) can be used to get an approxmate MCD estmate whch would have the same repeatablty ssue. The feasble soluton algorthm of Hawkns (1993) can be mplemented for the MCD, as shown by Hawkns (1994). An mproved verson of the feasble soluton algorthm for the MCD was proposed by Hawkns and Olve (1999). The (Vargas (003)) T statstc for the th tme perod based on MCD s denoted by T MCD, T ˆ T μˆ μˆ V μˆ μ ˆ, (1.3) MCD, MCD MCD MCD where μˆ MCD s the he MCD estmator of multvarate mean and V ˆMCD s the MCD estmator of multvarate covarance matrx. Estmators based on the MVE and MCD are powerful n detectng a reasonable number of outlers as demonstrated by Jensen et al. (007) and Yanez et al. (010)). Other robust estmators have been proposed for the multvarate SPC settng. Yanez et al. (010) proposed a T statstc usng S estmators based on the bweght functon for the locaton and dsperson parameters when montorng multvarate ndvdual observatons. They showed that ths method outperforms the MVE estmators for a small number of observatons. Other robust estmators defned usng trmmng, proposed by Alfaro and Ortega (008) and Chenour et al. (009) and referred to as reweghted mnmum covarance determnant (RMCD) 5

22 estmators, have been shown to provded hghly robust and effcent estmators of the mean vector and covarance matrx. 1.3 Profle Montorng n SPC Another more recent approach to SPC occurs when the product or process can be characterzed by a profle or a relatonshp between a response varable and one or more explanatory varables nstead of unvarate or multvarate vectors. The profle montorng process n Phase I s frst to represent the profles n the HDS by some proper modelng technque, and use some approprate method to dentfy those profles from the n-control process, and those, f any, from the out-of-control process. As a fnal step, these n-control profles are used to obtan the control lmts for future profle montorng n real-tme durng Phase II. Further detals concernng the profle montorng lterature wll be gven n Chapter 3. Ths dssertaton wll focus on montorng the profles usng the mxed model where the mxed model s frst ft to the profles n the HDS usng the mxed model technque to estmate the populaton average (PA) profle and the proper varancecovarance matrx. See chapter 3 for more detals concernng the mxed model appled to profle montorng. 1.4 Motvaton When usng the mxed model technque for the profle montorng, the frst step s to estmate the PA profle and use ths estmate n calculatng the Hotellng s T for each profle to determne whether ths profle results from the n-control process. However, n the typcal mxed model analyss, the estmated PA profle s based on all profles n the HDS ncludng the profles from the out-of-control process. For example, f there s large amount of profles that from the out-of-control process or small amount whch are far away from the n-control process, the estmated PA profle based on the HDS would lkely be pulled n the drecton of the out-of-control process. Addtonally, the correspondng varance-covarance matrx, needed n computng the 6

23 T statstc for each profle, wll be smlarly dstorted. Consequently, the T statstcs wll be msleadng and the n-control lmts used n Phase I wll be unable to properly separate those profles belongng to the n-control process from those belongng to the out-of-control process. In ths research, a new profle montorng methodology n Phase I whch ncorporates a cluster method wll be utlzed to obtan the estmated PA profle. Ths new cluster-based method wll be demonstrated to be more robust to the profles from the out-of-control process than the exstng non-cluster-based method (see (Jensen et al. (008)) for a thorough dscusson of the non-cluster-based method). Further, t s known that the performance of the Phase I analyss can be measured n terms of correctly dentfyng the unstable process or, equvalently, the presence of profles from the out-of-control process n the HDS. An mportant crteron used to measure the success of a Phase I method at detectng an unstable process s the probablty of sgnal (POS), the probablty of detectng at least one profle from the outof-control process n the HDS. However, the POS only measures the ablty of detectng the presence of the profle from the out-of-control process n the HDS and does not gve any nformaton about whether the classfcaton of profles nto the two categores of ncontrol and out-of-control s correctly specfed. A smple example s presented to llustrate that the POS s not suffcent to measure the performance of Phase I analyss. In ths example, t assumed that there are total m=1 profles n the HDS of whch nne are from the n-control process whle the other three are from the out-of-control process. The n-control profles were generated from the lnear mxed model y ( b ) ( b ) x ( b ) x, 1,,..., m, j 1,,..., n, (1.4) j j j j 1 and the out-control profles were generated as 7

24 y b b x b x (1.5) j ( 0 0 ) ( 1 1 ) j ( ) j j, m1 1,..., m, j 1,,..., n, where the random effects are defned as b b1 ~ MN0, 0 1 0, b 0 0 ε ~ MN 0, I, (here MN represents the multvarate normal dstrbuton) and wth fxed effects β T 1.5, 7, for the profles from the n-control process and β T 1.875, 14.5, 3.5 Addtonally, m1 9, m1, n8, for the profles from the out-of-control process. and 4. Thus, profles through 9 represent profles from the n-control process and profles 10, 11, and 1 represent profles from the out-of-control process. The 1 true profles, based on the actual parameter values and random effects, are plotted n Fgure 1.1 where the blue curves represent the profles from the n-control process whle the red curves represent the profles from the out-of-control process. It s dffcult to dstngush the profles from the n-control and out-of-control process by lookng only at the plot. 8

25 6 y x Fgure 1.1: The plot of 1 true profles Usng the T statstc, both the exstng non-cluster-based method and the proposed cluster-based method sgnaled, ndcatng that both methods detected a change n the process. However, the non-cluster-based method sgnaled due to msclassfyng the 6 th profle as the out-of-control process. The cluster-based method, on the other hand, correctly classfed the 10 th, 11 th and 1 th profles as from the out-of-control process and classfed the other nne profles as from the n-control process. The estmates of the PA parameters from the non-cluster-based method (Jensen et al. (008)) are β ˆT 16.61, 9.709,.178 proposed method are β T parameters, β T 1.5, 7,, whle the estmates of the PA parameters from the ˆ , ,.07. Compared to the true PA the estmates of the non-cluster-based method (Jensen et al. (008)) are severely dstorted whle the proposed method provded PA estmates much closer to the true values, as expected. 9

26 Chapter. Cluster-Based Bounded Influence Regresson R ecall that robust regresson estmaton plays an mportant role n statstcal analyss. In ths chapter, a new robust and effcent regresson method, called the cluster-based bounded nfluence (CBI) regresson (Lawrence (003)) wll be revewed. Addtonally, the CBI regresson algorthm wll be updated by usng the modern R package and compared to other exstng robust regresson methods..1 Revew of Robust Regressons The detecton of observatons not conformng to a gven statstcal model s a common goal of the data analyst. Many methods have been proposed to ad n the detecton of such nonconformng observatons or outlers. For example, n a recent paper by Fan et al. (01a), a herarchcal clusterng method was employed that greatly mproves the ablty of certan multvarate control chart technques at detectng the presence of multvarate outlers. Detectng unusual observatons n the multple regresson settng s a far more complcated process however and many technques have been ntroduced (see secton ) for ths purpose. As n the Fan et al. (01a) paper, the use of clusterng methodology can mprove the ablty of a technque to dentfy unusual data ponts n the multple regresson settng. The use of clusterng to mprove the propertes of the bounded-nfluence regresson method s demonstrated n ths chapter. In buldng a lnear regresson model, a sngle unusual observaton can dramatcally nfluence ordnary least squares (OLS) estmaton. Wth OLS, a sngle low leverage outler can have a dramatc effect on the estmaton of the general trend, especally concernng the ntercept. However, a sngle hgh nfluence pont, or hp, can have a dramatc effect on any or all parameter estmates. The jont nfluence of several hps can have an even greater deleterous mpact on parameter estmates. These 10

27 coeffcents and ther standard errors, along wth predctons, dagnostcs, hypothess tests, and other numercal measures can each become very msleadng wthout a thorough exploratory data analyss accompanyng t. Ths chapter focuses on the study of robust, hgh breakdown lnear regresson modelng. As ths dscplne s extremely computatonally ntensve, much of the publshed work n ths area has occurred snce the early 1980 s. Of course, some deas were proposed much earler, but generally lmted n actual applcaton. Methods such as M regresson (Huber and Ronchett (009)), and bounded nfluence (BI) (Huber and Ronchett (009)) regresson work well n the presence of low leverage outlers and at most one hp respectvely. However, they are unable to combat a small percentage of outlers. Least medan of squares (LMS) (Rousseeuw (1984)) regresson and least trmmed squares (LTS) (Ruppert and Carroll (1980)) regresson, on the other hand, are examples of hgh breakdown estmators as they possess the ablty to provde parameter estmates wth as much as 50% of the data beng contamnated. Poor effcency and numercal/computatonal senstvty wth large datasets has typcally led to ther prmary use as an ntal estmator feedng nto other robust procedures such as M or BI estmators. Examples nclude Mallows 1-step (M1S) regresson (Smpson et al. (199)) and Schweppe s 1-step (S1S) regresson (Coakley and Hettmansperger (1993)), whch are one-step adjustments of LTS that ncrease effcency versus the LTS estmator. However, two vrtually dentcal LTS estmates may yeld dramatcally dfferent M1S (or S1S) estmators (Lawrence (003)), thereby llustratng a potental negatve ssue wth repeated samplng based methods. Another hgh breakdown one-step estmaton method s due to Gervn and Yoha (00). Ther robust and effcent weghted least square estmate (REWLS) procedure attans full asymptotc effcency wth the assumpton of normally dstrbuted random errors. However, accordng to the Monte Carlo study n secton.5, the REWLS, on the average, fals to correctly dentfy the good and bad hgh leverage ponts when the error term s not deally normally dstrbuted. 11

28 The CBI method was ntroduced by (Lawrence et al. (013)) as a new regresson methodology that obtans compettve, robust, effcent, hgh breakdown regresson parameter estmates. Addtonally, ths method provdes an nformatve summary regardng possble multple outler structure. A smple example below gves the comparson of the CBI regresson method to several exstng robust procedures when the data has more than one hgh leverage pont. The data set has 11 observatons wth observatons 1-8 generated from the lnear model where ~ 0, 5, and wth the regressor varable generated va ~10,0. Observatons 9-11 were arbtrary added to reflect a mld nfluence pont and two hps, respectvely. y CBI ft LS ft (usng data 1-8) 6 REWLS ft LTS ft S1S ft 9 LS ft x Fgure.1: The ftted lne of the dfferent robust methods The data are plotted n Fgure 1.1 where the outler (9) and the two hps (10, 11) are clearly seen. Regardng the collecton of fts also dsplayed n Fgure 1.1, only the 1

29 proposed method (CBI) detects the correct trend of the uncontamnated data. Each of the other estmators was dramatcally msled by the jont nfluence of these three arbtrary ponts, resultng n a postve slope estmate when the true underlyng slope s negatve.. Revew of Selected Robust Regresson Methods As the bass for lnear regresson analyss, the statstcal model s restrcted to be of the form, wth the response varable,, beng explaned as a lnear functon of the regressor varables,, 1,, plus a random error component,, for each of the observatons, 1,. Gven the computatonal nature of the proposed method, clarty n notaton becomes qute mportant and, therefore, ths paper offers suffcent detal. The lnear model also can be wrtten matrx form as or element wse as 1 1 1, where ~,,. There are 1 unknown parameters that form the 1 parameter vector, whch s to be estmated by the 1 vector. Ths subsequently yelds the estmated fts as. Further, the 1 vector of resduals s computed as, wth representng the resdual for the observaton. Also, defne as the matrx 13

30 contanng only the regressor varables, wth representng the matrx formed by augmentng the vector to. To accommodate reference to ndvdual observatons, let the row of be denoted by the 1 row vector and the 1 row vector denote the row of. When the response varable s ncluded, the notaton for row of s,. Consder the objectve functon mn, for the OLS estmator, whch may be wrtten as mn, wth. In robust regresson, the functon can be selected to ether down weght or bound any argument rsng from unusual observatons. Ths becomes the bass for M regresson (Huber and Ronchett (009)) whch has the objectve functon mn, where the -functon s chosen to be bounded and odd-symmetrc, represents an arbtrary pont n the p-dmenson estmaton space, and where s some approprately chosen estmate of. The choce for s generally lmted to robust measures of scale. One such estmator that s frequently used s the medan absolute devaton (MAD), where med med. 14

31 Takng dervatves wth respect to leads to solvng altered normal equatons, 0, where and s the soluton for. These altered normal equatons form a system of nonlnear equatons that may be solved by a number of popular numercal methods ncludng (1) Newton-Raphson and () teratvely reweghted least squares (IRLS), the later used n ths paper. At convergence, IRLS produces the M regresson parameter estmator, where s the dagonal weght matrx, wth dagonal elements denoted as. Each weght,, determnes how much emphass the regresson wll place on a partcular observaton. A large weght (near 1) should ndcate a good observaton. An outler or a hp, on the other hand, should get a reduced weght or perhaps even a zero weght. In M regresson the weght s calculated as resdual. Typcally, the larger s the resdual, the smaller s the weght., a functon of the A sngle hp wll pull the ftted M regresson lne toward t to make the correspondng resdual small, thus that weght wll be large. Ths means that M regresson can be domnated by a sngle hp. One soluton to ths problem s to use bounded nfluence (BI) regresson. Here, the name refers to boundng the nfluence that the pont has n the regressor-space. One altered normal equaton form, called the Schweppe form (Staudte (1990)), s wrtten as. 0 15

32 Here, s chosen so that the effect of a large s reduced f, s a hp. One choce s to have, where s the dagonal element of the socalled hat matrx,, wth. The value s referred to as the BI weght. The BI regresson estmator can be obtaned n exactly the same manner as the M-estmator va IRLS, as. However, the weght now has the form, where s the scaled resdual. Specfcally, the BI weght depends on both the resdual and the locaton of n the regressor-space. Whle M and BI estmators provde an mprovement over OLS f the data has an outler or hp, respectvely, they cannot provde protecton aganst data wth even modest amounts of contamnaton. Ruppert and Carroll (1980) ntroduced LTS to combat ths stuaton, defnng the objectve functon as mn, representng the sum of the smallest squared resduals where s generally taken to be 1, wth [.] denotng the greatest nteger functon. Snce ths objectve functon s not dfferentable, no closed-form expresson exsts for the LTS estmator. However, algorthms are avalable that gve the exact LTS estmator for the locaton model, the exact LTS estmator for the regresson model based on small data sets, and a relatvely accurate LTS estmator for large data sets. The algorthmc detals may be found n Rousseeuw and Van Dressen (006). Hstorcally, methods lke LTS (and ts 16

33 predecessor LMS) had nvolved repeated samplng computatonal methods ncorporatng probablstc arguments. One problem wth hgh breakdown estmators such as LTS s poor effcency due to large varablty assocated wth estmated coeffcents. The remedy for ths poor effcency s to use the LTS estmator, or another hgh breakdown estmator, as an ntal estmator, wth the generalzed M estmator form to obtan a one-step generalzed M estmator. The S1S estmator s one such estmator and results from solvng the altered normal equatons. 0 A Gauss-Newton approxmaton usng a frst-order Taylor seres expanson about the ntal estmate yelds a one-step mprovement of the form. None of the above estmators acheve full effcency at the normal dstrbuton whle smultaneously mantanng a breakdown bound close to 50%. Gervn and Yoha (00) proposed an adaptve one-step estmaton method that attans full asymptotc effcency at the normal error dstrbuton whle at the same tme has a hgh breakdown bound and small maxmum bas. Ther method, referred to as the REWLS estmator, s a weghted LS estmator computed from an ntal hgh breakdown estmate, and a robust scale estmate such as MAD. However, rather than deletng those observatons whose absolute scaled resduals are greater than a gven value, the procedure wll keep a number of observatons, correspondng to the smallest values of the absolute scaled resdual, 1,. The has the property that n large samples under normalty t wll have 1, whch means a vanshng fracton of observatons wll 17

34 be deleted and full effcency wll be attaned (Maronna et al. (006)). The REWLS estmator can be obtaned as 0 0, where s the dagonal matrx wth Cluster-Based Bounded Influence Regresson The CBI regresson methodology offers a new phlosophcal approach to the robust regresson arena and conssts of two prmary phases, the cluster phase and the regresson phase. Frst, an ntal hgh-breakdown regresson estmator s produced va a sophstcated clusterng algorthm. Second, refnement of ths ntal regresson estmator s nvestgated and possbly mplemented under a carefully structured use of BI regresson. The ratonale behnd ths second phase s to allow for a possble mprovement n effcency, especally when the level of data contamnaton does not come close to approachng 50%. The CBI regresson method has been named clusterbased bounded nfluence regresson, or CBI for short, to reflect the nature of ts two phases computaton process. The cluster phase begns wth hgh-breakdown locaton and scale estmaton of the dmensonal regressor-response space. A specal set of ponts, referred to as the set of anchor ponts, s computed that together represent the general trend of the data. Each observaton s then characterzed by the OLS regresson ft that would occur f ths ndvdual observaton s augmented to the anchor ponts. Hgh breakdown locaton and scale estmaton of ths set of n OLS coeffcents provdes the foundaton for the constructon of the smlarty matrx (techncally, a dstance matrx). The desre for a 18

35 tght, compact sphere of smlar coeffcents exhbtng a common trend descrpton s the bass for the selecton of complete lnkage herarchcal clusterng (Lawrence (003)) as the default method and clusterng s performed untl an ntal man cluster of at least 1 observatons are formed. Two aspects worth mentonng are that (1) the OLS senstvty to a sngle pont s beng exploted to our advantage n evaluatng the data, and () the anchor ponts serve to allevate repeated samplng (as requred by other 50% breakdown pont estmators such as LTS) and the use of mnmal szed elemental subsets that must be n general poston (.e. no sngularty ssues). A smple OLS ft to ths man cluster s used as the bass for the possble adjustment of the anchor set metrc to more drectly relate to the general trend. A revsed smlarty matrx s constructed, wth a second cluster analyss yeldng a revsed, fnal man cluster and mnor clusters. The determnaton of ths cluster classfcaton structure completes the cluster phase. To begn the regresson phase, the ntal CBI estmator s smply the OLS estmate of the man cluster observatons. A hgh breakdown scale estmate s then computed. Hgh breakdown BI leverage weghts are computed from the regressor-space only. Usng only the man cluster, a BI regresson updates the ntal CBI estmator. To ths pont, the mnor clusters have not been utlzed n the computaton of the CBI regresson estmator and ther observatons are sad to be nactve. The actvaton process for these remanng observatons has two prmary stages. Frst, a statstc s computed for each of the mnor clusters, where 1,,,. A canddate mnor cluster s one such that for the cutoff value. Then, a sngle statstc, denoted by, s computed for the unon of all canddate mnor clusters. If s small enough, then the fnal CBI estmator s determned from ths actvaton process (provded at least one mnor cluster observaton obtaned a nonzero weght). Otherwse, the mnor clusters do not play an actve role (.e. all observatons possess a zero weght) and there s no further update to the current CBI regresson 19

36 estmator. A fnal CBI scale estmate s computed once the fnal CBI regresson estmator has been determned. The detaled algorthm consstng of ten nterrelated steps for the CBI estmator s presented below. Steps 1 through 3 represent the cluster phase and steps 4 through 10 represent the regresson phase. Notaton s ntroduced as needed. Step1 Perform mnmum volume ellpsod, MVE, estmaton (see Rousseeuw and Leroy (003)) of ; determne the 1 anchor pont matrx, Ω. These ponts nclude, the MVE locaton vector for, and the end ponts of the ellpsod of constant dstance., from based on the metrc, the MVE scale matrx estmator for, the par of end ponts s determnate by the expresson.,, where and s the egenvalue and egenvector of, respectvely. Step Determne the base regresson estmator matrx. The row of, denoted by the 1 vector, s defned as the estmator that results from an OLS regresson analyss of the set of anchor ponts supplemented by the addton of the observaton n the dataset. Perform an MVE estmaton of, treatng each row of as an observaton n dmensons. Step 3 Usng as the dstance metrc, compute a smlarty matrx whose elements are defned to be. 0

37 Perform a cluster analyss on the dataset gven the smlarty matrx and usng complete lnkage to obtan the tghtest cluster of vectors. The ntal man cluster,, s defned at the frst nstance of whch a sngle cluster conssts of at least 1 observatons. The remanng observatons fall nto one of mnor clusters that are labeled as,,,. Step 4 Compute the OLS estmate usng the data ponts n. A prelmnary estmate of scale,, s defned to be the MAD of all resduals where. Determne the set of observatons,, such that : Step 5 Usng the data ponts n, compute the 1 mean vector, of the regressor data n,and covarance matrx, usng standard moments estmators, of the regressor data n, defne the 1 robust regressor dstance vector contanng the elements. Step 6 Mmc step 1 to step 3 by replacng the MVE statstcs wth the weghted mean and covarance estmates for the data to get the new ntal man cluster,, and mnor clusters,...the weght for the data pont s defne as 1

38 1, 0,, Compute the ntal CBI estmator,, usng WLS and subsequently updated the scale estmate as MAD of all new resduals. Step 7 Determne the 1 BI leverage weght vector,, whose elements are defned as 1, mn 1,.,, Perform BI regresson usng only the man cluster,, to obtan, at convergence of IRLS, the estmate. Step 8 Let represent any mnor cluster and be the sze of, and let, be the subvector set of that corresponds only to the and observatons. Perform the BI regresson wth these new data ponts and leverage weght vector, to obtan the estmate at convergence. A statstc s then computed va,, where, represent fts when usng both and observatons and represents fts when usng just observatons. Ths statstc s computed for each of the mnor clusters.

39 Step 9 Defne the scalar to represent the maxmum allowable statstc. Then, let represent the unon of all actvaton canddate mnor sets,.e. δ and I w 0. Provded that, then wth, and, as nputs to obtan the BI regresson estmate and. The default value of s 4. Step 10,, δ and J w 0 The CBI scalar estmator s then updated as the MAD of new resduals. The fnal CBI weghts for the ndvdual observatons are smply the observatons weghts at convergence of BI regresson used to compute. Three scale estmators are provded by the CBI procedure, specfcally, and. s the MAD of the CBI resduals. Gven the CBI scale estmate, the BI leverage weght vector, and, a robust mean square error that mmcs the robust ANOVA scale estmate ntroduced by Brch (199) s found va CBI., CBI Usng the effectve sample sze, (Brch (010)), a modfed verson of the robust analyss of varance scale estmate then becomes 3

Wishing you all a Total Quality New Year!

Wishing you all a Total Quality New Year! Total Qualty Management and Sx Sgma Post Graduate Program 214-15 Sesson 4 Vnay Kumar Kalakband Assstant Professor Operatons & Systems Area 1 Wshng you all a Total Qualty New Year! Hope you acheve Sx sgma

More information

Some Advanced SPC Tools 1. Cumulative Sum Control (Cusum) Chart For the data shown in Table 9-1, the x chart can be generated.

Some Advanced SPC Tools 1. Cumulative Sum Control (Cusum) Chart For the data shown in Table 9-1, the x chart can be generated. Some Advanced SP Tools 1. umulatve Sum ontrol (usum) hart For the data shown n Table 9-1, the x chart can be generated. However, the shft taken place at sample #21 s not apparent. 92 For ths set samples,

More information

S1 Note. Basis functions.

S1 Note. Basis functions. S1 Note. Bass functons. Contents Types of bass functons...1 The Fourer bass...2 B-splne bass...3 Power and type I error rates wth dfferent numbers of bass functons...4 Table S1. Smulaton results of type

More information

NAG Fortran Library Chapter Introduction. G10 Smoothing in Statistics

NAG Fortran Library Chapter Introduction. G10 Smoothing in Statistics Introducton G10 NAG Fortran Lbrary Chapter Introducton G10 Smoothng n Statstcs Contents 1 Scope of the Chapter... 2 2 Background to the Problems... 2 2.1 Smoothng Methods... 2 2.2 Smoothng Splnes and Regresson

More information

A Semi-parametric Regression Model to Estimate Variability of NO 2

A Semi-parametric Regression Model to Estimate Variability of NO 2 Envronment and Polluton; Vol. 2, No. 1; 2013 ISSN 1927-0909 E-ISSN 1927-0917 Publshed by Canadan Center of Scence and Educaton A Sem-parametrc Regresson Model to Estmate Varablty of NO 2 Meczysław Szyszkowcz

More information

X- Chart Using ANOM Approach

X- Chart Using ANOM Approach ISSN 1684-8403 Journal of Statstcs Volume 17, 010, pp. 3-3 Abstract X- Chart Usng ANOM Approach Gullapall Chakravarth 1 and Chaluvad Venkateswara Rao Control lmts for ndvdual measurements (X) chart are

More information

Support Vector Machines

Support Vector Machines /9/207 MIST.6060 Busness Intellgence and Data Mnng What are Support Vector Machnes? Support Vector Machnes Support Vector Machnes (SVMs) are supervsed learnng technques that analyze data and recognze patterns.

More information

Subspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points;

Subspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points; Subspace clusterng Clusterng Fundamental to all clusterng technques s the choce of dstance measure between data ponts; D q ( ) ( ) 2 x x = x x, j k = 1 k jk Squared Eucldean dstance Assumpton: All features

More information

y and the total sum of

y and the total sum of Lnear regresson Testng for non-lnearty In analytcal chemstry, lnear regresson s commonly used n the constructon of calbraton functons requred for analytcal technques such as gas chromatography, atomc absorpton

More information

Outlier Detection based on Robust Parameter Estimates

Outlier Detection based on Robust Parameter Estimates Outler Detecton based on Robust Parameter Estmates Nor Azlda Aleng 1, Ny Ny Nang, Norzan Mohamed 3 and Kasyp Mokhtar 4 1,3 School of Informatcs and Appled Mathematcs, Unverst Malaysa Terengganu, 1030 Kuala

More information

CS 534: Computer Vision Model Fitting

CS 534: Computer Vision Model Fitting CS 534: Computer Vson Model Fttng Sprng 004 Ahmed Elgammal Dept of Computer Scence CS 534 Model Fttng - 1 Outlnes Model fttng s mportant Least-squares fttng Maxmum lkelhood estmaton MAP estmaton Robust

More information

6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour

6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour 6.854 Advanced Algorthms Petar Maymounkov Problem Set 11 (November 23, 2005) Wth: Benjamn Rossman, Oren Wemann, and Pouya Kheradpour Problem 1. We reduce vertex cover to MAX-SAT wth weghts, such that the

More information

Empirical Distributions of Parameter Estimates. in Binary Logistic Regression Using Bootstrap

Empirical Distributions of Parameter Estimates. in Binary Logistic Regression Using Bootstrap Int. Journal of Math. Analyss, Vol. 8, 4, no. 5, 7-7 HIKARI Ltd, www.m-hkar.com http://dx.do.org/.988/jma.4.494 Emprcal Dstrbutons of Parameter Estmates n Bnary Logstc Regresson Usng Bootstrap Anwar Ftranto*

More information

Simulation: Solving Dynamic Models ABE 5646 Week 11 Chapter 2, Spring 2010

Simulation: Solving Dynamic Models ABE 5646 Week 11 Chapter 2, Spring 2010 Smulaton: Solvng Dynamc Models ABE 5646 Week Chapter 2, Sprng 200 Week Descrpton Readng Materal Mar 5- Mar 9 Evaluatng [Crop] Models Comparng a model wth data - Graphcal, errors - Measures of agreement

More information

Lecture 5: Multilayer Perceptrons

Lecture 5: Multilayer Perceptrons Lecture 5: Multlayer Perceptrons Roger Grosse 1 Introducton So far, we ve only talked about lnear models: lnear regresson and lnear bnary classfers. We noted that there are functons that can t be represented

More information

A mathematical programming approach to the analysis, design and scheduling of offshore oilfields

A mathematical programming approach to the analysis, design and scheduling of offshore oilfields 17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 A mathematcal programmng approach to the analyss, desgn and

More information

An Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation

An Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation 17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 An Iteratve Soluton Approach to Process Plant Layout usng Mxed

More information

Lecture 4: Principal components

Lecture 4: Principal components /3/6 Lecture 4: Prncpal components 3..6 Multvarate lnear regresson MLR s optmal for the estmaton data...but poor for handlng collnear data Covarance matrx s not nvertble (large condton number) Robustness

More information

Estimating Regression Coefficients using Weighted Bootstrap with Probability

Estimating Regression Coefficients using Weighted Bootstrap with Probability Norazan M R, Habshah Md, A H M R Imon Estmatng Regresson Coeffcents usng Weghted Bootstrap wth Probablty NORAZAN M R, HABSHAH MIDI AND A H M R IMON Faculty of Computer and Mathematcal Scences, Unversty

More information

Feature Reduction and Selection

Feature Reduction and Selection Feature Reducton and Selecton Dr. Shuang LIANG School of Software Engneerng TongJ Unversty Fall, 2012 Today s Topcs Introducton Problems of Dmensonalty Feature Reducton Statstc methods Prncpal Components

More information

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision SLAM Summer School 2006 Practcal 2: SLAM usng Monocular Vson Javer Cvera, Unversty of Zaragoza Andrew J. Davson, Imperal College London J.M.M Montel, Unversty of Zaragoza. josemar@unzar.es, jcvera@unzar.es,

More information

An Optimal Algorithm for Prufer Codes *

An Optimal Algorithm for Prufer Codes * J. Software Engneerng & Applcatons, 2009, 2: 111-115 do:10.4236/jsea.2009.22016 Publshed Onlne July 2009 (www.scrp.org/journal/jsea) An Optmal Algorthm for Prufer Codes * Xaodong Wang 1, 2, Le Wang 3,

More information

FEATURE EXTRACTION. Dr. K.Vijayarekha. Associate Dean School of Electrical and Electronics Engineering SASTRA University, Thanjavur

FEATURE EXTRACTION. Dr. K.Vijayarekha. Associate Dean School of Electrical and Electronics Engineering SASTRA University, Thanjavur FEATURE EXTRACTION Dr. K.Vjayarekha Assocate Dean School of Electrcal and Electroncs Engneerng SASTRA Unversty, Thanjavur613 41 Jont Intatve of IITs and IISc Funded by MHRD Page 1 of 8 Table of Contents

More information

A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS

A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS Proceedngs of the Wnter Smulaton Conference M E Kuhl, N M Steger, F B Armstrong, and J A Jones, eds A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS Mark W Brantley Chun-Hung

More information

Problem Definitions and Evaluation Criteria for Computational Expensive Optimization

Problem Definitions and Evaluation Criteria for Computational Expensive Optimization Problem efntons and Evaluaton Crtera for Computatonal Expensve Optmzaton B. Lu 1, Q. Chen and Q. Zhang 3, J. J. Lang 4, P. N. Suganthan, B. Y. Qu 6 1 epartment of Computng, Glyndwr Unversty, UK Faclty

More information

Programming in Fortran 90 : 2017/2018

Programming in Fortran 90 : 2017/2018 Programmng n Fortran 90 : 2017/2018 Programmng n Fortran 90 : 2017/2018 Exercse 1 : Evaluaton of functon dependng on nput Wrte a program who evaluate the functon f (x,y) for any two user specfed values

More information

A Binarization Algorithm specialized on Document Images and Photos

A Binarization Algorithm specialized on Document Images and Photos A Bnarzaton Algorthm specalzed on Document mages and Photos Ergna Kavalleratou Dept. of nformaton and Communcaton Systems Engneerng Unversty of the Aegean kavalleratou@aegean.gr Abstract n ths paper, a

More information

Helsinki University Of Technology, Systems Analysis Laboratory Mat Independent research projects in applied mathematics (3 cr)

Helsinki University Of Technology, Systems Analysis Laboratory Mat Independent research projects in applied mathematics (3 cr) Helsnk Unversty Of Technology, Systems Analyss Laboratory Mat-2.08 Independent research projects n appled mathematcs (3 cr) "! #$&% Antt Laukkanen 506 R ajlaukka@cc.hut.f 2 Introducton...3 2 Multattrbute

More information

User Authentication Based On Behavioral Mouse Dynamics Biometrics

User Authentication Based On Behavioral Mouse Dynamics Biometrics User Authentcaton Based On Behavoral Mouse Dynamcs Bometrcs Chee-Hyung Yoon Danel Donghyun Km Department of Computer Scence Department of Computer Scence Stanford Unversty Stanford Unversty Stanford, CA

More information

Parallel matrix-vector multiplication

Parallel matrix-vector multiplication Appendx A Parallel matrx-vector multplcaton The reduced transton matrx of the three-dmensonal cage model for gel electrophoress, descrbed n secton 3.2, becomes excessvely large for polymer lengths more

More information

APPLICATION OF A COMPUTATIONALLY EFFICIENT GEOSTATISTICAL APPROACH TO CHARACTERIZING VARIABLY SPACED WATER-TABLE DATA

APPLICATION OF A COMPUTATIONALLY EFFICIENT GEOSTATISTICAL APPROACH TO CHARACTERIZING VARIABLY SPACED WATER-TABLE DATA RFr"W/FZD JAN 2 4 1995 OST control # 1385 John J Q U ~ M Argonne Natonal Laboratory Argonne, L 60439 Tel: 708-252-5357, Fax: 708-252-3 611 APPLCATON OF A COMPUTATONALLY EFFCENT GEOSTATSTCAL APPROACH TO

More information

Available online at ScienceDirect. Procedia Environmental Sciences 26 (2015 )

Available online at   ScienceDirect. Procedia Environmental Sciences 26 (2015 ) Avalable onlne at www.scencedrect.com ScenceDrect Proceda Envronmental Scences 26 (2015 ) 109 114 Spatal Statstcs 2015: Emergng Patterns Calbratng a Geographcally Weghted Regresson Model wth Parameter-Specfc

More information

Exercises (Part 4) Introduction to R UCLA/CCPR. John Fox, February 2005

Exercises (Part 4) Introduction to R UCLA/CCPR. John Fox, February 2005 Exercses (Part 4) Introducton to R UCLA/CCPR John Fox, February 2005 1. A challengng problem: Iterated weghted least squares (IWLS) s a standard method of fttng generalzed lnear models to data. As descrbed

More information

Machine Learning: Algorithms and Applications

Machine Learning: Algorithms and Applications 14/05/1 Machne Learnng: Algorthms and Applcatons Florano Zn Free Unversty of Bozen-Bolzano Faculty of Computer Scence Academc Year 011-01 Lecture 10: 14 May 01 Unsupervsed Learnng cont Sldes courtesy of

More information

Outline. Type of Machine Learning. Examples of Application. Unsupervised Learning

Outline. Type of Machine Learning. Examples of Application. Unsupervised Learning Outlne Artfcal Intellgence and ts applcatons Lecture 8 Unsupervsed Learnng Professor Danel Yeung danyeung@eee.org Dr. Patrck Chan patrckchan@eee.org South Chna Unversty of Technology, Chna Introducton

More information

Parameter estimation for incomplete bivariate longitudinal data in clinical trials

Parameter estimation for incomplete bivariate longitudinal data in clinical trials Parameter estmaton for ncomplete bvarate longtudnal data n clncal trals Naum M. Khutoryansky Novo Nordsk Pharmaceutcals, Inc., Prnceton, NJ ABSTRACT Bvarate models are useful when analyzng longtudnal data

More information

Unsupervised Learning

Unsupervised Learning Pattern Recognton Lecture 8 Outlne Introducton Unsupervsed Learnng Parametrc VS Non-Parametrc Approach Mxture of Denstes Maxmum-Lkelhood Estmates Clusterng Prof. Danel Yeung School of Computer Scence and

More information

Data Mining: Model Evaluation

Data Mining: Model Evaluation Data Mnng: Model Evaluaton Aprl 16, 2013 1 Issues: Evaluatng Classfcaton Methods Accurac classfer accurac: predctng class label predctor accurac: guessng value of predcted attrbutes Speed tme to construct

More information

Wavefront Reconstructor

Wavefront Reconstructor A Dstrbuted Smplex B-Splne Based Wavefront Reconstructor Coen de Vsser and Mchel Verhaegen 14-12-201212 2012 Delft Unversty of Technology Contents Introducton Wavefront reconstructon usng Smplex B-Splnes

More information

Classifier Selection Based on Data Complexity Measures *

Classifier Selection Based on Data Complexity Measures * Classfer Selecton Based on Data Complexty Measures * Edth Hernández-Reyes, J.A. Carrasco-Ochoa, and J.Fco. Martínez-Trndad Natonal Insttute for Astrophyscs, Optcs and Electroncs, Lus Enrque Erro No.1 Sta.

More information

Determining the Optimal Bandwidth Based on Multi-criterion Fusion

Determining the Optimal Bandwidth Based on Multi-criterion Fusion Proceedngs of 01 4th Internatonal Conference on Machne Learnng and Computng IPCSIT vol. 5 (01) (01) IACSIT Press, Sngapore Determnng the Optmal Bandwdth Based on Mult-crteron Fuson Ha-L Lang 1+, Xan-Mn

More information

Hermite Splines in Lie Groups as Products of Geodesics

Hermite Splines in Lie Groups as Products of Geodesics Hermte Splnes n Le Groups as Products of Geodescs Ethan Eade Updated May 28, 2017 1 Introducton 1.1 Goal Ths document defnes a curve n the Le group G parametrzed by tme and by structural parameters n the

More information

Smoothing Spline ANOVA for variable screening

Smoothing Spline ANOVA for variable screening Smoothng Splne ANOVA for varable screenng a useful tool for metamodels tranng and mult-objectve optmzaton L. Rcco, E. Rgon, A. Turco Outlne RSM Introducton Possble couplng Test case MOO MOO wth Game Theory

More information

Range images. Range image registration. Examples of sampling patterns. Range images and range surfaces

Range images. Range image registration. Examples of sampling patterns. Range images and range surfaces Range mages For many structured lght scanners, the range data forms a hghly regular pattern known as a range mage. he samplng pattern s determned by the specfc scanner. Range mage regstraton 1 Examples

More information

Proper Choice of Data Used for the Estimation of Datum Transformation Parameters

Proper Choice of Data Used for the Estimation of Datum Transformation Parameters Proper Choce of Data Used for the Estmaton of Datum Transformaton Parameters Hakan S. KUTOGLU, Turkey Key words: Coordnate systems; transformaton; estmaton, relablty. SUMMARY Advances n technologes and

More information

Mathematics 256 a course in differential equations for engineering students

Mathematics 256 a course in differential equations for engineering students Mathematcs 56 a course n dfferental equatons for engneerng students Chapter 5. More effcent methods of numercal soluton Euler s method s qute neffcent. Because the error s essentally proportonal to the

More information

Content Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers

Content Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers IOSR Journal of Electroncs and Communcaton Engneerng (IOSR-JECE) e-issn: 78-834,p- ISSN: 78-8735.Volume 9, Issue, Ver. IV (Mar - Apr. 04), PP 0-07 Content Based Image Retreval Usng -D Dscrete Wavelet wth

More information

The Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique

The Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique //00 :0 AM Outlne and Readng The Greedy Method The Greedy Method Technque (secton.) Fractonal Knapsack Problem (secton..) Task Schedulng (secton..) Mnmum Spannng Trees (secton.) Change Money Problem Greedy

More information

Analysis of Continuous Beams in General

Analysis of Continuous Beams in General Analyss of Contnuous Beams n General Contnuous beams consdered here are prsmatc, rgdly connected to each beam segment and supported at varous ponts along the beam. onts are selected at ponts of support,

More information

Course Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms

Course Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms Course Introducton Course Topcs Exams, abs, Proects A quc loo at a few algorthms 1 Advanced Data Structures and Algorthms Descrpton: We are gong to dscuss algorthm complexty analyss, algorthm desgn technques

More information

Why visualisation? IRDS: Visualization. Univariate data. Visualisations that we won t be interested in. Graphics provide little additional information

Why visualisation? IRDS: Visualization. Univariate data. Visualisations that we won t be interested in. Graphics provide little additional information Why vsualsaton? IRDS: Vsualzaton Charles Sutton Unversty of Ednburgh Goal : Have a data set that I want to understand. Ths s called exploratory data analyss. Today s lecture. Goal II: Want to dsplay data

More information

Biostatistics 615/815

Biostatistics 615/815 The E-M Algorthm Bostatstcs 615/815 Lecture 17 Last Lecture: The Smplex Method General method for optmzaton Makes few assumptons about functon Crawls towards mnmum Some recommendatons Multple startng ponts

More information

For instance, ; the five basic number-sets are increasingly more n A B & B A A = B (1)

For instance, ; the five basic number-sets are increasingly more n A B & B A A = B (1) Secton 1.2 Subsets and the Boolean operatons on sets If every element of the set A s an element of the set B, we say that A s a subset of B, or that A s contaned n B, or that B contans A, and we wrte A

More information

Learning the Kernel Parameters in Kernel Minimum Distance Classifier

Learning the Kernel Parameters in Kernel Minimum Distance Classifier Learnng the Kernel Parameters n Kernel Mnmum Dstance Classfer Daoqang Zhang 1,, Songcan Chen and Zh-Hua Zhou 1* 1 Natonal Laboratory for Novel Software Technology Nanjng Unversty, Nanjng 193, Chna Department

More information

Active Contours/Snakes

Active Contours/Snakes Actve Contours/Snakes Erkut Erdem Acknowledgement: The sldes are adapted from the sldes prepared by K. Grauman of Unversty of Texas at Austn Fttng: Edges vs. boundares Edges useful sgnal to ndcate occludng

More information

Cluster Analysis of Electrical Behavior

Cluster Analysis of Electrical Behavior Journal of Computer and Communcatons, 205, 3, 88-93 Publshed Onlne May 205 n ScRes. http://www.scrp.org/ournal/cc http://dx.do.org/0.4236/cc.205.350 Cluster Analyss of Electrcal Behavor Ln Lu Ln Lu, School

More information

Probability Base Classification Technique: A Preliminary Study for Two Groups

Probability Base Classification Technique: A Preliminary Study for Two Groups Mathematcal Theory and Modelng ISSN 4-5804 (Paper) ISSN 5-05 (Onlne) www.ste.org Probablty Base Classfcaton Technque: A Prelmnary Study for Two Groups Frday Znzendoff Okwonu,* Abdul Rahman Othman. Department

More information

Improved Methods for Lithography Model Calibration

Improved Methods for Lithography Model Calibration Improved Methods for Lthography Model Calbraton Chrs Mack www.lthoguru.com, Austn, Texas Abstract Lthography models, ncludng rgorous frst prncple models and fast approxmate models used for OPC, requre

More information

C. Markert-Hahn, K. Schiffl, M. Strohmeier, Nonclinical Statistics Conference,

C. Markert-Hahn, K. Schiffl, M. Strohmeier, Nonclinical Statistics Conference, Roche Pharma Producton Penzberg Practcal Applcatons of Statstcal Process Control C. Markert-Hahn, K. Schffl, M. Strohmeer, Roche Dagnostcs GmbH, Penzberg Operatonal Excellence Statstcs Nonclncal Statstcs

More information

Hierarchical clustering for gene expression data analysis

Hierarchical clustering for gene expression data analysis Herarchcal clusterng for gene expresson data analyss Gorgo Valentn e-mal: valentn@ds.unm.t Clusterng of Mcroarray Data. Clusterng of gene expresson profles (rows) => dscovery of co-regulated and functonally

More information

Unsupervised Learning and Clustering

Unsupervised Learning and Clustering Unsupervsed Learnng and Clusterng Why consder unlabeled samples?. Collectng and labelng large set of samples s costly Gettng recorded speech s free, labelng s tme consumng 2. Classfer could be desgned

More information

CMPS 10 Introduction to Computer Science Lecture Notes

CMPS 10 Introduction to Computer Science Lecture Notes CPS 0 Introducton to Computer Scence Lecture Notes Chapter : Algorthm Desgn How should we present algorthms? Natural languages lke Englsh, Spansh, or French whch are rch n nterpretaton and meanng are not

More information

Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz

Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz Compler Desgn Sprng 2014 Regster Allocaton Sample Exercses and Solutons Prof. Pedro C. Dnz USC / Informaton Scences Insttute 4676 Admralty Way, Sute 1001 Marna del Rey, Calforna 90292 pedro@s.edu Regster

More information

Improvement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration

Improvement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration Improvement of Spatal Resoluton Usng BlockMatchng Based Moton Estmaton and Frame Integraton Danya Suga and Takayuk Hamamoto Graduate School of Engneerng, Tokyo Unversty of Scence, 6-3-1, Nuku, Katsuska-ku,

More information

R s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes

R s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes SPH3UW Unt 7.3 Sphercal Concave Mrrors Page 1 of 1 Notes Physcs Tool box Concave Mrror If the reflectng surface takes place on the nner surface of the sphercal shape so that the centre of the mrror bulges

More information

NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS

NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS ARPN Journal of Engneerng and Appled Scences 006-017 Asan Research Publshng Network (ARPN). All rghts reserved. NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS Igor Grgoryev, Svetlana

More information

A Fast Visual Tracking Algorithm Based on Circle Pixels Matching

A Fast Visual Tracking Algorithm Based on Circle Pixels Matching A Fast Vsual Trackng Algorthm Based on Crcle Pxels Matchng Zhqang Hou hou_zhq@sohu.com Chongzhao Han czhan@mal.xjtu.edu.cn Ln Zheng Abstract: A fast vsual trackng algorthm based on crcle pxels matchng

More information

Life Tables (Times) Summary. Sample StatFolio: lifetable times.sgp

Life Tables (Times) Summary. Sample StatFolio: lifetable times.sgp Lfe Tables (Tmes) Summary... 1 Data Input... 2 Analyss Summary... 3 Survval Functon... 5 Log Survval Functon... 6 Cumulatve Hazard Functon... 7 Percentles... 7 Group Comparsons... 8 Summary The Lfe Tables

More information

Lobachevsky State University of Nizhni Novgorod. Polyhedron. Quick Start Guide

Lobachevsky State University of Nizhni Novgorod. Polyhedron. Quick Start Guide Lobachevsky State Unversty of Nzhn Novgorod Polyhedron Quck Start Gude Nzhn Novgorod 2016 Contents Specfcaton of Polyhedron software... 3 Theoretcal background... 4 1. Interface of Polyhedron... 6 1.1.

More information

Reducing Frame Rate for Object Tracking

Reducing Frame Rate for Object Tracking Reducng Frame Rate for Object Trackng Pavel Korshunov 1 and We Tsang Oo 2 1 Natonal Unversty of Sngapore, Sngapore 11977, pavelkor@comp.nus.edu.sg 2 Natonal Unversty of Sngapore, Sngapore 11977, oowt@comp.nus.edu.sg

More information

A Bootstrap Approach to Robust Regression

A Bootstrap Approach to Robust Regression Internatonal Journal of Appled Scence and Technology Vol. No. 9; November A Bootstrap Approach to Robust Regresson Dr. Hamadu Dallah Department of Actuaral Scence and Insurance Unversty of Lagos Akoka,

More information

A Statistical Model Selection Strategy Applied to Neural Networks

A Statistical Model Selection Strategy Applied to Neural Networks A Statstcal Model Selecton Strategy Appled to Neural Networks Joaquín Pzarro Elsa Guerrero Pedro L. Galndo joaqun.pzarro@uca.es elsa.guerrero@uca.es pedro.galndo@uca.es Dpto Lenguajes y Sstemas Informátcos

More information

Three supervised learning methods on pen digits character recognition dataset

Three supervised learning methods on pen digits character recognition dataset Three supervsed learnng methods on pen dgts character recognton dataset Chrs Flezach Department of Computer Scence and Engneerng Unversty of Calforna, San Dego San Dego, CA 92093 cflezac@cs.ucsd.edu Satoru

More information

APPLICATION OF MULTIVARIATE LOSS FUNCTION FOR ASSESSMENT OF THE QUALITY OF TECHNOLOGICAL PROCESS MANAGEMENT

APPLICATION OF MULTIVARIATE LOSS FUNCTION FOR ASSESSMENT OF THE QUALITY OF TECHNOLOGICAL PROCESS MANAGEMENT 3. - 5. 5., Brno, Czech Republc, EU APPLICATION OF MULTIVARIATE LOSS FUNCTION FOR ASSESSMENT OF THE QUALITY OF TECHNOLOGICAL PROCESS MANAGEMENT Abstract Josef TOŠENOVSKÝ ) Lenka MONSPORTOVÁ ) Flp TOŠENOVSKÝ

More information

TN348: Openlab Module - Colocalization

TN348: Openlab Module - Colocalization TN348: Openlab Module - Colocalzaton Topc The Colocalzaton module provdes the faclty to vsualze and quantfy colocalzaton between pars of mages. The Colocalzaton wndow contans a prevew of the two mages

More information

Support Vector Machines

Support Vector Machines Support Vector Machnes Decson surface s a hyperplane (lne n 2D) n feature space (smlar to the Perceptron) Arguably, the most mportant recent dscovery n machne learnng In a nutshell: map the data to a predetermned

More information

FINDING IMPORTANT NODES IN SOCIAL NETWORKS BASED ON MODIFIED PAGERANK

FINDING IMPORTANT NODES IN SOCIAL NETWORKS BASED ON MODIFIED PAGERANK FINDING IMPORTANT NODES IN SOCIAL NETWORKS BASED ON MODIFIED PAGERANK L-qng Qu, Yong-quan Lang 2, Jng-Chen 3, 2 College of Informaton Scence and Technology, Shandong Unversty of Scence and Technology,

More information

Skew Angle Estimation and Correction of Hand Written, Textual and Large areas of Non-Textual Document Images: A Novel Approach

Skew Angle Estimation and Correction of Hand Written, Textual and Large areas of Non-Textual Document Images: A Novel Approach Angle Estmaton and Correcton of Hand Wrtten, Textual and Large areas of Non-Textual Document Images: A Novel Approach D.R.Ramesh Babu Pyush M Kumat Mahesh D Dhannawat PES Insttute of Technology Research

More information

The Codesign Challenge

The Codesign Challenge ECE 4530 Codesgn Challenge Fall 2007 Hardware/Software Codesgn The Codesgn Challenge Objectves In the codesgn challenge, your task s to accelerate a gven software reference mplementaton as fast as possble.

More information

An Entropy-Based Approach to Integrated Information Needs Assessment

An Entropy-Based Approach to Integrated Information Needs Assessment Dstrbuton Statement A: Approved for publc release; dstrbuton s unlmted. An Entropy-Based Approach to ntegrated nformaton Needs Assessment June 8, 2004 Wllam J. Farrell Lockheed Martn Advanced Technology

More information

Parallelism for Nested Loops with Non-uniform and Flow Dependences

Parallelism for Nested Loops with Non-uniform and Flow Dependences Parallelsm for Nested Loops wth Non-unform and Flow Dependences Sam-Jn Jeong Dept. of Informaton & Communcaton Engneerng, Cheonan Unversty, 5, Anseo-dong, Cheonan, Chungnam, 330-80, Korea. seong@cheonan.ac.kr

More information

Module Management Tool in Software Development Organizations

Module Management Tool in Software Development Organizations Journal of Computer Scence (5): 8-, 7 ISSN 59-66 7 Scence Publcatons Management Tool n Software Development Organzatons Ahmad A. Al-Rababah and Mohammad A. Al-Rababah Faculty of IT, Al-Ahlyyah Amman Unversty,

More information

Comparison of Heuristics for Scheduling Independent Tasks on Heterogeneous Distributed Environments

Comparison of Heuristics for Scheduling Independent Tasks on Heterogeneous Distributed Environments Comparson of Heurstcs for Schedulng Independent Tasks on Heterogeneous Dstrbuted Envronments Hesam Izakan¹, Ath Abraham², Senor Member, IEEE, Václav Snášel³ ¹ Islamc Azad Unversty, Ramsar Branch, Ramsar,

More information

Meta-heuristics for Multidimensional Knapsack Problems

Meta-heuristics for Multidimensional Knapsack Problems 2012 4th Internatonal Conference on Computer Research and Development IPCSIT vol.39 (2012) (2012) IACSIT Press, Sngapore Meta-heurstcs for Multdmensonal Knapsack Problems Zhbao Man + Computer Scence Department,

More information

GSLM Operations Research II Fall 13/14

GSLM Operations Research II Fall 13/14 GSLM 58 Operatons Research II Fall /4 6. Separable Programmng Consder a general NLP mn f(x) s.t. g j (x) b j j =. m. Defnton 6.. The NLP s a separable program f ts objectve functon and all constrants are

More information

Review of approximation techniques

Review of approximation techniques CHAPTER 2 Revew of appromaton technques 2. Introducton Optmzaton problems n engneerng desgn are characterzed by the followng assocated features: the objectve functon and constrants are mplct functons evaluated

More information

Adaptive Regression in SAS/IML

Adaptive Regression in SAS/IML Adaptve Regresson n SAS/IML Davd Katz, Davd Katz Consultng, Ashland, Oregon ABSTRACT Adaptve Regresson algorthms allow the data to select the form of a model n addton to estmatng the parameters. Fredman

More information

7/12/2016. GROUP ANALYSIS Martin M. Monti UCLA Psychology AGGREGATING MULTIPLE SUBJECTS VARIANCE AT THE GROUP LEVEL

7/12/2016. GROUP ANALYSIS Martin M. Monti UCLA Psychology AGGREGATING MULTIPLE SUBJECTS VARIANCE AT THE GROUP LEVEL GROUP ANALYSIS Martn M. Mont UCLA Psychology NITP AGGREGATING MULTIPLE SUBJECTS When we conduct mult-subject analyss we are tryng to understand whether an effect s sgnfcant across a group of people. Whether

More information

A Fast Content-Based Multimedia Retrieval Technique Using Compressed Data

A Fast Content-Based Multimedia Retrieval Technique Using Compressed Data A Fast Content-Based Multmeda Retreval Technque Usng Compressed Data Borko Furht and Pornvt Saksobhavvat NSF Multmeda Laboratory Florda Atlantc Unversty, Boca Raton, Florda 3343 ABSTRACT In ths paper,

More information

Edge Detection in Noisy Images Using the Support Vector Machines

Edge Detection in Noisy Images Using the Support Vector Machines Edge Detecton n Nosy Images Usng the Support Vector Machnes Hlaro Gómez-Moreno, Saturnno Maldonado-Bascón, Francsco López-Ferreras Sgnal Theory and Communcatons Department. Unversty of Alcalá Crta. Madrd-Barcelona

More information

Quality Improvement Algorithm for Tetrahedral Mesh Based on Optimal Delaunay Triangulation

Quality Improvement Algorithm for Tetrahedral Mesh Based on Optimal Delaunay Triangulation Intellgent Informaton Management, 013, 5, 191-195 Publshed Onlne November 013 (http://www.scrp.org/journal/m) http://dx.do.org/10.36/m.013.5601 Qualty Improvement Algorthm for Tetrahedral Mesh Based on

More information

Private Information Retrieval (PIR)

Private Information Retrieval (PIR) 2 Levente Buttyán Problem formulaton Alce wants to obtan nformaton from a database, but she does not want the database to learn whch nformaton she wanted e.g., Alce s an nvestor queryng a stock-market

More information

LECTURE : MANIFOLD LEARNING

LECTURE : MANIFOLD LEARNING LECTURE : MANIFOLD LEARNING Rta Osadchy Some sldes are due to L.Saul, V. C. Raykar, N. Verma Topcs PCA MDS IsoMap LLE EgenMaps Done! Dmensonalty Reducton Data representaton Inputs are real-valued vectors

More information

Network Coding as a Dynamical System

Network Coding as a Dynamical System Network Codng as a Dynamcal System Narayan B. Mandayam IEEE Dstngushed Lecture (jont work wth Dan Zhang and a Su) Department of Electrcal and Computer Engneerng Rutgers Unversty Outlne. Introducton 2.

More information

Multilevel Analysis with Informative Weights

Multilevel Analysis with Informative Weights Secton on Survey Research Methods JSM 2008 Multlevel Analyss wth Informatve Weghts Frank Jenkns Westat, 650 Research Blvd., Rockvlle, MD 20850 Abstract Multlevel modelng has become common n large scale

More information

TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS. Muradaliyev A.Z.

TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS. Muradaliyev A.Z. TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS Muradalyev AZ Azerbajan Scentfc-Research and Desgn-Prospectng Insttute of Energetc AZ1012, Ave HZardab-94 E-mal:aydn_murad@yahoocom Importance of

More information

Report on On-line Graph Coloring

Report on On-line Graph Coloring 2003 Fall Semester Comp 670K Onlne Algorthm Report on LO Yuet Me (00086365) cndylo@ust.hk Abstract Onlne algorthm deals wth data that has no future nformaton. Lots of examples demonstrate that onlne algorthm

More information

Solutions to Programming Assignment Five Interpolation and Numerical Differentiation

Solutions to Programming Assignment Five Interpolation and Numerical Differentiation College of Engneerng and Coputer Scence Mechancal Engneerng Departent Mechancal Engneerng 309 Nuercal Analyss of Engneerng Systes Sprng 04 Nuber: 537 Instructor: Larry Caretto Solutons to Prograng Assgnent

More information

Solitary and Traveling Wave Solutions to a Model. of Long Range Diffusion Involving Flux with. Stability Analysis

Solitary and Traveling Wave Solutions to a Model. of Long Range Diffusion Involving Flux with. Stability Analysis Internatonal Mathematcal Forum, Vol. 6,, no. 7, 8 Soltary and Travelng Wave Solutons to a Model of Long Range ffuson Involvng Flux wth Stablty Analyss Manar A. Al-Qudah Math epartment, Rabgh Faculty of

More information

Synthesizer 1.0. User s Guide. A Varying Coefficient Meta. nalytic Tool. Z. Krizan Employing Microsoft Excel 2007

Synthesizer 1.0. User s Guide. A Varying Coefficient Meta. nalytic Tool. Z. Krizan Employing Microsoft Excel 2007 Syntheszer 1.0 A Varyng Coeffcent Meta Meta-Analytc nalytc Tool Employng Mcrosoft Excel 007.38.17.5 User s Gude Z. Krzan 009 Table of Contents 1. Introducton and Acknowledgments 3. Operatonal Functons

More information