Possibility Theory in the Management of Chance Discovery

Size: px
Start display at page:

Download "Possibility Theory in the Management of Chance Discovery"

Transcription

1 From: AAAI Techical Report FS Compilatio copyright 00, AAAI ( All rights reserved. Possibility Theory i the Maagemet of Chace Discovery Roald R. Yager Machie Itelligece Istitute Ioa College New Rochelle, NY yager@paix.com Itroductio The purpose this work is to discuss ad ivestigate the potetial role of possibility theory [1-4] ad other o-stadard ucertaity calculi, such as the Dempster- Shafer theory [5, 6] of evidece, i the developmet of a framework for the maagemet of chace discovery. Possibility theory provides a framework for the represetatio ad maagemet of iformatio about ucertai situatios. It is closely related to fuzzy set theory. Possibility theory uses two dual measures, called the possibility measure ad certaity (ecessity) measure, to model available iformatio about ucertaity situatios. As opposed to probability theory. where the probability measure is additive, the possibility measure ivolves Maxig of its elemets ad the Certaity measure, which is the dual of the possibility ivolves Miig of its elemets. I additio possibility theory is ot as strogly costraied by the law of the excluded middle allowig a more flexible framework. A particularly importat feature of possibility theory ad these other o-stadard calculi are their ability to represet iformatio that is ot impossible. Here we have a framework i which we are able to maage outcomes that are ot expressly deied although ever have occurred. Its close relatioship with fuzzy set theory makes it very suitable for the represetatio of iformatio about ucertaity that is ot ecessarily of a radom type. Here we shall focus o the issue of decisio i the face of possibility ad other types of ucertaity, The basic issues ivolved i decisio makig uder icertitude ca best be uderstood usig the decisio matrix show i figure #1. I this matrix the Ai correspod to a collectio of alterative courses of actio ope to a decisio maker, oe of these actios must be selected by the decisio maker. The elemets x j are possible values associated with a variable V. Geerally the value of V is ukow before the decisio maker must make a selectio from amog the alterative courses of actio. Our kowledge about V is captured by our ucertaity calculi. Fially C ij is the payoff to the decisio maker if he selects alterative Ai ad V assumes the value X j. Oe approach for selectig the best alterative i this decisio problem is to calculate for each alterative a value Val(A i ) ad the select the alterative that has the largest of these values. The formulatio of this fuctio Val(A i ) is strogly depedet upo the type of iformatio assumed about the ucertai variable V. I the case whe we assume probabilistic ucertaity the geerally accepted approach is to use the expected value. We ote however this ca be called ito questio as we did i [7]. x x x 1 j A 1 A C i ij A m Figure #1. Decisio Matrix Decisio Attitude i Possibilistic Decisio Makig We shall first cosider the classic case of possibilistic ucertaity ad discuss the role of decisio attitude. I this situatio i which all we kow about the ucertai variable is that it must take its value i the set X = {x 1, x,... x }, called the feasible set. No iformatio is assumed distiguishig the prospects of the elemets i X. From a decisio makig poit of view alterative A i iduces a collectio of possible [C i1, C i,..., C i ]. A umber of differet approaches have bee suggested for evaluatig alteratives i this eviromet. Amog these are the followig:

2 1). Pessimistic: Val(Ai) = Mi j [Cij] 1). If W = W where w * j = 0 for j = 1 to - 1 ad ). Optimistic: Val(Ai) = Max j [C ij ] w = 1, we get Val(A i ) = Mi j [C ij ], the pessimistic 3). Average/eutral: Val(A i ) = 1  decisio maker. C ij ) If W = W *, where w 1 = 1 ad w = 0 for j = to j 4). Arrow-Hurwicz Criteria:, we get Val(A i ) = Max j [C ij ] the optimistic decisio Val(A i ) = a Max i [C ij ] + (1 - a) Mi i [C ij ] (for a[0, 1]) maker.. Each oe of these ca be see as reflectig a particular 3).If W = W A, where w 1 attitude o the part of the decisio maker. For example, j = for all j we get Val(Ai) = 1  i the first oe the decisio maker is essetially displayig a pessimistic attitude, oe i which he is C i. the eutral decisio maker assumig that the worst of the possible outcomes will occur. Thus we see that a sigificat aspect of these 4) If W = W H, where w 1 = a, w = 1 - a ad w j = methods is the cetrality of the choice of decisio 0 for j = to - 1 we get Val(Ai) = amax j [C ij ] + attitude i the process of valuatig alteratives. Also, (1 - a) Mi j [Cij], the Arrow-Hurwicz criteria. quite clear i this situatio is the subjectiveess of the I [8] we referred to W as the attitudial vector ad choice. itroduced a measure of optimism associated with a I [8] we provided for a uificatio ad give vector: a(w) = 1  geeralizatio of these approaches to decisio makig. w j ( - j). We ote - 1 The approach is based upo the OWA operator [9, 10]. We first describe the OWA operator. that a (W * ) = 0, a (W*) = 1, a(w A ) = 0.5 ad A Ordered Weighted Averagig (OWA) operator a(w H ) = a of degree is a mappig F I additio to uifyig the existig decisio W : R Æ R which has a makig techiques, the itroductio of the OWA associated vector weightig vector W, whose formalism provides for a geeralizatio of the potetial compoets satisfy meas we have for evaluatig alteratives. The W-1:. w j Œ [0,1] for j = 1 to geeralizatio itroduced here is oe i which by selectig a W we get a valuatio fuctio. This of W-:.  w j = 1 course provides us with a ifiite family of possible valuatio fuctios. It would be useful here to address ad where F w (a 1, a,..., a ) = the issue of providig some directio for the process of  w j b j with b j selectig a attitudial vector W. The more deep our uderstadig of the valuatio methodology, the more beig the j th largest of the a i. itelligetly we ca select the attitudial vector W. Essetially, the OWA operator ivolves a I [11] Yager suggested a iterestig iterpretatio reorderig of the argumets, the a liear aggregatio. of the valuatio process. Notig that the elemets i the attitudial vector W, as required by W-1 ad W-, Thus if B is the vector of reordered argumets the we satisfy the properties of a probability distributio, they ca express this as lie i the uit iterval ad sum to oe, he suggested F w ( a 1, a,..., a ) = W T B, that the compoets i W ca be iterpreted as a kid of it is the ier product of the weightig vector ad the subjective probabilities. I particular, he suggested that vector of ordered argumets. w j ca be iterpreted as the decisio maker's subjective I [8] we suggested the use of the OWA operator as probability that the j th best outcome will occur. With a structure for providig a uificatio ad geeralizatio this iterpretatio, the pessimist is sayig, sice i this of the decisio makig formalisms used i decisio case w = 1, that the probability that the worst thig makig uder possibilistic ucertaity. Assume A i is a will happe is oe while the optimist is sayig that the decisio alterative with payoff bag [Ci1, C probability that the best thig will happe is oe. i,..., Uder this iterpretatio of the w j 's, as these type of Ci] the we suggested usig Val(Ai) = F W (Ci1, C i,..., Ci) as the valuatio of the alterative. By probabilities ad with b j beig the j th best payoff, we appropriately selectig W we ca obtai ay of the previously itroduced evaluatio fuctios.

