FalseAlarm and NonDetection Probabilities for Online Quality Control via HMM


 Randall Malone
 1 years ago
 Views:
Transcription
1 Int. Journal of Math. Analysis, Vol. 6, 2012, no. 24, FalseAlarm and NonDetection Probabilities for Online Quality Control via HMM C.C.Y. Dorea a,1, C.R. Gonçalves a, P.G. Medeiros b and W.B. Santos a a Universidade de Brasilia BrasiliaDF, Brazil b Universidade Federal do Rio Grande do Norte NatalRN, Brazil Abstract Online quality control during production calls for monitoring produced items according to some prescribed strategy. It is reasonable to assume the existence of system internal nonobservable variables so that the carried out monitoring is only partially reliable. In this note, under the setting of a Hidden Markov Model (HMM) and assuming that the evolution of the internal state changes are governed by a twostate Markov chain, we derive estimates for falsealarm and nondetection malfunctioning probabilities. Kernel density methods are used to approximate the stable regime density and the stationary probabilities. As a side result, alternative monitoring strategies are proposed. Mathematics Subject Classification: 60J20, 60J10, 90B30 Keywords: Hidden Markov model; Falsealarm; Kernel density methods 1. Introduction Limited by the cost function a sampling interval m is selected and classical online quality control during production adopts the procedure of monitoring the sequence of items, independently produced, by examining a single item at every m produced items. Based on the quality requirements and on the distribution of the examined variable a control region C is prespecified. If the examined item satisfies the control limits, the process is said to be in 1 Corresponding author : Research partially supported by CNPq, CAPES, FAPDF and FINATEC.
2 1154 C.C.Y. Dorea, C.R. Gonçalves, P.G. Medeiros and W.B. Santos control and the production continues; otherwise, the process is declared out of control and the production is stopped for adjustments. After adjustments the production is resumed and it is in control again. At each stoppage a new production cycle is defined (see, for example, [4]). Suppose now the internal working status of the system is nonobservable and may change from a good working condition (on control) to a deteriorating status (out of control). In [2] it is proposed a model where these changes are governed by a twostate Markov chain {θ n } n 0. When θ n = 0 the process is said to be in control at time n; and, if θ n = 1 the process is out of control. In their proposal, an observable random variable X n, related to characteristics of interest, is examined at every m produced items. It is assumed that X n has a Gaussian distribution, N (μ, σ 2 ), with μ = μ θn. And values of m as well as the parameter d of the control region C =(μ 0 dσ, μ 0 + dσ) were determined by considering a given cost function to be minimized. Here, in the framework of a Hidden Markov Model (HMM), we compute and propose estimation techniques for the falsealarm and nondetection probabilities. Falsealarm occurs if the observed variable falls outside the control region but the nonobservable internal system state is 0, a good working state. When the opposite occurs we have a nondetection situation. It is assumed that all the working (good) states are lumped together as state 0 and the deteriorating states are gathered as state 1. A Markov chain {θ n } n 0 describes the evolution of the state of the production system. Associated with this chain we observe a sequence of conditionally independent random variables {X n } n 1, with the distribution of each X n depending on the corresponding state θ n. This process {θ n,x n } is generally referred to as a HMM. More specifically, we have P (X n+1 A X 1,...,X n,θ 0,...,θ n )=P (X n+1 A θ n ) (1) and n P (X 1 A 1,...,X n A n θ 1,...,θ n )= P (X j A j θ j ). (2) j=1 In section 2, we treat the special case where the transition matrix of {θ n } as well as the conditional densities of X n given θ n are known, but not necessarily Gaussian densities. For any initial distribution of θ 0, Proposition 1 and Proposition 2 give the falsealarm and the nondetection probabilities. As a side result, upper bounds for the sampling interval m are proposed. In section 3, we assume that the transition probabilities of the hidden chain {θ n } are unknown. Based on the observable sample X 1,...,X n kernel density methods are used to approximate the stable regime density. Theorem
3 HMM for online quality control analysis shows that the limiting stable density is a mixture of densities, which in the particular case treated in [2] reduces to NORMIX (mixture of normal densities). Corollary 1 provide an estimate for the stationary distribution of {θ n } and leads to an alternative monitoring strategy that takes into account the falsealarm situations. And the estimates for falsealarm and nondetection probabilities can be found in Corollary Falsealarm and Nondetection For the HMM process {θ n,x n } assume that the chain {θ n } has known transition probabilities given by ( ) 1 p p P = ɛ 1 ɛ 0 <p<1, ɛ > 0 and p + ɛ<1. (3) The conditional distribution of X n given θ n are also known and based on this distribution a control region C is preselected. It is assumed that P (X n A θ n = i) = f(x i)dx, 0 <q 0 = f(x 0)dx < 1 and 0 <q 1 = C c f(x 1)dx < 1. C c (4) If the sampling interval m = 1, the online quality monitoring adopts the following strategy : items X 1,X 2,... are inspected and verified whether X 1 C, X 2 C,...; maintenance is required at time n if X 1 C,...,X n 1 C and X n / C. Thus we can define the alert times by τ X = inf{k : k 1,X k / C}. Falsealarm occurs at time k if τ X = k but the nonobservable internal system state is 0, a good working state. Let τ θ be defined as the first time, after time 0, the system reaches state 1, A τ θ = inf{k : k 1,θ k =1}. (5) Then falsealarm and nondetection correspond, respectively, to the events (τ X < τ θ ) and (τ X > τ θ ). Let P ν denote the probability when the initial
4 1156 C.C.Y. Dorea, C.R. Gonçalves, P.G. Medeiros and W.B. Santos distribution of θ 0 is ν. Similarly, let P 0 and P 1 denote the probability when θ 0 = 0 and θ 0 = 1 respectively. Proposition 1. Let ν be the initial distribution of θ 0. Then the falsealarm probability is given by (1 p)q 0 P ν (τ X <τ θ )=ν(0) 1 (1 p)(1 q 0 ) + ν(1) ɛq 0 (6) 1 (1 p)(1 q 0 ) and the nondetection probability is given by p(1 q 1 ) P ν (τ X >τ θ )=ν(0) 1 (1 p)(1 q 0 ) + ν(1)[q 0(1 ɛ)+(1 q 0 )p](1 q 1 ). 1 (1 p)(1 q 0 ) (7) Proof. (i) For θ 0 = 0 we have from (3) and (4) P 0 (τ X =1,τ θ > 1) = P 0 (θ 1 =0,X 1 / C) =(1 p)q 0 and from (1) and (2) we have for k 2 P 0 (τ X = k, τ θ >k) = P 0 (X 1 C,,X k 1 C, X k / C, θ 1 = = θ k =0) = k 1 P 0 (θ 1 = = θ k = 0)[ P (X j C θ j = 0)]P (X k / C θ k =0) It follows that j=1 = (1 p)[(1 p)(1 q 0 )] k 1 q 0. P 0 (τ X <τ θ )= Similarly, if θ 0 = 1 we have and for k 2 (1 p)q 0 1 (1 p)(1 q 0 ). P 1 (τ X =1,τ θ > 1) = P (θ 1 =0 θ 0 =1)P (X 1 / C θ 1 =0)=ɛq 0 And (6) follows. (ii) To prove (7) note that and for k 2 P 1 (τ X = k, τ θ >k)=ɛ[(1 p)(1 q 0 )] k 1 q 0. P 0 (τ X = τ θ =1)=P (θ 1 =1 θ 0 =0)P (X 1 / C θ 1 =1)=pq 1 P 0 (τ X = τ θ = k) = [(1 p)(1 q 0 )] k 1 pq 1.
5 HMM for online quality control analysis 1157 Moreover, P 1 (τ X = τ θ =1)=(1 ɛ)q 1 and for k 2 P 1 (τ X = τ θ = k) =ɛ(1 q 0 )[(1 p)(1 q 0 )] k 2 pq 1. It follows that pq 1 P ν (τ X = τ θ )=ν(0) 1 (1 p)(1 q 0 ) + ν(1)[q 0(1 ɛ)+(1 q 0 )p]q 1. 1 (1 p)(1 q 0 ) This along with (6) give us (7). Now, assume that a single item is inspected at every m items produced. Then for m 2 we can define and and τ (m) X = inf{km : k 1,X km / C}. (8) Using the same type of arguments as above we get P 0 (τ (m) X = km, τ θ >km) = (1 p) km (1 q 0 ) k 1 q 0 = (1 p) m [(1 p) m (1 q 0 )] k 1 q 0 P 1 (τ (m) X = km, τ θ >km)=ɛ(1 p) m 1 [(1 p) m (1 q 0 )] k 1 q 0. Moreover, P 0 (τ (m) X = τ θ = km) = [(1 p) m (1 q 0 )] k 1 (1 p) m 1 pq 1 P 1 (τ (m) X = τ θ = km) = [(1 p) m (1 q 0 )] k 1 ɛ(1 p) m 2 pq 1. Proposition 2. Let ν be the initial distribution of θ 0. Assume that the monitoring strategy has sampling interval m. Then the falsealarm probability is given by P ν (τ (m) X <τ (1 p) m q 0 θ)=ν(0) 1 (1 p) m (1 q 0 ) + ν(1) ɛ(1 p) m 1 q 0 1 (1 p) m (1 q 0 ) (9)
6 1158 C.C.Y. Dorea, C.R. Gonçalves, P.G. Medeiros and W.B. Santos and for m 2 the nondetection probability is given by P ν (τ (m) X >τ θ) = ν(0) 1 (1 p)m 1 +(1 p) m 1 p(1 q 1 ) 1 (1 p) m (1 q 0 ) + ν(1) 1 (1 p)m (1 q 0 ) ɛ(1 p) m 2 [(1 p)q 0 + pq 1 ]. 1 (1 p) m (1 q 0 ) (10) Next, we propose upper bounds for the sampling interval m. Wemay assume that the process starts at good working conditions (θ 0 =0,X 0 C). Our aim is to detect whether the chain {θ n } has changed to state 1. A trivial upper bound is given by the mean changing time from state 0 to state 1. From (3) and (5) we have m kp(τ θ = k θ 0 =0)= k(1 p) k 1 p = 1 p. k 1 k 1 Since {θ n } is nonobservable, the designed monitoring strategy relies on the observable process {X n }. Taking this into account one should choose m smaller so that in average we will detect the first time the process {θ n,x n } reaches the alert zone. Alert occurs at time k if either X k C c or θ k =1. And this can be expressed by τ A = inf{k : k 1, (θ k,x k ) A}. where A =({0} C c ) ({1} C) ({1} C c ). Since P ((θ k+1,x k+1 ) A c (θ k,x k ) A c )=(1 p)(1 q 0 ), the expected first hitting time in alert zone is given by m E(τ A θ 0 =0,X 0 C) = 3. Estimation Results 1 1 (1 p)(1 q 0 ). In this section we assume that the hidden Markov chain {θ n } has transition matrix P of the form (3), but unknown. As for the process {X n }, we assume that the conditional densities are known and satisfy condition (4). Note that since all entries of P are strictly positive, {θ n } is an ergodic chain and the stationary (limiting) distribution exists, πp = π, π(0) = ɛ p + ɛ and π(1) = p p + ɛ. (11)
7 HMM for online quality control analysis 1159 Define the mixture density function f(x) = π(0)f(x 0) + π(1)f(x 1). (12) Then, in some sense, f( ) represents the density of {X n } when the process reaches some stable regime. Mixture models have been well recognized as useful in many practical applications. It is a popular modelbased approach to dealing with data in the presence of population heterogeneity, in the sense that, data consist of unlabelled observations, each of which is thought to belong to one of the distinct classes. For a comprehensive list of applications and literature survey in this area see, for example, [3]. Though we are assuming known conditional densities, the stable regime density (12) may indicate which type of distribution one should assume for the variables X n as well as which control region C one should select. Results from [1] show that, based on the observable sample X 1,...,X n, kernel density methods can be successfully used to estimate the stable regime density. For a probability density K on R define ˆf n (x) = 1 nh n k=1 K( X k x ),h= h n 0,nh n as n. (13) h Typically one takes K( ) either a Gaussian density or an uniform density centered at x. Using these results we have Theorem 1 which allows us to make inference on P. Its proof will be postponed to the end of this section. Theorem 1. Assume that the process {θ n,x n } satisfies (3) and (4) and let ν be any initial distribution of θ 0. Then given δ>0 there exist c 1 = c 1 (δ) > 0 and c 2 = c 2 (δ) > 0 such that P ν ( ˆf n (y) f(y) dy δ) c 1 exp{ c 2 n} (14) and almost surely (a.s.) lim n ˆf n (y) f(y) dy = 0 a.s. (15) Next, we estimate the stationary probabilities (11). Choose x so that f(x 0) f(x 1) and define ˆf n (x ) f(x 1) ˆπ n (0) = f(x 0) f(x 1) and ˆπ n(1) = 1 ˆπ n (0). (16)
8 1160 C.C.Y. Dorea, C.R. Gonçalves, P.G. Medeiros and W.B. Santos From (15) it follows that, Corollary 1. For any initial distribution of θ 0 we have with probability 1, ˆπ n (0) π(0) and ˆπ n (1) π(1) as n. (17) This result suggests an alternative online control procedure that will take into account the falsealarm situations. Let ˆf n (m) (x )= 1 n K( X km x ). nh h Then, from (15) we have lim n k=1 (m) ˆf n (x ) f(x ) a.s. (m) Thus, with ˆf n (x ) in place of ˆf n (x ) in (16) we get (17). It follows that the posterior distribution P (θ nm =0 X m,...,x nm ) can be approximated by ˆf n ˆP (m) (x ) f(x 1) f(x 0) (θ nm =0 X m,...,x nm )= f(x 0) f(x 1) ˆf n (m) (x ). Monitoring Strategy. Assume that the conditional densities f( 0) and f( 1) are both known. Suppose that the control region C and the sampling interval m have been preselected. Let τ (m) X be defined by (8) and let 0 <η<1 be a given significance level. Then intervention is carried out at time nm if τ (m) X = nm and ˆP (θnm =0 Xm,...,Xnm) <η. From (16) we can also estimate falsealarm and nondetection probabilities. Observe that, in longrun, the falsealarm can be computed as P (θ km =0 X km / C) = P (X km / C θ km =0)P (θ km =0). P (X km / C) But P (X km / C θ km =0)=q 0 and by (11) we have lim P (θ km =0)=π(0). n From Theorem 1 with f( ) given by (12) we have lim P (X km / C) = f(x)dx. n C c Similarly, we have for nondetection P (θ km =1 X km C) = P (X km C θ km =1)P (θ km =1). P (X km C)
9 HMM for online quality control analysis 1161 These results can be summarized by: Corollary 2. For any initial distribution of θ 0 we have with probability 1, q 0ˆπ n (0) ˆf C c n (x)dx P (falsealarm) and (1 q 1)ˆπ n (1) C ˆf P (nondetection). (18) n (x)dx Proof of Theorem 1. Enough to verify that the hypotheses of Theorem 2 and Corollary 1 from [1] are satisfied. First, we shown that {θ n } is is uniformly ergodic, that is, there exists 0 <ρ<1 such that From (3) we have, ɛ P n = p + ɛ P n ij π(j) ρ n i, j =0, 1. (19) + p(1 p ɛ)n p + ɛ ɛ p ɛ)n ɛ(1 p + ɛ p + ɛ p p ɛ)n p(1 p + ɛ p + ɛ p p ɛ)n + ɛ(1 p + ɛ p + ɛ and from (11) we get (19) by taking ρ =1 p ɛ. Next, we show that {θ n } satisfies the φmixing condition : A F k and B Fk+n P π (A B) P π (A)P π (B) φ(n)p π (A) (20) with n 1 φ(n) < and σalgebras defined by F n = σ(θ 0,...,θ n ) and F n = σ(θ n,θ n+1,...). Note that for A =(θ 0 = a 0,...,θ k = a k ), B =(θ k+n = b k+n,...) and P π (A) > 0 we have and P π (B A) =P π (B θ k = a k )=P n a k b k+n P π (θ k+n+1 = b k+n+1,... θ k+n = b k+n ) It follows that P π (B) =π(b k+n )P π (θ k+n+1 = b k+n+1,... θ k+n = b k+n ). P π (B A) P π (B) P n a k b k+n π(b k+n ) ρ n = φ(n) and (20) is satisfied. References :
10 1162 C.C.Y. Dorea, C.R. Gonçalves, P.G. Medeiros and W.B. Santos [1] Dorea, C.C.Y. and Zhao, L.C. (2002)  Nonparametric density estimation in Hidden Markov Models, Statis. Inference for Stoch. Processes, vol. 5, [2] Ho, L.L.; Medeiros, P.G. and Borges, W. (2007)  An alternative model for online quality monitoring for variables, Intern. Jour. of Production Economics, vol. 107, [3] McLachlan, G.L. and Peel, D. (2000)  Finite Mixture Models,John Wiley, New York. [4] Taguchi, G.; Elsayed, E.D. and Hsiang, T. (1989)  Quality Engineering in Production Systems, McGrawHill, New York. Received: November, 2011
How to Gamble If You Must
How to Gamble If You Must Kyle Siegrist Department of Mathematical Sciences University of Alabama in Huntsville Abstract In red and black, a player bets, at even stakes, on a sequence of independent games
More informationTHE PROBLEM OF finding localized energy solutions
600 IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 45, NO. 3, MARCH 1997 Sparse Signal Reconstruction from Limited Data Using FOCUSS: A Reweighted Minimum Norm Algorithm Irina F. Gorodnitsky, Member, IEEE,
More informationThe Backpropagation Algorithm
7 The Backpropagation Algorithm 7. Learning as gradient descent We saw in the last chapter that multilayered networks are capable of computing a wider range of Boolean functions than networks with a single
More informationThe mean field traveling salesman and related problems
Acta Math., 04 (00), 9 50 DOI: 0.007/s50000467 c 00 by Institut MittagLeffler. All rights reserved The mean field traveling salesman and related problems by Johan Wästlund Chalmers University of Technology
More informationErgodicity and Energy Distributions for Some Boundary Driven Integrable Hamiltonian Chains
Ergodicity and Energy Distributions for Some Boundary Driven Integrable Hamiltonian Chains Peter Balint 1, Kevin K. Lin 2, and LaiSang Young 3 Abstract. We consider systems of moving particles in 1dimensional
More informationNew insights on the meanvariance portfolio selection from de Finetti s suggestions. Flavio Pressacco and Paolo Serafini, Università di Udine
New insights on the meanvariance portfolio selection from de Finetti s suggestions Flavio Pressacco and Paolo Serafini, Università di Udine Abstract: In this paper we offer an alternative approach to
More informationIEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 50, NO. 5, MAY 2005 577. Least Mean Square Algorithms With Markov RegimeSwitching Limit
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 50, NO. 5, MAY 2005 577 Least Mean Square Algorithms With Markov RegimeSwitching Limit G. George Yin, Fellow, IEEE, and Vikram Krishnamurthy, Fellow, IEEE
More informationStrong control, conservative point estimation and simultaneous conservative consistency of false discovery rates: a unified approach
J. R. Statist. Soc. B (2004) 66, Part 1, pp. 187 205 Strong control, conservative point estimation and simultaneous conservative consistency of false discovery rates: a unified approach John D. Storey,
More informationA direct approach to false discovery rates
J. R. Statist. Soc. B (2002) 64, Part 3, pp. 479 498 A direct approach to false discovery rates John D. Storey Stanford University, USA [Received June 2001. Revised December 2001] Summary. Multiplehypothesis
More informationMINITAB ASSISTANT WHITE PAPER
MINITAB ASSISTANT WHITE PAPER This paper explains the research conducted by Minitab statisticians to develop the methods and data checks used in the Assistant in Minitab 17 Statistical Software. OneWay
More informationA Googlelike Model of Road Network Dynamics and its Application to Regulation and Control
A Googlelike Model of Road Network Dynamics and its Application to Regulation and Control Emanuele Crisostomi, Steve Kirkland, Robert Shorten August, 2010 Abstract Inspired by the ability of Markov chains
More information1 NOT ALL ANSWERS ARE EQUALLY
1 NOT ALL ANSWERS ARE EQUALLY GOOD: ESTIMATING THE QUALITY OF DATABASE ANSWERS Amihai Motro, Igor Rakov Department of Information and Software Systems Engineering George Mason University Fairfax, VA 220304444
More informationThe Set Covering Machine
Journal of Machine Learning Research 3 (2002) 723746 Submitted 12/01; Published 12/02 The Set Covering Machine Mario Marchand School of Information Technology and Engineering University of Ottawa Ottawa,
More informationGaussian Processes in Machine Learning
Gaussian Processes in Machine Learning Carl Edward Rasmussen Max Planck Institute for Biological Cybernetics, 72076 Tübingen, Germany carl@tuebingen.mpg.de WWW home page: http://www.tuebingen.mpg.de/ carl
More informationONEDIMENSIONAL RANDOM WALKS 1. SIMPLE RANDOM WALK
ONEDIMENSIONAL RANDOM WALKS 1. SIMPLE RANDOM WALK Definition 1. A random walk on the integers with step distribution F and initial state x is a sequence S n of random variables whose increments are independent,
More informationINFERENCE FOR THE IDENTIFIED SET IN PARTIALLY IDENTIFIED ECONOMETRIC MODELS. JOSEPH P. ROMANO Stanford University, Stanford, CA 943054065, U.S.A.
http://www.econometricsociety.org/ Econometrica, Vol. 78, No. 1 (January, 2010), 169 211 INFERENCE FOR THE IDENTIFIED SET IN PARTIALLY IDENTIFIED ECONOMETRIC MODELS JOSEPH P. ROMANO Stanford University,
More informationDirichlet Process. Yee Whye Teh, University College London
Dirichlet Process Yee Whye Teh, University College London Related keywords: Bayesian nonparametrics, stochastic processes, clustering, infinite mixture model, BlackwellMacQueen urn scheme, Chinese restaurant
More informationMonte Carlo methods in PageRank computation: When one iteration is sufficient
Monte Carlo methods in PageRank computation: When one iteration is sufficient K.Avrachenkov, N. Litvak, D. Nemirovsky, N. Osipova Abstract PageRank is one of the principle criteria according to which Google
More informationf (x) π (dx), n f(x k ). (1) k=1
To appear Annals of Applied Probability 2005Vol. 0, No. 0, 1 8 ON THE ERGODICITY PROPERTIES OF SOME ADAPTIVE MCMC ALGORITHMS By Christophe Andrieu, and Éric Moulines University of Bristol and École Nationale
More informationData Quality Assessment: A Reviewer s Guide EPA QA/G9R
United States Office of Environmental EPA/240/B06/002 Environmental Protection Information Agency Washington, DC 20460 Data Quality Assessment: A Reviewer s Guide EPA QA/G9R FOREWORD This document is
More informationSome Research Problems in Uncertainty Theory
Journal of Uncertain Systems Vol.3, No.1, pp.310, 2009 Online at: www.jus.org.uk Some Research Problems in Uncertainty Theory aoding Liu Uncertainty Theory Laboratory, Department of Mathematical Sciences
More informationRmax A General Polynomial Time Algorithm for NearOptimal Reinforcement Learning
Journal of achine Learning Research 3 (2002) 213231 Submitted 11/01; Published 10/02 Rmax A General Polynomial Time Algorithm for NearOptimal Reinforcement Learning Ronen I. Brafman Computer Science
More informationLevel sets and extrema of random processes and fields. JeanMarc Azaïs Mario Wschebor
Level sets and extrema of random processes and fields. JeanMarc Azaïs Mario Wschebor Université de Toulouse UPS CNRS : Institut de Mathématiques Laboratoire de Statistiques et Probabilités 118 Route de
More informationSubspace Pursuit for Compressive Sensing: Closing the Gap Between Performance and Complexity
Subspace Pursuit for Compressive Sensing: Closing the Gap Between Performance and Complexity Wei Dai and Olgica Milenkovic Department of Electrical and Computer Engineering University of Illinois at UrbanaChampaign
More informationRandom matchings which induce Hamilton cycles, and hamiltonian decompositions of random regular graphs
Random matchings which induce Hamilton cycles, and hamiltonian decompositions of random regular graphs Jeong Han Kim Microsoft Research One Microsoft Way Redmond, WA 9805 USA jehkim@microsoft.com Nicholas
More informationIntroduction to Queueing Theory and Stochastic Teletraffic Models
Introduction to Queueing Theory and Stochastic Teletraffic Models Moshe Zukerman EE Department, City University of Hong Kong Copyright M. Zukerman c 2000 2015 Preface The aim of this textbook is to provide
More informationBayesian Models of Graphs, Arrays and Other Exchangeable Random Structures
Bayesian Models of Graphs, Arrays and Other Exchangeable Random Structures Peter Orbanz and Daniel M. Roy Abstract. The natural habitat of most Bayesian methods is data represented by exchangeable sequences
More informationFoundations of Data Science 1
Foundations of Data Science John Hopcroft Ravindran Kannan Version /4/204 These notes are a first draft of a book being written by Hopcroft and Kannan and in many places are incomplete. However, the notes
More informationA ContinuousReview Inventory Model with Disruptions at Both Supplier and Retailer
A ContinuousReview Inventory Model with isruptions at Both Supplier and Retailer Lian Qi epartment of Business Administration, Missouri University of Science and Technology 107I Fulton Hall, Rolla, MO
More informationFoundations of Data Science 1
Foundations of Data Science John Hopcroft Ravindran Kannan Version 2/8/204 These notes are a first draft of a book being written by Hopcroft and Kannan and in many places are incomplete. However, the notes
More information