3 are the ordered payoffs for alteratives A see the the evaluatio Val(A i ) =  1 ad A b j w j is a kid of respectively. Let us look at differet kids of decisio makers. expected value. (1) W T = 1 1 I order to use this OWA approach for valuatig 0 0, this is a strogly alteratives, we eed select a attitudial vector W. A optimistic decisio maker. I this case umber of approaches have be suggested for the determiatio of the attitudial vector W. Here we Val(A 1 ) = 1 ( ) = 80 describe oe approach. I this approach, all that is Val(A ) = 1 ( ) = 75 required of the decisio maker is that they provide a value a Œ [0, 1] idicatig their desired degree of Here A 1 is the preferred alterative.. optimism. Usig this value the weights for the () If W T = , strogly pessimistic appropriate attitudial vector ca be obtaied by solvig the followig mathematical programmig problem. decisio maker. I this case Val(A 1 ) = 1 ( + 30) = 40 Maximize:  w j l(w j ) Val(A ) = 1 ( ) = 55 Subject to: Here A is preferred. 1.w Œ [0, 1] j (3) For the eutral decisio maker, W.  w j = 1 = we get Val(A 1 ) - 1 ( ) = w j ( - j) = a Val(A - 1 ) = 1 ( ) = 65 4 I the above we see that costraits 1 ad are the Here A is agai preferred. basic costraits for the OWA vector. Costrait 3 (4) If we cosider a decisio maker with a = 0.65 assures us that the degree of optimism of the determied ad use the weights obtaied by solvig the precedig vector satisfies our desired coditio of a. The mathematical programmig problem, we have objective fuctio ca be see as oe of maximizig the W T = etropy of the determied weights. This approach ca I this case be see as a geeralizatio of the Arrow-Hurwicz criteria Val(A 1 ) = (4)100 + (0.8)(60) + (0.19)) [1]. I both approaches the decisio maker supplies a + (13) = 70. degree of optimism. I the Arrow-Hurwicz criteria, we Val(A ) = (0.4)80 + (8)(70) + (0.19))60 oly allocate weight to the maximal ad miimal + (13) = 69.5 payoffs associated with a alterative. I this approach the weight is distributed to all the payoffs associated Decisio Makig with D-S Belief with the alterative beig evaluated. Structures The followig example illustrates the use of the We have cosidered decisio makig i situatios OWA operator. i which the iformatio about the ucertai variable V x 1 x x 3 x 4 is possibilistic. The Dempster-Shafer belief structures provides aother ucertai kowledge represetatio. Example: A We first provide a formal characterizatio of the A Here Dempster Shafer belief structure. A Dempster-Shafer belief structure defied o a set X has a associated collectio of subsets of X, B j for B 1 = j = 1 to, called focal elemets ad a mappig m associatig values with subsets of X, ad B = m: 60 Æ [0, 1] such that: 30

4 1). at some future date. Assume iterest rates are  m(b j ) = 1 determied by the Federal Reserve Board. Assume that the board is cosiderig three policies: make iterest ). m(a) = 0 for A ot a focal elemet. rates low, make iterest rates high ad ot iterfere with Two measures that are defied o these belief iterest rates. We believe that there is a % chace structures, which we shall fid useful, are the measure that the first policy will be followed, 0% chace of the of plausibility ad belief. The plausibility measure Pl secod ad a 30% chace of the third. We ca represet is a mappig Pl: X Æ [0,1] defied as the iformatio about the variable V, future iterest rates, as a belief structure i which B 1 is the subset of Pl(A) =  all j s.t. A «B j π m(b j ). The measure of belief, Bel, is a mappig o subsets of Xdefied by Bel(A) =  m(b j ) all j s.t. A Õ B j It ca be show that Bel(A) = 1 - Pl(A). A importat special case of belief structures are X, the set of iterest rates, cosistig of low iterest rates, B is the subset of X cosistig of high iterest rates ad B 3 = X, ay iterest rate. Give a D-S belief a issue of cocer is the determiatio of the probability that the value of V lies i some subset A of X; Prob(A). Geerally, because of the type of ucertaity modeled by the D-S this value ca't be precisely obtaied. The best we ca do is to fid upper ad lower bouds, Prob + (A) ad Prob - (A) called cosoat belief structure i this case the focal such that elemets are ested, that is they ca be idexed so that Prob - (A) Prob(A) Prob + (A) B 1 à B... à B. I this case the plausibility It ca be show that these bouds are related to the measure has the special property that measures of of plausibility ad belief itroduced earlier, Pl(E» F) = Max[Pl(E), Pl(F)] i particular Prob + (A) = Pl(A) ad Prob - (B) = Bel(A). A various sematics ca be associated with the D-S Usig this D-S represetatio various types of the belief structure. We shall fid the followig sematics, kowledge ca be represeted for example the oe very much i the spirit of radom sets, useful for kowledge that that Prob(A) a is represetable by a our curret iterest, decisio makig uder ucertaity. belief structure i which B 1 = A ad B = X ad m(b 1 ) Let V be a variable that takes its value i the set X. = a ad m(b ) = 1 - a. The kowledge that Prob(A) Assume our kowledge about the value of this variable is that it is determied at least i part by performace of = a is represetable i this structure by a belief a biased radom experimet. I this radom experimet structure i which B 1 = A ad B = A ad where the outcomes, rather beig elemets of X are subsets of m(b 1 ) = a ad m(b ) = 1 - a. the space X. Furthermore, it is assumed that the actual We shall ow tur to the issue of decisio makig value of V must be a elemet of the set that is i situatios i which our kowledge about the determied by the radom experimet. We let p j be the ucertai variable is represeted by a D-S belief probability that F j is the outcome subset of the structure. experimet. If we assig F Assume we have a decisio problem where our j = B j ad let m(b j ) = p j the we ca represet this as a D-S belief structure. kowledge about the ucertai variable V is represeted Probabilistic ucertaity is a special case of this by a belief structure with focal elemets F 1,..., F q structure i which the focal elemets are sigletos, with weightig fuctio m. I [8] we suggested a B geeral approach to this decisio problem based upo a j = {x j } ad m(b j ) = p j, the probability of x j..the determiatio of a valuatio Val(A i ) for each possibilistic ucertaity previously discussed is a special case of a belief structure, it is oe i which alterative. The procedure used for the valuatio of a alterative is give i the followig. I order to use B 1 = X ad m(b 1 ) = 1. this approach the decisio maker must provide a value The ext example is a illustratio of a case i a Œ [0, 1] correspodig to the degree of optimism which we have kowledge of a ucertai variable that they wat to use i the decisio problem. This degree is ot represetable by the possibilistic or probability of optimist will be used to geerate attitudial model but is represetable by the D-S belief structure. weightig vectors usig algorithm of the earlier sectio. Let V be a variable correspodig to iterest rates I the followig we shall use W a,r to idicate the

5 attitudial vector of dimesio r geerated from this Val(A 1 /3) = (70)(0.75) + ()(0.5) = 65 algorithm based upo a degree of optimism. The Fially, procedure evaluatig alterative A i is as follows: 3 1). For each focal elemet F j calculate Val(A i /j ) Val(A 1 ) =  Val(A 1 /j ) p j where Val(A i /j ) = (W a, ) T B j j. Here j is the = (90)(0.5) + (65.1)(0.3) + (65)(0.) = cardiality of the focal set F j, B j is the vector If we used a = 0.5 istead of 0.75 the for cosistig of the ordered payoffs that are associated with = : w 1 = w = 1 the elemets i F j ad the alterative A i. (Val(A i /j ) is a OWA aggregatio with attitudial vector W = 3: w 1 = w = w 3 = 1 a,j ad 3 I this case argumets C ik for all x k Œ F j ). Val(A 1 /1 ) = 1 ( ) = 80 ) Calculate Val(A i ) as the expected value of the Val(A i /j) that is Val(A i ) =  Val(A i/ j ) p j Val(A 1 / ) = 1 ( ) = 60 3 Val(A 1 /3 ) = 1 (70 + ) = 60 Here Val(A 1 ) = (80)(0.5) + (60)(0.3) + (60)(0.) = 70. here of course p j = m(b j ). Notice the valuatio for a = 0.5 is less the the case i We see that i step oe we used the possibilistic which we used a = 0.75 this is because it is more techique ad i step two we used the expected value pessimistic. characteristic of probabilistic eviromet. We ca calculate Val(A ) i a similar maer, The followig example illustrates the procedure however we shall ot do this. just described. Example: Agai we assume the followig decisio Graded Possibilistic Decisio Makig matrix: Possibilistic ucertaity is ofte geerated from x 1 x x 3 x 4 liguistic iformatio. A example of this is the A statemet "iterest rates will be low." Here we obtai A as the set of possible iterest rates all those cosidered We assume kowledge of the ucertai variable V as low. With the itroductio of Zadeh's work o fuzzy is expressed by the followig belief structure with three sets [13] we have become much more aware of the fact focal elemets: F that cocepts such as "low iterest rates" rather tha 1 = {x 1, x }, F = {x, x 3, x 4 }, beig crisp ad well bouded are imprecise ad fuzzy. F 3 = {x 3, x 4 } where m(f 1 ) = 0.5, m(f ) = 0.3 ad I particular, the set of low iterest rates rather tha m(f 3 ) = 0.. beig a crisp set is i reality a fuzzy subset. This Here we shall assume our degree of optimism a = observatio requires us to have to come to grips with Usig our algorithm we obtai the followig graded possibilistic iformatio. I particular, attitudial vectors for = ad 3. iformatio about a variable V based o fuzzy subsets = : w iduces a possibility distributio P [1] o the domai 1 = 0.75 w = 0.5 of V where for each x i the domai P(x) Œ [0, 1] = 3 w 1 = 0.6 w = 0.7 w 3 = 0.11 idicates the possibility that x is the value of the For F 1, F, ad F 3 the collectio of associated payoffs variable V. We shall at this poit ot digress ito the are respectively [100, 60], [60, 70, ] ad [70, ]. theory of possibility, however we ote that [3, 14] These result i followig ordered payoff vectors:. provides a comprehesive itroductio to the field. Here we shall oly cosider the problem of decisio B 1 = B = 60 B 3 = 70 makig with graded possibilities. Thus we shall assume for each x Œ X there exists a value P(x) Œ [0, 60 1] idicatig the possibility that x is the value of V. Usig this we get As with all cases of possibilistic decisio makig Val(A we must provide some idicatio of the decisio makers 1 /1) = (100)(0.75) + (60)(0.5) = 90 attitude, here we shall assume a decisio maker with Val(A 1 /) = (70)(0.6) + (60)(0.7) + (0.11) =65.1 degree of optimism a. For otatioal simplicity we

6 shall use OWA a (G) to idicate the aggregatio of the 1 elemets i the set G usig the attitudial vector Val(A 1 ) = A 1/u du = (70)(0.3) + (73.3)(0.) + geerated by a degree of optimism a ad dimesio equal to the cardiality of G. 0 (85)(0.3) + (70)(0.) = I calculatig Val(A i ) i this case of graded A atural extesio here is to cosider the cases i possibilistic ucertaity rather the treatig all which we have graded possibility i Dempster-Shafer outcomes similarly we eed give more weight to those belief structures. I this case the focal elemets rather outcomes havig larger grade of possibility. The the beig crisp subsets of the domai would be fuzzy followig is a procedure for evaluatig Val(A i ) i this subsets of the domai. Here each focal elemet F j eviromet of graded possibility would iduce a graded possibility distributio P j o the 0. Determie the largest degree of possibility for domai of the ucertai variable i which P j (x) = F j (x), ay elemet i the domai X of the ucertai variable the membership grade of x i the fuzzy focal elemet. ad deote this as U max. The valuatio process i this case would require that i 1. For each u Π[0, U max ] deote F u as the calculatig Val(A i/j ), the valuatio of the alterative subset of X for which P(x) u. F u are sometimes with respect to the jth focal elemet, we use the called level sets. procedure described i this sectio for graded ). For each F u obtai the bag of associated possibilistic decisio makig. payoffs for the alterative beig evaluated, B u. Thus if Coclusio x k ΠF U the C ik is i the bag B u. We believe that possibility theory ad D-S theory 3). Calculate Val(A i/u ) = OWA (B a u ) provide useful frameworks for the represetatio of ucertaity i maagemet chace discovery. Here we U max 4) Val(A i ) = 1 have focused o the issue of decisio makig uder OWAa du these types of ucertaity. We particularly oted the Umax 0 importace of the role of decisio attitude. The followig example illustrates this approach. Example: Assume the payoffs for alterative A i is A x 1 x x 3 x 4 ad we have the followig iformatio o graded possibilities P(x 1 ) = 0.8, P(x ) = 0.3, P(x 3 ) = 1, P(x 4 ) = 0.5 I this case Referece [1]. Zadeh, L. A., "Fuzzy sets as a basis for a theory of possibility," Fuzzy Sets ad Systems 1, 3-8, []. Dubois, D. ad Prade, H., Possibility Theory : A Approach to Computerized Processig of Ucertaity, Pleum Press: New York, [3]. De Cooma, G., Rua, D. ad Kerre, E. E., Foudatios ad Applicatios of Possibility Theory, F u = {x 1, x, x 3, x 4 } u 0.3 World Scietific: Sigapore, F u = {x 1, x 3, x 4 } 0.3< u 0.5 [4]. Yager, R. R., "O the istatiatio of possibility distributios," Fuzzy Sets ad Systems 18, 61-65, F u = {x 1, x 3 } 0.5 < u F u = {x 3 } 0.8 < u 1 [5]. Shafer, G., A Mathematical Theory of Evidece, ad therefore, Priceto Uiversity Press: Priceto, N.J., B u = {100, 60, 70, } u 0.3 [6]. Yager, R. R., Kacprzyk, J. ad Fedrizzi, M., B u = {100, 70, } 0.3 < u 0.5 Advaces i the Dempster-Shafer Theory of Evidece, B u = {100, 70} 0.5 < u 0.8 Joh Wiley & Sos: New York, B u = {70} 0.8 < u 1 [7]. Yager, R. R., "Fuzzy modelig for itelliget For simplicity we shall assume a eutral decisio decisio makig uder ucertaity," IEEE Trasactios maker, a = 0.5. Thus at each level we take the average. o Systems, Ma ad Cyberetics Part B: Cyberetics Val(A 1/u ) = 70 u , 60-70, 000. Val(A [8]. Yager, R. R., "Decisio makig uder Dempster- 1/u ) = < u 0.5 Val(A Shafer ucertaities," Iteratioal Joural of Geeral 1/u ) = < u 0.8 Systems 0, 33-45, 199. Val(A 1/u ) = < u 1

7 [9]. Yager, R. R., "O ordered weighted averagig aggregatio operators i multi-criteria decisio makig," IEEE Trasactios o Systems, Ma ad Cyberetics 18, , [10]. Yager, R. R. ad Kacprzyk, J., The Ordered Weighted Averagig Operators: Theory ad Applicatios, Kluwer: Norwell, MA, [11]. Yager, R. R., "O the iclusio of importaces i OWA aggregatios," i The Ordered Weighted Averagig Operators: Theory ad Applicatios, edited by Yager, R. R. ad Kacprzyk, J., Kluwer Academic Publishers: Norwell, MA, 41-59, [1]. Arrow, K. J. ad Hurwicz, L., "A optimality criterio for decisio makig uder igorace," i Ucertaity ad Expectatios i Ecoomics, edited by Carter, C. F. ad Ford, J. L., Kelley: New Jersey, 197. [13]. Zadeh, L. A., "Fuzzy sets," Iformatio ad Cotrol 8, , [14]. Klir, G. J. ad Yua, B., Fuzzy Sets ad Fuzzy Logic: Theory ad Applicatios, Pretice Hall: Upper Saddle River, NJ, 1995.

A Unified Model between the OWA Operator and the Weighted Average in Decision Making with Dempster-Shafer Theory

A Unified Model between the OWA Operator and the Weighted Average in Decision Making with Dempster-Shafer Theory Proceedigs of the World Cogress o Egieerig 200 Vol I, Jue 30 - July 2, 200, Lodo, U.K. A Uified Model betwee the OWA Operator ad the Weighted Average i Decisio Makig with Dempster-Shafer Theory José M.

More information

Interval Intuitionistic Trapezoidal Fuzzy Prioritized Aggregating Operators and their Application to Multiple Attribute Decision Making

Interval Intuitionistic Trapezoidal Fuzzy Prioritized Aggregating Operators and their Application to Multiple Attribute Decision Making Iterval Ituitioistic Trapezoidal Fuzzy Prioritized Aggregatig Operators ad their Applicatio to Multiple Attribute Decisio Makig Xia-Pig Jiag Chogqig Uiversity of Arts ad Scieces Chia cqmaagemet@163.com

More information

The Random Walk For Dummies

The Random Walk For Dummies The Radom Walk For Dummies Richard A Mote Abstract We look at the priciples goverig the oe-dimesioal discrete radom walk First we review five basic cocepts of probability theory The we cosider the Beroulli

More information

The Choquet Integral with Respect to Fuzzy-Valued Set Functions

The Choquet Integral with Respect to Fuzzy-Valued Set Functions The Choquet Itegral with Respect to Fuzzy-Valued Set Fuctios Weiwei Zhag Abstract The Choquet itegral with respect to real-valued oadditive set fuctios, such as siged efficiecy measures, has bee used i

More information

Statistics 511 Additional Materials

Statistics 511 Additional Materials Cofidece Itervals o mu Statistics 511 Additioal Materials This topic officially moves us from probability to statistics. We begi to discuss makig ifereces about the populatio. Oe way to differetiate probability

More information

On the Use of the OWA Operator in the Weighted Average and its Application in Decision Making

On the Use of the OWA Operator in the Weighted Average and its Application in Decision Making Proceedigs of the World Cogress o Egieerig 2009 Vol I WCE 2009, July - 3, 2009, Lodo, U.K. O the Use of the OWA Operator i the Weighted Average ad its Applicatio i Decisio Makig José M. Merigó, Member,

More information

An Intuitionistic fuzzy count and cardinality of Intuitionistic fuzzy sets

An Intuitionistic fuzzy count and cardinality of Intuitionistic fuzzy sets Malaya Joural of Matematik 4(1)(2013) 123 133 A Ituitioistic fuzzy cout ad cardiality of Ituitioistic fuzzy sets B. K. Tripathy a, S. P. Jea b ad S. K. Ghosh c, a School of Computig Scieces ad Egieerig,

More information

Testing Statistical Hypotheses for Compare. Means with Vague Data

Testing Statistical Hypotheses for Compare. Means with Vague Data Iteratioal Mathematical Forum 5 o. 3 65-6 Testig Statistical Hypotheses for Compare Meas with Vague Data E. Baloui Jamkhaeh ad A. adi Ghara Departmet of Statistics Islamic Azad iversity Ghaemshahr Brach

More information

Probability, Expectation Value and Uncertainty

Probability, Expectation Value and Uncertainty Chapter 1 Probability, Expectatio Value ad Ucertaity We have see that the physically observable properties of a quatum system are represeted by Hermitea operators (also referred to as observables ) such

More information

Infinite Sequences and Series

Infinite Sequences and Series Chapter 6 Ifiite Sequeces ad Series 6.1 Ifiite Sequeces 6.1.1 Elemetary Cocepts Simply speakig, a sequece is a ordered list of umbers writte: {a 1, a 2, a 3,...a, a +1,...} where the elemets a i represet

More information

Element sampling: Part 2

Element sampling: Part 2 Chapter 4 Elemet samplig: Part 2 4.1 Itroductio We ow cosider uequal probability samplig desigs which is very popular i practice. I the uequal probability samplig, we ca improve the efficiecy of the resultig

More information

This is an introductory course in Analysis of Variance and Design of Experiments.

This is an introductory course in Analysis of Variance and Design of Experiments. 1 Notes for M 384E, Wedesday, Jauary 21, 2009 (Please ote: I will ot pass out hard-copy class otes i future classes. If there are writte class otes, they will be posted o the web by the ight before class

More information

6.3 Testing Series With Positive Terms

6.3 Testing Series With Positive Terms 6.3. TESTING SERIES WITH POSITIVE TERMS 307 6.3 Testig Series With Positive Terms 6.3. Review of what is kow up to ow I theory, testig a series a i for covergece amouts to fidig the i= sequece of partial

More information

Linear Programming and the Simplex Method

Linear Programming and the Simplex Method Liear Programmig ad the Simplex ethod Abstract This article is a itroductio to Liear Programmig ad usig Simplex method for solvig LP problems i primal form. What is Liear Programmig? Liear Programmig is

More information

Estimation for Complete Data

Estimation for Complete Data Estimatio for Complete Data complete data: there is o loss of iformatio durig study. complete idividual complete data= grouped data A complete idividual data is the oe i which the complete iformatio of

More information

Information-based Feature Selection

Information-based Feature Selection Iformatio-based Feature Selectio Farza Faria, Abbas Kazeroui, Afshi Babveyh Email: {faria,abbask,afshib}@staford.edu 1 Itroductio Feature selectio is a topic of great iterest i applicatios dealig with

More information

Lecture 2: Monte Carlo Simulation

Lecture 2: Monte Carlo Simulation STAT/Q SCI 43: Itroductio to Resamplig ethods Sprig 27 Istructor: Ye-Chi Che Lecture 2: ote Carlo Simulatio 2 ote Carlo Itegratio Assume we wat to evaluate the followig itegratio: e x3 dx What ca we do?

More information

IP Reference guide for integer programming formulations.

IP Reference guide for integer programming formulations. IP Referece guide for iteger programmig formulatios. by James B. Orli for 15.053 ad 15.058 This documet is iteded as a compact (or relatively compact) guide to the formulatio of iteger programs. For more

More information

POSSIBILISTIC OPTIMIZATION WITH APPLICATION TO PORTFOLIO SELECTION

POSSIBILISTIC OPTIMIZATION WITH APPLICATION TO PORTFOLIO SELECTION THE PUBLISHING HOUSE PROCEEDINGS OF THE ROMANIAN ACADEMY, Series A, OF THE ROMANIAN ACADEMY Volume, Number /, pp 88 9 POSSIBILISTIC OPTIMIZATION WITH APPLICATION TO PORTFOLIO SELECTION Costi-Cipria POPESCU,

More information

It is always the case that unions, intersections, complements, and set differences are preserved by the inverse image of a function.

It is always the case that unions, intersections, complements, and set differences are preserved by the inverse image of a function. MATH 532 Measurable Fuctios Dr. Neal, WKU Throughout, let ( X, F, µ) be a measure space ad let (!, F, P ) deote the special case of a probability space. We shall ow begi to study real-valued fuctios defied

More information

4.3 Growth Rates of Solutions to Recurrences

4.3 Growth Rates of Solutions to Recurrences 4.3. GROWTH RATES OF SOLUTIONS TO RECURRENCES 81 4.3 Growth Rates of Solutios to Recurreces 4.3.1 Divide ad Coquer Algorithms Oe of the most basic ad powerful algorithmic techiques is divide ad coquer.

More information

ECE 8527: Introduction to Machine Learning and Pattern Recognition Midterm # 1. Vaishali Amin Fall, 2015

ECE 8527: Introduction to Machine Learning and Pattern Recognition Midterm # 1. Vaishali Amin Fall, 2015 ECE 8527: Itroductio to Machie Learig ad Patter Recogitio Midterm # 1 Vaishali Ami Fall, 2015 tue39624@temple.edu Problem No. 1: Cosider a two-class discrete distributio problem: ω 1 :{[0,0], [2,0], [2,2],

More information

w (1) ˆx w (1) x (1) /ρ and w (2) ˆx w (2) x (2) /ρ.

w (1) ˆx w (1) x (1) /ρ and w (2) ˆx w (2) x (2) /ρ. 2 5. Weighted umber of late jobs 5.1. Release dates ad due dates: maximimizig the weight of o-time jobs Oce we add release dates, miimizig the umber of late jobs becomes a sigificatly harder problem. For

More information

1 Duality revisited. AM 221: Advanced Optimization Spring 2016

1 Duality revisited. AM 221: Advanced Optimization Spring 2016 AM 22: Advaced Optimizatio Sprig 206 Prof. Yaro Siger Sectio 7 Wedesday, Mar. 9th Duality revisited I this sectio, we will give a slightly differet perspective o duality. optimizatio program: f(x) x R

More information

Lecture 2: April 3, 2013

Lecture 2: April 3, 2013 TTIC/CMSC 350 Mathematical Toolkit Sprig 203 Madhur Tulsiai Lecture 2: April 3, 203 Scribe: Shubhedu Trivedi Coi tosses cotiued We retur to the coi tossig example from the last lecture agai: Example. Give,

More information

Fuzzy Shortest Path with α- Cuts

Fuzzy Shortest Path with α- Cuts Iteratioal Joural of Mathematics Treds ad Techology (IJMTT) Volume 58 Issue 3 Jue 2018 Fuzzy Shortest Path with α- Cuts P. Sadhya Assistat Professor, Deptt. Of Mathematics, AIMAN College of Arts ad Sciece

More information

6 Integers Modulo n. integer k can be written as k = qn + r, with q,r, 0 r b. So any integer.

6 Integers Modulo n. integer k can be written as k = qn + r, with q,r, 0 r b. So any integer. 6 Itegers Modulo I Example 2.3(e), we have defied the cogruece of two itegers a,b with respect to a modulus. Let us recall that a b (mod ) meas a b. We have proved that cogruece is a equivalece relatio

More information

Axioms of Measure Theory

Axioms of Measure Theory MATH 532 Axioms of Measure Theory Dr. Neal, WKU I. The Space Throughout the course, we shall let X deote a geeric o-empty set. I geeral, we shall ot assume that ay algebraic structure exists o X so that

More information

Product measures, Tonelli s and Fubini s theorems For use in MAT3400/4400, autumn 2014 Nadia S. Larsen. Version of 13 October 2014.

Product measures, Tonelli s and Fubini s theorems For use in MAT3400/4400, autumn 2014 Nadia S. Larsen. Version of 13 October 2014. Product measures, Toelli s ad Fubii s theorems For use i MAT3400/4400, autum 2014 Nadia S. Larse Versio of 13 October 2014. 1. Costructio of the product measure The purpose of these otes is to preset the

More information

Frequentist Inference

Frequentist Inference Frequetist Iferece The topics of the ext three sectios are useful applicatios of the Cetral Limit Theorem. Without kowig aythig about the uderlyig distributio of a sequece of radom variables {X i }, for

More information

6.883: Online Methods in Machine Learning Alexander Rakhlin

6.883: Online Methods in Machine Learning Alexander Rakhlin 6.883: Olie Methods i Machie Learig Alexader Rakhli LECTURES 5 AND 6. THE EXPERTS SETTING. EXPONENTIAL WEIGHTS All the algorithms preseted so far halluciate the future values as radom draws ad the perform

More information

TEACHER CERTIFICATION STUDY GUIDE

TEACHER CERTIFICATION STUDY GUIDE COMPETENCY 1. ALGEBRA SKILL 1.1 1.1a. ALGEBRAIC STRUCTURES Kow why the real ad complex umbers are each a field, ad that particular rigs are ot fields (e.g., itegers, polyomial rigs, matrix rigs) Algebra

More information

Analysis of Experimental Measurements

Analysis of Experimental Measurements Aalysis of Experimetal Measuremets Thik carefully about the process of makig a measuremet. A measuremet is a compariso betwee some ukow physical quatity ad a stadard of that physical quatity. As a example,

More information

Towards Decision Making under Interval, Set-Valued, Fuzzy, and Z-Number Uncertainty: A Fair Price Approach

Towards Decision Making under Interval, Set-Valued, Fuzzy, and Z-Number Uncertainty: A Fair Price Approach Towards Decisio Makig uder Iterval, Set-Valued, Fuzzy, ad Z-Number Ucertaity: A Fair Price Approach Joe Lorkowski, Rafik Aliev, ad Vladik Kreiovich Abstract I this paper, we explore oe of the possible

More information

Product Mix Problem with Radom Return and Preference of Production Quantity. Osaka University Japan

Product Mix Problem with Radom Return and Preference of Production Quantity. Osaka University Japan Product Mix Problem with Radom Retur ad Preferece of Productio Quatity Hiroaki Ishii Osaka Uiversity Japa We call such fiace or idustrial assets allocatio problems portfolio selectio problems, ad various

More information

Chapter 3. Strong convergence. 3.1 Definition of almost sure convergence

Chapter 3. Strong convergence. 3.1 Definition of almost sure convergence Chapter 3 Strog covergece As poited out i the Chapter 2, there are multiple ways to defie the otio of covergece of a sequece of radom variables. That chapter defied covergece i probability, covergece i

More information

Confidence Intervals for the Population Proportion p

Confidence Intervals for the Population Proportion p Cofidece Itervals for the Populatio Proportio p The cocept of cofidece itervals for the populatio proportio p is the same as the oe for, the samplig distributio of the mea, x. The structure is idetical:

More information

Random Variables, Sampling and Estimation

Random Variables, Sampling and Estimation Chapter 1 Radom Variables, Samplig ad Estimatio 1.1 Itroductio This chapter will cover the most importat basic statistical theory you eed i order to uderstad the ecoometric material that will be comig

More information

WHAT IS THE PROBABILITY FUNCTION FOR LARGE TSUNAMI WAVES? ABSTRACT

WHAT IS THE PROBABILITY FUNCTION FOR LARGE TSUNAMI WAVES? ABSTRACT WHAT IS THE PROBABILITY FUNCTION FOR LARGE TSUNAMI WAVES? Harold G. Loomis Hoolulu, HI ABSTRACT Most coastal locatios have few if ay records of tsuami wave heights obtaied over various time periods. Still

More information

Machine Learning for Data Science (CS 4786)

Machine Learning for Data Science (CS 4786) Machie Learig for Data Sciece CS 4786) Lecture & 3: Pricipal Compoet Aalysis The text i black outlies high level ideas. The text i blue provides simple mathematical details to derive or get to the algorithm

More information

CHAPTER I: Vector Spaces

CHAPTER I: Vector Spaces CHAPTER I: Vector Spaces Sectio 1: Itroductio ad Examples This first chapter is largely a review of topics you probably saw i your liear algebra course. So why cover it? (1) Not everyoe remembers everythig

More information

Properties and Hypothesis Testing

Properties and Hypothesis Testing Chapter 3 Properties ad Hypothesis Testig 3.1 Types of data The regressio techiques developed i previous chapters ca be applied to three differet kids of data. 1. Cross-sectioal data. 2. Time series data.

More information

Empirical Distributions

Empirical Distributions Empirical Distributios A empirical distributio is oe for which each possible evet is assiged a probability derived from experimetal observatio. It is assumed that the evets are idepedet ad the sum of the

More information

Optimization Methods MIT 2.098/6.255/ Final exam

Optimization Methods MIT 2.098/6.255/ Final exam Optimizatio Methods MIT 2.098/6.255/15.093 Fial exam Date Give: December 19th, 2006 P1. [30 pts] Classify the followig statemets as true or false. All aswers must be well-justified, either through a short

More information

Chapter 6 Sampling Distributions

Chapter 6 Sampling Distributions Chapter 6 Samplig Distributios 1 I most experimets, we have more tha oe measuremet for ay give variable, each measuremet beig associated with oe radomly selected a member of a populatio. Hece we eed to

More information

Testing Statistical Hypotheses with Fuzzy Data

Testing Statistical Hypotheses with Fuzzy Data Iteratioal Joural of Statistics ad Systems ISS 973-675 Volume 6, umber 4 (), pp. 44-449 Research Idia Publicatios http://www.ripublicatio.com/ijss.htm Testig Statistical Hypotheses with Fuzzy Data E. Baloui

More information

A statistical method to determine sample size to estimate characteristic value of soil parameters

A statistical method to determine sample size to estimate characteristic value of soil parameters A statistical method to determie sample size to estimate characteristic value of soil parameters Y. Hojo, B. Setiawa 2 ad M. Suzuki 3 Abstract Sample size is a importat factor to be cosidered i determiig

More information

Advanced Stochastic Processes.

Advanced Stochastic Processes. Advaced Stochastic Processes. David Gamarik LECTURE 2 Radom variables ad measurable fuctios. Strog Law of Large Numbers (SLLN). Scary stuff cotiued... Outlie of Lecture Radom variables ad measurable fuctios.

More information

CALCULATING FIBONACCI VECTORS

CALCULATING FIBONACCI VECTORS THE GENERALIZED BINET FORMULA FOR CALCULATING FIBONACCI VECTORS Stuart D Aderso Departmet of Physics, Ithaca College 953 Daby Road, Ithaca NY 14850, USA email: saderso@ithacaedu ad Dai Novak Departmet

More information

Modeling and Estimation of a Bivariate Pareto Distribution using the Principle of Maximum Entropy

Modeling and Estimation of a Bivariate Pareto Distribution using the Principle of Maximum Entropy Sri Laka Joural of Applied Statistics, Vol (5-3) Modelig ad Estimatio of a Bivariate Pareto Distributio usig the Priciple of Maximum Etropy Jagathath Krisha K.M. * Ecoomics Research Divisio, CSIR-Cetral

More information

6.867 Machine learning

6.867 Machine learning 6.867 Machie learig Mid-term exam October, ( poits) Your ame ad MIT ID: Problem We are iterested here i a particular -dimesioal liear regressio problem. The dataset correspodig to this problem has examples

More information

Let us give one more example of MLE. Example 3. The uniform distribution U[0, θ] on the interval [0, θ] has p.d.f.

Let us give one more example of MLE. Example 3. The uniform distribution U[0, θ] on the interval [0, θ] has p.d.f. Lecture 5 Let us give oe more example of MLE. Example 3. The uiform distributio U[0, ] o the iterval [0, ] has p.d.f. { 1 f(x =, 0 x, 0, otherwise The likelihood fuctio ϕ( = f(x i = 1 I(X 1,..., X [0,

More information

Stochastic Matrices in a Finite Field

Stochastic Matrices in a Finite Field Stochastic Matrices i a Fiite Field Abstract: I this project we will explore the properties of stochastic matrices i both the real ad the fiite fields. We first explore what properties 2 2 stochastic matrices

More information

Topic 5: Basics of Probability

Topic 5: Basics of Probability Topic 5: Jue 1, 2011 1 Itroductio Mathematical structures lie Euclidea geometry or algebraic fields are defied by a set of axioms. Mathematical reality is the developed through the itroductio of cocepts

More information

Vector Quantization: a Limiting Case of EM

Vector Quantization: a Limiting Case of EM . Itroductio & defiitios Assume that you are give a data set X = { x j }, j { 2,,, }, of d -dimesioal vectors. The vector quatizatio (VQ) problem requires that we fid a set of prototype vectors Z = { z

More information

Methods for strategic decision-making problems with immediate probabilities in intuitionistic fuzzy setting

Methods for strategic decision-making problems with immediate probabilities in intuitionistic fuzzy setting Scietia Iraica E (2012) 19 (6) 1936 1946 Sharif Uiversity of Techology Scietia Iraica Trasactios E: Idustrial Egieerig www.sciecedirect.com Methods for strategic decisio-makig problems with immediate probabilities

More information

An Introduction to Randomized Algorithms

An Introduction to Randomized Algorithms A Itroductio to Radomized Algorithms The focus of this lecture is to study a radomized algorithm for quick sort, aalyze it usig probabilistic recurrece relatios, ad also provide more geeral tools for aalysis

More information

Machine Learning Theory Tübingen University, WS 2016/2017 Lecture 12

Machine Learning Theory Tübingen University, WS 2016/2017 Lecture 12 Machie Learig Theory Tübige Uiversity, WS 06/07 Lecture Tolstikhi Ilya Abstract I this lecture we derive risk bouds for kerel methods. We will start by showig that Soft Margi kerel SVM correspods to miimizig

More information

Analysis of the Chow-Robbins Game with Biased Coins

Analysis of the Chow-Robbins Game with Biased Coins Aalysis of the Chow-Robbis Game with Biased Cois Arju Mithal May 7, 208 Cotets Itroductio to Chow-Robbis 2 2 Recursive Framework for Chow-Robbis 2 3 Geeralizig the Lower Boud 3 4 Geeralizig the Upper Boud

More information

SOME DISTANCE MEASURES FOR INTUITIONISTIC UNCERTAIN LINGUISTIC SETS AND THEIR APPLICATION TO GROUP DECISION MAKING

SOME DISTANCE MEASURES FOR INTUITIONISTIC UNCERTAIN LINGUISTIC SETS AND THEIR APPLICATION TO GROUP DECISION MAKING Lecturer Bi Jiaxi, PhD Uiversity of Shaghai for Sciece ad Techology Zheiag Wali Uiversity Professor Lei Liaghai, PhD Uiversity of Shaghai for Sciece ad Techology Lecturer Peg Bo, PhD ( Correspodig author)

More information

MA238 Assignment 4 Solutions (part a)

MA238 Assignment 4 Solutions (part a) (i) Sigle sample tests. Questio. MA38 Assigmet 4 Solutios (part a) (a) (b) (c) H 0 : = 50 sq. ft H A : < 50 sq. ft H 0 : = 3 mpg H A : > 3 mpg H 0 : = 5 mm H A : 5mm Questio. (i) What are the ull ad alterative

More information

1 Inferential Methods for Correlation and Regression Analysis

1 Inferential Methods for Correlation and Regression Analysis 1 Iferetial Methods for Correlatio ad Regressio Aalysis I the chapter o Correlatio ad Regressio Aalysis tools for describig bivariate cotiuous data were itroduced. The sample Pearso Correlatio Coefficiet

More information

Standard Bayesian Approach to Quantized Measurements and Imprecise Likelihoods

Standard Bayesian Approach to Quantized Measurements and Imprecise Likelihoods Stadard Bayesia Approach to Quatized Measuremets ad Imprecise Likelihoods Lawrece D. Stoe Metro Ic. Resto, VA USA Stoe@metsci.com Abstract I this paper we show that the stadard defiitio of likelihood fuctio

More information

M.Jayalakshmi and P. Pandian Department of Mathematics, School of Advanced Sciences, VIT University, Vellore-14, India.

M.Jayalakshmi and P. Pandian Department of Mathematics, School of Advanced Sciences, VIT University, Vellore-14, India. M.Jayalakshmi, P. Padia / Iteratioal Joural of Egieerig Research ad Applicatios (IJERA) ISSN: 48-96 www.iera.com Vol., Issue 4, July-August 0, pp.47-54 A New Method for Fidig a Optimal Fuzzy Solutio For

More information

Lecture 12: February 28

Lecture 12: February 28 10-716: Advaced Machie Learig Sprig 2019 Lecture 12: February 28 Lecturer: Pradeep Ravikumar Scribes: Jacob Tyo, Rishub Jai, Ojash Neopae Note: LaTeX template courtesy of UC Berkeley EECS dept. Disclaimer:

More information

If, for instance, we were required to test whether the population mean μ could be equal to a certain value μ

If, for instance, we were required to test whether the population mean μ could be equal to a certain value μ STATISTICAL INFERENCE INTRODUCTION Statistical iferece is that brach of Statistics i which oe typically makes a statemet about a populatio based upo the results of a sample. I oesample testig, we essetially

More information

AN INTERIM REPORT ON SOFT SYSTEMS EVALUATION

AN INTERIM REPORT ON SOFT SYSTEMS EVALUATION AN INTERIM REPORT ON SOFT SYSTEMS EVALUATION Viljem Rupik INTERACTA, LTD, Busiess Iformatio Processig Parmova 53, Ljubljaa 386 01 4291809, e-mail: Viljem.Rupik@siol.et Abstract: As applicatio areas rapidly

More information

The standard deviation of the mean

The standard deviation of the mean Physics 6C Fall 20 The stadard deviatio of the mea These otes provide some clarificatio o the distictio betwee the stadard deviatio ad the stadard deviatio of the mea.. The sample mea ad variace Cosider

More information

Some examples of vector spaces

Some examples of vector spaces Roberto s Notes o Liear Algebra Chapter 11: Vector spaces Sectio 2 Some examples of vector spaces What you eed to kow already: The te axioms eeded to idetify a vector space. What you ca lear here: Some

More information

Riesz-Fischer Sequences and Lower Frame Bounds

Riesz-Fischer Sequences and Lower Frame Bounds Zeitschrift für Aalysis ud ihre Aweduge Joural for Aalysis ad its Applicatios Volume 1 (00), No., 305 314 Riesz-Fischer Sequeces ad Lower Frame Bouds P. Casazza, O. Christese, S. Li ad A. Lider Abstract.

More information

Basics of Probability Theory (for Theory of Computation courses)

Basics of Probability Theory (for Theory of Computation courses) Basics of Probability Theory (for Theory of Computatio courses) Oded Goldreich Departmet of Computer Sciece Weizma Istitute of Sciece Rehovot, Israel. oded.goldreich@weizma.ac.il November 24, 2008 Preface.

More information

10. Comparative Tests among Spatial Regression Models. Here we revisit the example in Section 8.1 of estimating the mean of a normal random

10. Comparative Tests among Spatial Regression Models. Here we revisit the example in Section 8.1 of estimating the mean of a normal random Part III. Areal Data Aalysis 0. Comparative Tests amog Spatial Regressio Models While the otio of relative likelihood values for differet models is somewhat difficult to iterpret directly (as metioed above),

More information

If a subset E of R contains no open interval, is it of zero measure? For instance, is the set of irrationals in [0, 1] is of measure zero?

If a subset E of R contains no open interval, is it of zero measure? For instance, is the set of irrationals in [0, 1] is of measure zero? 2 Lebesgue Measure I Chapter 1 we defied the cocept of a set of measure zero, ad we have observed that every coutable set is of measure zero. Here are some atural questios: If a subset E of R cotais a

More information

Beurling Integers: Part 2

Beurling Integers: Part 2 Beurlig Itegers: Part 2 Isomorphisms Devi Platt July 11, 2015 1 Prime Factorizatio Sequeces I the last article we itroduced the Beurlig geeralized itegers, which ca be represeted as a sequece of real umbers

More information

ROLL CUTTING PROBLEMS UNDER STOCHASTIC DEMAND

ROLL CUTTING PROBLEMS UNDER STOCHASTIC DEMAND Pacific-Asia Joural of Mathematics, Volume 5, No., Jauary-Jue 20 ROLL CUTTING PROBLEMS UNDER STOCHASTIC DEMAND SHAKEEL JAVAID, Z. H. BAKHSHI & M. M. KHALID ABSTRACT: I this paper, the roll cuttig problem

More information

Estimation of a population proportion March 23,

Estimation of a population proportion March 23, 1 Social Studies 201 Notes for March 23, 2005 Estimatio of a populatio proportio Sectio 8.5, p. 521. For the most part, we have dealt with meas ad stadard deviatios this semester. This sectio of the otes

More information

The Method of Least Squares. To understand least squares fitting of data.

The Method of Least Squares. To understand least squares fitting of data. The Method of Least Squares KEY WORDS Curve fittig, least square GOAL To uderstad least squares fittig of data To uderstad the least squares solutio of icosistet systems of liear equatios 1 Motivatio Curve

More information

Information Theory and Statistics Lecture 4: Lempel-Ziv code

Information Theory and Statistics Lecture 4: Lempel-Ziv code Iformatio Theory ad Statistics Lecture 4: Lempel-Ziv code Łukasz Dębowski ldebowsk@ipipa.waw.pl Ph. D. Programme 203/204 Etropy rate is the limitig compressio rate Theorem For a statioary process (X i)

More information

Optimally Sparse SVMs

Optimally Sparse SVMs A. Proof of Lemma 3. We here prove a lower boud o the umber of support vectors to achieve geeralizatio bouds of the form which we cosider. Importatly, this result holds ot oly for liear classifiers, but

More information

Math 140 Introductory Statistics

Math 140 Introductory Statistics 8.2 Testig a Proportio Math 1 Itroductory Statistics Professor B. Abrego Lecture 15 Sectios 8.2 People ofte make decisios with data by comparig the results from a sample to some predetermied stadard. These

More information

Instructor: Judith Canner Spring 2010 CONFIDENCE INTERVALS How do we make inferences about the population parameters?

Instructor: Judith Canner Spring 2010 CONFIDENCE INTERVALS How do we make inferences about the population parameters? CONFIDENCE INTERVALS How do we make ifereces about the populatio parameters? The samplig distributio allows us to quatify the variability i sample statistics icludig how they differ from the parameter

More information

Analysis of Using Z-evaluation Uncertainty in Fuzzy Inference Systems

Analysis of Using Z-evaluation Uncertainty in Fuzzy Inference Systems America Joural of Mathematical ad Computatioal Scieces 06; (: 67-7 http://www.aascit.org/joural/ajmcs Aalysis of Usig Z-evaluatio Ucertaity i Fuzzy Iferece Systems Primova H. A. Niyozmatova N. A. Cetre

More information

Big Picture. 5. Data, Estimates, and Models: quantifying the accuracy of estimates.

Big Picture. 5. Data, Estimates, and Models: quantifying the accuracy of estimates. 5. Data, Estimates, ad Models: quatifyig the accuracy of estimates. 5. Estimatig a Normal Mea 5.2 The Distributio of the Normal Sample Mea 5.3 Normal data, cofidece iterval for, kow 5.4 Normal data, cofidece

More information

CSE 527, Additional notes on MLE & EM

CSE 527, Additional notes on MLE & EM CSE 57 Lecture Notes: MLE & EM CSE 57, Additioal otes o MLE & EM Based o earlier otes by C. Grat & M. Narasimha Itroductio Last lecture we bega a examiatio of model based clusterig. This lecture will be

More information

Understanding Samples

Understanding Samples 1 Will Moroe CS 109 Samplig ad Bootstrappig Lecture Notes #17 August 2, 2017 Based o a hadout by Chris Piech I this chapter we are goig to talk about statistics calculated o samples from a populatio. We

More information

Similarity Solutions to Unsteady Pseudoplastic. Flow Near a Moving Wall

Similarity Solutions to Unsteady Pseudoplastic. Flow Near a Moving Wall Iteratioal Mathematical Forum, Vol. 9, 04, o. 3, 465-475 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/0.988/imf.04.48 Similarity Solutios to Usteady Pseudoplastic Flow Near a Movig Wall W. Robi Egieerig

More information

Optimization Methods: Linear Programming Applications Assignment Problem 1. Module 4 Lecture Notes 3. Assignment Problem

Optimization Methods: Linear Programming Applications Assignment Problem 1. Module 4 Lecture Notes 3. Assignment Problem Optimizatio Methods: Liear Programmig Applicatios Assigmet Problem Itroductio Module 4 Lecture Notes 3 Assigmet Problem I the previous lecture, we discussed about oe of the bech mark problems called trasportatio

More information

Castiel, Supernatural, Season 6, Episode 18

Castiel, Supernatural, Season 6, Episode 18 13 Differetial Equatios the aswer to your questio ca best be epressed as a series of partial differetial equatios... Castiel, Superatural, Seaso 6, Episode 18 A differetial equatio is a mathematical equatio

More information

Social Networks: Querying and Sharing Mined Information

Social Networks: Querying and Sharing Mined Information 2013 46th Hawaii Iteratioal Coferece o System Scieces Social Networks: Queryig ad Sharig Mied Iformatio Roald R. Yager Ioa College, New Rochelle, NY 10801 yager@paix.com Rachel L. Yager Metropolita College

More information

Measure and Measurable Functions

Measure and Measurable Functions 3 Measure ad Measurable Fuctios 3.1 Measure o a Arbitrary σ-algebra Recall from Chapter 2 that the set M of all Lebesgue measurable sets has the followig properties: R M, E M implies E c M, E M for N implies

More information

Support vector machine revisited

Support vector machine revisited 6.867 Machie learig, lecture 8 (Jaakkola) 1 Lecture topics: Support vector machie ad kerels Kerel optimizatio, selectio Support vector machie revisited Our task here is to first tur the support vector

More information

1 Introduction to reducing variance in Monte Carlo simulations

1 Introduction to reducing variance in Monte Carlo simulations Copyright c 010 by Karl Sigma 1 Itroductio to reducig variace i Mote Carlo simulatios 11 Review of cofidece itervals for estimatig a mea I statistics, we estimate a ukow mea µ = E(X) of a distributio by

More information

Roberto s Notes on Series Chapter 2: Convergence tests Section 7. Alternating series

Roberto s Notes on Series Chapter 2: Convergence tests Section 7. Alternating series Roberto s Notes o Series Chapter 2: Covergece tests Sectio 7 Alteratig series What you eed to kow already: All basic covergece tests for evetually positive series. What you ca lear here: A test for series

More information

CHAPTER 5 SOME MINIMAX AND SADDLE POINT THEOREMS

CHAPTER 5 SOME MINIMAX AND SADDLE POINT THEOREMS CHAPTR 5 SOM MINIMA AND SADDL POINT THORMS 5. INTRODUCTION Fied poit theorems provide importat tools i game theory which are used to prove the equilibrium ad eistece theorems. For istace, the fied poit

More information

Expectation and Variance of a random variable

Expectation and Variance of a random variable Chapter 11 Expectatio ad Variace of a radom variable The aim of this lecture is to defie ad itroduce mathematical Expectatio ad variace of a fuctio of discrete & cotiuous radom variables ad the distributio

More information

ECE 901 Lecture 12: Complexity Regularization and the Squared Loss

ECE 901 Lecture 12: Complexity Regularization and the Squared Loss ECE 90 Lecture : Complexity Regularizatio ad the Squared Loss R. Nowak 5/7/009 I the previous lectures we made use of the Cheroff/Hoeffdig bouds for our aalysis of classifier errors. Hoeffdig s iequality

More information

2 1. The r.s., of size n2, from population 2 will be. 2 and 2. 2) The two populations are independent. This implies that all of the n1 n2

2 1. The r.s., of size n2, from population 2 will be. 2 and 2. 2) The two populations are independent. This implies that all of the n1 n2 Chapter 8 Comparig Two Treatmets Iferece about Two Populatio Meas We wat to compare the meas of two populatios to see whether they differ. There are two situatios to cosider, as show i the followig examples:

More information

MATH 320: Probability and Statistics 9. Estimation and Testing of Parameters. Readings: Pruim, Chapter 4

MATH 320: Probability and Statistics 9. Estimation and Testing of Parameters. Readings: Pruim, Chapter 4 MATH 30: Probability ad Statistics 9. Estimatio ad Testig of Parameters Estimatio ad Testig of Parameters We have bee dealig situatios i which we have full kowledge of the distributio of a radom variable.

More information

Discrete-Time Systems, LTI Systems, and Discrete-Time Convolution

Discrete-Time Systems, LTI Systems, and Discrete-Time Convolution EEL5: Discrete-Time Sigals ad Systems. Itroductio I this set of otes, we begi our mathematical treatmet of discrete-time s. As show i Figure, a discrete-time operates or trasforms some iput sequece x [

More information

GUIDELINES ON REPRESENTATIVE SAMPLING

GUIDELINES ON REPRESENTATIVE SAMPLING DRUGS WORKING GROUP VALIDATION OF THE GUIDELINES ON REPRESENTATIVE SAMPLING DOCUMENT TYPE : REF. CODE: ISSUE NO: ISSUE DATE: VALIDATION REPORT DWG-SGL-001 002 08 DECEMBER 2012 Ref code: DWG-SGL-001 Issue

More information