Support vector domain description


 Harvey Ross
 3 years ago
 Views:
Transcription
1 Pattern Recognton Letters 20 (1999) 1191± Support vector doman descrpton Davd M.J. Tax *,1, Robert P.W. Dun Pattern Recognton Group, Faculty of Appled Scence, Delft Unversty of Technology, F263 Lorentzweg 1, 2628 CJ Delft, The Netherlands Abstract Ths paper shows the use of a data doman descrpton method, nspred by the support vector machne by Vapnk, called the support vector doman descrpton (SVDD). Ths data descrpton can be used for novelty or outler detecton. A sphercally shaped decson boundary around a set of objects s constructed by a set of support vectors descrbng the sphere boundary. It has the possblty of transformng the data to new feature spaces wthout much extra computatonal cost. By usng the transformed data, ths SVDD can obtan more exble and more accurate data descrptons. The error of the rst knd, the fracton of the tranng objects whch wll be rejected, can be estmated mmedately from the descrpton wthout the use of an ndependent test set, whch makes ths method data e cent. The support vector doman descrpton s compared wth other outler detecton methods on real data. Ó 1999 Elsever Scence B.V. All rghts reserved. Keywords: Data doman descrpton; Outler detecton; Oneclass class caton; Support vector machnes 1. Introducton Most pattern recognton tasks deal wth class caton or regresson problems. But there s a thrd, less wellknown extenson of the class caton problem, the data doman descrpton problem (also called oneclass class caton). In doman descrpton the task s not to dstngush between classes of objects lke n class caton problems or to produce a desred outcome for each nput object lke n regresson problems, but to gve a descrpton of a set of objects. Ths descrpton should * Correspondng author. Tel.: ; fax: Emal address: (D.M.J. Tax) 1 Ths work was partly supported by the Foundaton for Appled Scences (STW) and the Dutch Organzaton for Scent c Research (NWO). cover the class of objects represented by the tranng set, and deally should reject all other possble objects n the object space. The data doman descrpton s used for outler detecton or novelty detecton, the detecton of objects whch d er n some sense sgn cantly from the rest of the dataset. D erent methods for data doman descrpton or outler detecton have been developed. When an underlyng statstcal law for the outlyng patterns s assumed, ths underlyng dstrbuton should be estmated (Rtter and Gallegos, 1997). When nothng about the outler dstrbuton can be assumed (or f an nsu cent number of outler examples s avalable), only a descrpton of (the boundary of) the target class can be made. Most often a probablty densty of the data s estmated and new test objects whch are under some probablty threshold wll be rejected. For nstance, n /99/$  see front matter Ó 1999 Elsever Scence B.V. All rghts reserved. PII: S ( 9 9 )
2 1192 D.M.J. Tax, R.P.W. Dun / Pattern Recognton Letters 20 (1999) 1191±1199 the paper of Tarassenko et al. (To appear), anomaltes n mammographs are detected by applyng Parzen densty estmaton and a mxture of Gaussans on the normal class. A drawback of these densty methods s that they often requre a large dataset, especally when hgh dmensonal feature vectors are used. Also problems may arse when large d erences n densty exst: objects n low densty areas wll be rejected although they are legtmate objects. In ths paper, another method for data doman descrpton s presented and analyzed (the dea was rst presented n (Tax and Dun, 1999)). The method s nspred by the support vector machnes by Vapnk (1995). For data doman descrpton not the optmal separatng hyperplane has to be found, but the sphere wth mnmal volume (or mnmal radus) contanng all objects. Frst we gve a theoretcal dervaton of the basc method n Secton 2. In Sectons 3 and 4 we focus on choces for the parameters whch are stll free and look at some characterstcs of the methods. Expermental results wll be shown n Secton 5, and we gve conclusons n Secton Theory Of a data set contanng N data objects, fx ; ˆ 1;... ; Ng, a descrpton s requred. We try to nd a sphere wth mnmum volume, contanng all (or most of) the data objects. Ths s very senstve to the most outlyng object n the target data set. When one or a few very remote objects are n the tranng set, a very large sphere s obtaned whch wll not represent the data very well. Therefore, we allow for some data ponts outsde the sphere and ntroduce slack varables n (analogous to (Vapnk, 1995)). Of the sphere, descrbed by center a and radus R, we mnmze the radus F R; a; n ˆ R 2 C X n ; 1 where the varable C gves the tradeo between smplcty (or volume of the sphere) and the number of errors (number of target objects rejected). Ths has to be mnmzed under the constrants x a T x a 6 R 2 n 8 ; n P 0: 2 Incorporatng these constrants n (1), we construct the Lagrangan, L R; a; a ; n ˆ R 2 C X X a fr 2 n x 2 2ax a 2 g X n c n ; 3 wth Lagrange multplers a P 0 and c P 0. Settng the partal dervatves to 0, new constrants are obtaned: X P a ˆ 1; a ˆ P a x ˆ X a x ; a C a c ˆ 0 8 : 4 Snce a P 0 and c P 0 we can remove the varables c from the thrd equaton n (4) and use the constrants 0 6 a 6 C 8. Rewrtng Eq. (3) and resubsttutng Eqs. (4) gve to maxmze wth respect to a : L ˆ X a x x X a a j x x j ; 5 ;j wth constrants 0 6 a 6 C; P a ˆ 1. The second equaton n (4) states that the center of the sphere s a lnear combnaton of data objects, wth weght factors a whch are obtaned by optmzng Eq. (5). Only for a small set of objects the equalty n Eq. (2) s sats ed: these are the objects whch are on the boundary of the sphere tself. For those objects the coe cents a wll be nonzero and are called the support objects. Only these objects are needed n the descrpton of the sphere. The radus R of the sphere can be obtaned by calculatng the dstance from the center of the sphere to a support vector wth a weght smaller than C. Objects for whch a ˆ C have ht the upper bound n (4) and are outsde the sphere. These support vectors are consdered to be outlers. We wll dscuss the parameter C n more detal n the next secton. To determne whether a test pont z s wthn the sphere, the dstance to the center of the sphere has
3 D.M.J. Tax, R.P.W. Dun / Pattern Recognton Letters 20 (1999) 1191± to be calculated. A test object z s accepted when ths dstance s smaller than the radus,.e., when z a T z a 6 R 2. Expressng the center of the sphere n terms of the support vectors, we accept objects when z z 2 X a z x X ;j a a j x x j 6 R 2 : 6 L ˆ X a K x ; x X a a j K x ; x j ; ;j 7 wth constrants 0 6 a 6 C; P a ˆ 1. A test object z s accepted when (see (6)) K z; z 2 X a K z; x X ;j a a j K x ; x j 6 R 2 : 8 3. Generalzng to other kernels The method just presented only computes a sphere around the data n the nput space. Normally, data are not sphercally dstrbuted, even when the most outlyng objects are gnored. So, n general, we cannot expect to obtan a very tght descrpton. Snce the problem s stated completely n terms of nner products between vectors (Eqs. (5) and (6)), the method can be made more exble, analogous to (Vapnk, 1995). Inner products of objects x x j can be replaced by a kernel functon K x ; x j, when ths kernel K x ; x j sats es Mercer's theorem. Ths mplctly maps the objects x nto some feature space and when a sutable feature space s chosen, a better, more tght descrpton can be obtaned. No explct mappng s requred, the problem s expressed completely n terms of K x ; x j. Therefore, we replace all nner products (x x j ) by a proper K x ; x j and the problem of ndng a data doman descrpton s now gven by (see (5)) D erent kernel functons K result n d erent descrpton boundares n the orgnal nput space. The problem s to nd a sutable kernel functon K x ; x j. We dscuss two choces: a polynomal kernel and a Gaussan kernel. The rst choce for kernel K x x j s the extended nner product: K x ; x j ˆ x x j 1 d, where the free parameter d s the degree of the polynomal kernel. As argued by Vapnk (1995), ths kernel maps the objects nto the hgh dmensonal feature space by addng products of the orgnal features, up to degree d. (For example, a 2D vector x 1 ; x 2 s mapped to x 1 ; x 2 ; x 1 x 2 ; x 2 1 ; x2 2 when a polynomal kernel wth d ˆ 2 s used.) Ths kernel does, n general, not result n good tght descrptons. For hgher degrees d, the n uence of objects most remote from the orgn of the coordnate system ncreases and overwhelms all other nner products. Ths e ect s shown n Fg. 1 wth a twodmensonal dataset contanng 10 objects. For d erent values of the degree (d ˆ 1; 10; 25) a sphere descrpton s computed. Fg. 1. Dstance to the center of the hypersphere, mapped back on the nput space for a polynomal kernel. The darker the color, the smaller the dstance. The whte dashed lne ndcates the surface of the hypersphere. The small crcles ndcate support objects.
4 1194 D.M.J. Tax, R.P.W. Dun / Pattern Recognton Letters 20 (1999) 1191±1199 The dstance to the center of the sphere s plotted n the orgnal nput space. The dashed whte lne crossng the support vectors (ndcated by the small crcles) s the boundary of the descrpton. The objects n the upper part are most dstant from the orgn and although these objects are not the most outlyng objects n the data n two dmensons, they become the support vectors when hgher degrees are used. Note that a large part of the nput space becomes accepted. Ths descrpton results n a very large and sparse sphere n the orgnal twodmensonal nput space. To suppress the growng dstances for larger feature spaces, a Gaussan kernel K G x ; x j ˆ exp x x j 2 =s 2 s more approprate. Eq. (7) then becomes L ˆ 1 X a 2 X 6ˆj a a j K G x ; x j ; and the accepton rule, Eq. (8), becomes 2 X a K G z; x 6 R 2 C X 1; 9 10 where C X only depends on the support vectors and the a and not on the test object z. In Fg. 2, agan a 2D art cal dataset contanng 10 objects s shown. Now a support vector doman descrpton wth a Gaussan kernel for d erent values of s s used. The wdth parameter s ranges from very small (s ˆ 1:0 n the leftmost gure) to large (s ˆ 25:0 n the rghtmost gure). Note that the number of support vectors decreases and that the descrpton becomes more spherelke. We can derve explct solutons for Eq. (7) for the two d erent extreme stuatons, one for very small values and one for very large values of s. For very small s, K G x ; x j ' 0; 6ˆ j and L ˆ 1 P a2. Ths s maxmzed when a ˆ 1=N and L becomes 1 1=N. Ths s smlar to the Parzen densty estmaton, where each object supports a kernel (see Eq. (10)). All dstances to the center of the sphere become 1 1=N. For very large s, K G x ; x j ˆ 1 and L ˆ 1 P a2 P 6ˆj a a j. Ths s maxmzed when all a ˆ 0 except for one a j ˆ 1 and all dstances to the sphere center become 0. Ths n ntely large sphere wll not be obtaned n practce and s wll not be large enough to gve equal K G x ; x j for all pars ; j. In the rghtmost subplot of Fg. 2 a realstc lmt stuaton s plotted. The data descrpton s agan the smallest sphere whch covers the complete dataset, wthout outlers. A Taylor expanson of Eq. (9) shows that when hgher orders are gnored, Eq. (5) s obtaned (up to a scalng and o set factor). In the case of moderate values of s (mddle plot n Fg. 2) just a fracton of the objects become support objects. Eq. (10) shows that n ths case an edted and weghted Parzen densty estmaton s obtaned. Ths does not estmate the total densty of the data, but tres to descrbe just the boundary of the dataset. The parameter C gves the upper boundary for the parameters a and thus lmts the n uence of the ndvdual support vectors on the descrpton, Eq. (10). When an object x 1 obtans a ˆ C, the descrpton wll not be adapted any further Fg. 2. Dstance to the center of the hypersphere, mapped back on the nput space for a Gaussan kernel. The darker the color, the smaller the dstance. The whte dashed lne ndcates the surface of the hypersphere. The small crcles ndcate the support objects.
5 D.M.J. Tax, R.P.W. Dun / Pattern Recognton Letters 20 (1999) 1191± towards ths object and t wll stay outsde the sphere. Because of the constrants P a ˆ 1 and a P 0, only the choces for whch C can have any n uence on the soluton of Eq. (9) s when 1=N 6 C 6 1. For C < 1=N no soluton can be found because then the constrant P a ˆ 1 can never be met, whle for C > 1 one can always nd a soluton (a 's are always less or equal to 1). When C s restrcted to small values, the cost of beng outsde the sphere s not very large and a larger fracton of the objects s allowed to be outsde the sphere. In practce the value of C s not very crtcal. In the experments of ths paper, C ˆ 0:25 s chosen and n none of the cases an outler s detected n the target class. When a smaller C ˆ 0:2 or a larger C ˆ 0:4 s used, the same results are obtaned. 4. Generalzaton To get an ndcaton of the generalzaton or the over ttng characterstcs of the SVDD, we have to get an ndcaton of (1) the number of target patterns that wll be rejected (errors of the rst knd) by ths descrpton and (2) of the number of outlyng patterns that wll be accepted (errors of the second knd). We can estmate the error of the rst knd by applyng the leaveoneout method on the tranng set contanng the target class (Vapnk, 1995). When we leave out an object from the tranng set whch s not a support object, the orgnal soluton s found and all tranng objects wll be found. When a support object s left out, the optmal sphere descrpton can be made smaller, because ths support object s on the boundary of the sphere. Ths leftout object wll then be rejected, whle the rest of the tranng objects wll stll be accepted (because the method s traned on these data). Thus, the error can be estmated by E P error Š ˆ #SV N ; 11 where #SV s the number of support vectors. When we use a Gaussan kernel, we can regulate the number of support vectors by changng the wdth parameter s. Therefore, we can also set the error of the rst knd. When the number of support vectors s too large, we have to ncrease s, whle when the number s too low, we have to decrease s. To check how well the estmate of Eq. (11) s, we plotted n Fg. 3 the estmaton of the errors of the rst knd as a functon of the wdth parameter s. The method was appled to a twodmensonal dataset contanng 10 objects. Also the error, estmated on an ndependent test set of 100 objects, s shown. We can conclude that ths estmate works well. So when a descrpton of a dataset s requred, we can set beforehand a bound on the expected rejecton rate of the target data. The Lagrangan from Eq. (9) s solved and the expected error for ths soluton s obtaned va Eq. (11). When ths error s too large, the wdth parameter s s ncreased, or when ths error can stll ncrease, the wdth parameter s s decreased. Ths guarantees that the wdth parameter n the SVDD s adapted for the problem at hand, gven the error. The chance that outlyng objects wll be accepted by the sphere descrpton, the error of the second knd, cannot be estmated by ths measure. In general, only a good descrpton of the target class n the form of a tranng set s avalable. All other patterns are consdered outlers. To get an estmate for the error of the second knd, data Fg. 3. Comparson between the fracton of objects whch are support objects and the fracton of test ponts whch s rejected, wth respect to the parameter s. The target class conssts of the 10 objects shown n Fgs. 1 and 2.
6 1196 D.M.J. Tax, R.P.W. Dun / Pattern Recognton Letters 20 (1999) 1191±1199 around the orgnal data set should be created and tested. Ths method then requres a way of obtanng or creatng data around the tranng data, but not n the tranng set. Also the number of test patterns should be su cently hgh for a reasonable estmate, whch can be a problem n hgher dmensonal feature spaces. In the experments n ths paper we crcumvent ths problem by usng class caton problems for testng the method. From the class caton tasks we take one class as beng the outler class, and all other classes wll be used as the target class. In ths way art cal outlers can be constructed. Ths means that a performance bas s ntroduced. These class caton problems often contan overlappng classes and by usng the class caton problems n ths way, the performance of the outler methods wll be lower than that of normal class caton methods for the class caton task. Stll, t gves an ndcaton of the performances when d erent outler methods are compared. 5. Experments The SVDD method s compared wth four other outler detecton methods: normal densty estmaton, Parzen wndows, a knearestneghbor dstance comparson and an nstablty method. These methods are descrbed n more detal n (Tax and Dun, 1998). The rst two methods rely on a densty estmaton of the data. The thrd method compares the dstance from a test object x to ts nearest neghbor NN tr x) n the tranng set wth the dstance from ths nearest neghbor NN tr x to ts nearest neghbor NN tr NN tr x n the transet. The nstablty method s specally desgned for outler detecton n class caton tasks. By tranng several smple class ers, such as lnear class ers, on bootstrapped versons of the tranng set, one obtans varatons n the class er outputs. Objects whch experence large varatons n these outputs are lkely to resde n low densty or low con dence areas and wll be rejected. These methods wll be compared to the SVDD method wth a Gaussan kernel. The wdth parameter s s found by usng the procedure mentoned n Secton 4. The varable C s set to 0:25. On the bass of the performance on the tranng set samples, we set a target rejecton threshold value of 10% on the d erent measures. Ths relatvely large value s chosen, because some datasets contan a small number of objects, and usng a 10% rejecton rate ensures that some of the target objects wll ndeed be rejected. After that the performance on a test set contanng the target class and one contanng the outler class s measured. Ths means that the optmal performance s reached when all outlyng objects are rejected and 90% of the target class s accepted. All methods are appled to a set of standard datasets taken from the UCI Machne Learnng Dataset Repostory (Blake et al., 1998). The datasets consdered are lsted n Table 1. As explaned n the prevous secton, one of the classes s consdered as the outler class, the rest s target class. To estmate the errors (of the rst and the second knd) nfold crossvaldaton wth n ˆ 5 s used. In Table 2, the performances of the outler detecton methods on all UCI datasets are shown. For each method, the performance on a target valdaton set (left) and an outler test set (rght) s shown. Each of the classes s outler class once (ndcated n the rst column). Results on the balancedataset already show that the estmaton of the errors of type 1 on the tranng set s not very precse for the Parzen densty estmaton and Table 1 UCI datasets used for the evaluaton of the data descrpton methods Name # Objects # Classes # Features Balancescale BreastcancerWsconsn Ionosphere Irs
7 D.M.J. Tax, R.P.W. Dun / Pattern Recognton Letters 20 (1999) 1191± Table 2 Outler detecton performances on the UCI datasets a Class no. Set sze Gauss Parzen knn Instab SVDD Balance data 1 337, , , , , , , , , , , , , , , , , , 0.88 Breast cancer data 1 241, , , , , , , , , , , , 0.99 Ionosphere data 1 126, , , , , , , , , , , , 0.90 Irs data 1 100, , , , , , , , , , , , , , , , , , 0.90 a The rst column gves the class whch s consdered as outler. In the second column, the target (left) and outler (rght) set szes are gven. In the other columns, the leftmost number n each column gves the performance for a test set contanng the target class and the rghtmost number the performance on an outler set contanng the outler class. the knn method. In both cases the error on the `target' class s far larger than the prede ned 0:1. All methods perform poorly on the case n whch the second class s consdered outler. Ths can be understood by lookng at the dstrbuton of the data, where class 2 s between classes 1 and 3. Only the nstablty method s able to reject objects from the second class. In the breastcancer data set, the second class s clearly easer to dstngush than the rst class. Lookng at the orgn of the data, ths means that by descrbng the bengn class, the malgnant class can be rejected qute well. All methods perform well n descrbng class 1, except for the nstablty method. Snce the orgnal dataset contans only two classes, the nstablty method could not be used. When one class s consdered as the outler class, the nstablty method cannot tran smple class ers on the remanng class. Also vsble s that the Parzen method overtrans heavly and performs poorly when class 1 s the outler class. The SVDD performs best overall. In the onosphere dataset, the Parzen densty estmaton agan overtrans and the nstablty method cannot be used because only two classes are avalable. From the results we see that class 1 s almost Gaussan dstrbuted and class 2 s scattered around t. The SVDD cannot dstngush one class 2 object from class 1. Fnally, the performance of the outler methods are appled on the rs dataset. Here, all methods work reasonably well, whch ndcates that the data dstrbutons of the classes are well clustered. Only the Parzen densty estmaton slghtly overtrans. From these results we can conclude that the SVDD works comparably and often better than the other outler methods, from the smple Gaussan dstrbuton to the nearest neghbor method. Another advantage of the SVDD s that an estmate of the error on the target set can be obtaned mmedately by lookng at the fracton of support vectors. Ths guarantees that the scale of the SVDD, set by the wdth parameter s, s adjusted to the data and no extra leaveoneout estmaton s requred (lke n the Parzen estmaton). 6. Conclusons Data doman descrpton s an mportant tool for robust and con dent class caton. Data whch do not resemble a target class should be rejected. In ths paper we propose a sphere shaped data
8 1198 D.M.J. Tax, R.P.W. Dun / Pattern Recognton Letters 20 (1999) 1191±1199 descrpton whch does not have to make a probablty densty estmaton. The sphere descrpton depends on a few target objects, the support objects and new test objects only have to be compared wth these support objects by an nner product or some more general kernel functon. By adaptng the kernel functon, ths method becomes more exble than just a sphere n the nput space. The SVDD also allows for target objects not ncluded n the sphere descrpton. An extra parameter C s ntroduced to gve the tradeo between the number of errors made on the tranng set and the sze of the sphere descrpton. In practce, the sze of ths parameter s not very crucal for ndng a good soluton. In ths paper two kernel types are consdered: the polynomal and the Gaussan kernel. In general, the polynomal kernel does not gve tght descrptons of the tranng data. On the other hand, the Gaussan kernel seems to work very well. In the SVDD usng a Gaussan kernel, another free parameter, the wdth of the kernel s, can be adapted. By choosng d erent extremes for ths wdth parameter, the sphere method obtans more or less exble descrptons. For very small values for s, a Parzen densty estmaton s obtaned. In that case, all target objects become support objects. For very large values of s, just one prototype for the complete data set s used and almost the complete tranng set can be dsregarded. Applyng a moderate value for the wdth parameter, an edted and weghted Parzen estmaton s obtaned. An extra feature of ths SVDD method s that the error on the target class can be estmated mmedately by calculatng the fracton of target objects whch become support objects. Settng the error on the tranng set beforehand, the wdth s can be set such that the fracton of support objects s equal to ths error. Snce the SVDD focuses on the boundary descrpton and not on the complete data densty, the requred number of objects s smaller than for, e.g., the Parzen densty estmaton. We can conclude that the SVDD gves both an e cent and robust method for descrbng a dataset. For further readng, see (Ypma and Pajunen, 1999). Dscusson Gmel'farb: Can you tell why the SVDD approach works so poorly? Snce t depends on your choce of the kernel functon, then f s ˆ 0, t s smply a nearest neghbor class er. And such a nearest neghbor class er, n ths case, cannot perform so poorly. Tax: No, but I sad that the error on my target set s about 10%. So, I tune my parameters n such a way that I wll reject about 10% and 10% of my tranng set wll be support vectors. In that case, the descrpton wll be d erent from the normal Parzen estmator. It wll be a more crude approxmaton of the boundary. If I had more ponts, t would be comparable, better than the Parzen estmator. Gmel'farb: One more queston: why do you need to restrct yourself to sngle sphere approxmaton, because by usng the earler results of Vapnk, you can approxmate any dstrbuton of your tranng ponts by a mnmal number of spheres, and n that case, you have a much better descrpton. Tax: Frst of all, f you have a multmodal dstrbuton, for nstance, three Gaussan dstrbutons, and f you have enough tranng ponts, t wll automatcally nd three spheres. If you do not have enough data and you stll restrct yourself to an error of 10% on your target set, t wll stll gve you just one complete blob. So t only nds that soluton for whch t nds enough just caton n the data. If you are very strct on the number of errors you make, t wll gve very broad, very crude approxmatons. Gmel'farb: But ths means that you should not restrct yourself to a xed error on the target set, because n that case, the result depends on your data. Sometmes, f you x the rejecton rate, then, even for beautful data, you ntentonally obtan bad results. Tax: True, but f you know that you have three clusters, I would not recommend ths method. I would then rather take three Gaussans. If that s the pror knowledge that you have, then use t.
9 D.M.J. Tax, R.P.W. Dun / Pattern Recognton Letters 20 (1999) 1191± Kanal: You mght assume one, two, three clusters, and so on, to see whch assumpton gves the best results. Tax: But then, the trcky part s always to nd a good threshold value. And here, I nd my threshold on the bass of the number of support vectors, and that gves a more drect lnk to how good or bad the descrpton s. From the SVDD, you cannot nd drectly the number of clusters n the data. References Blake, C., Keogh, E., Merz, C., UCI repostory of machne learnng databases. mlearn/mlrepostory.html, Unversty of Calforna, Irvne, Department of Informaton and Computer Scences. Rtter, G., Gallegos, M.T., Outlers n statstcal pattern recognton and an applcaton to automatc chromosome class caton. Pattern Recognton Letters 18, 525±539. Tarassenko, L., Hayton, P., Brady, M., To appear. Novelty detecton for the dent caton of masses n mammograms. Tax, D., Dun, R., Outler detecton usng class er nstablty. In: Amn, A., Dor, D., Pudl, P., Freeman, H. (Eds.), Advances n Pattern Recognton Proc. Jont IAPR Internat. Workshops SSPR'98 and SPR'98, Sydney, Australa. Lecture Notes n Computer Scence, Vol Sprnger, Berln, pp. 593±601. Tax, D., Dun, R., Data doman descrpton usng support vectors. In: Verleysen, M. (Ed.), Proc. European Symposum Art cal Neural Networks D. Facto, Brussel, pp. 251±256. Vapnk, V., The Nature of Statstcal Learnng Theory. Sprnger, New York. Ypma, A., Pajunen, P., Rotatng machne vbraton analyss wth secondorder ndependent component analyss. In: Proc. 1st Internat. Workshop Independent Component Analyss and Sgnal Separaton, ICA'99, pp. 37±42.
Support Vector Machines
Support Vector Machnes Max Wellng Department of Computer Scence Unversty of Toronto 10 Kng s College Road Toronto, M5S 3G5 Canada wellng@cs.toronto.edu Abstract Ths s a note to explan support vector machnes.
More informationbenefit is 2, paid if the policyholder dies within the year, and probability of death within the year is ).
REVIEW OF RISK MANAGEMENT CONCEPTS LOSS DISTRIBUTIONS AND INSURANCE Loss and nsurance: When someone s subject to the rsk of ncurrng a fnancal loss, the loss s generally modeled usng a random varable or
More informationInstitute of Informatics, Faculty of Business and Management, Brno University of Technology,Czech Republic
Lagrange Multplers as Quanttatve Indcators n Economcs Ivan Mezník Insttute of Informatcs, Faculty of Busness and Management, Brno Unversty of TechnologCzech Republc Abstract The quanttatve role of Lagrange
More informationSIX WAYS TO SOLVE A SIMPLE PROBLEM: FITTING A STRAIGHT LINE TO MEASUREMENT DATA
SIX WAYS TO SOLVE A SIMPLE PROBLEM: FITTING A STRAIGHT LINE TO MEASUREMENT DATA E. LAGENDIJK Department of Appled Physcs, Delft Unversty of Technology Lorentzweg 1, 68 CJ, The Netherlands Emal: e.lagendjk@tnw.tudelft.nl
More informationCS 2750 Machine Learning. Lecture 17a. Clustering. CS 2750 Machine Learning. Clustering
Lecture 7a Clusterng Mlos Hauskrecht mlos@cs.ptt.edu 539 Sennott Square Clusterng Groups together smlar nstances n the data sample Basc clusterng problem: dstrbute data nto k dfferent groups such that
More informationThe Development of Web Log Mining Based on ImproveKMeans Clustering Analysis
The Development of Web Log Mnng Based on ImproveKMeans Clusterng Analyss TngZhong Wang * College of Informaton Technology, Luoyang Normal Unversty, Luoyang, 471022, Chna wangtngzhong2@sna.cn Abstract.
More informationWhat is Candidate Sampling
What s Canddate Samplng Say we have a multclass or mult label problem where each tranng example ( x, T ) conssts of a context x a small (mult)set of target classes T out of a large unverse L of possble
More informationLuby s Alg. for Maximal Independent Sets using Pairwise Independence
Lecture Notes for Randomzed Algorthms Luby s Alg. for Maxmal Independent Sets usng Parwse Independence Last Updated by Erc Vgoda on February, 006 8. Maxmal Independent Sets For a graph G = (V, E), an ndependent
More informationCommunication Networks II Contents
8 / 1  Communcaton Networs II (Görg)  www.comnets.unbremen.de Communcaton Networs II Contents 1 Fundamentals of probablty theory 2 Traffc n communcaton networs 3 Stochastc & Marovan Processes (SP
More informationNonlinear data mapping by neural networks
Nonlnear data mappng by neural networks R.P.W. Dun Delft Unversty of Technology, Netherlands Abstract A revew s gven of the use of neural networks for nonlnear mappng of hgh dmensonal data on lower dmensonal
More informationCS 2750 Machine Learning. Lecture 3. Density estimation. CS 2750 Machine Learning. Announcements
Lecture 3 Densty estmaton Mlos Hauskrecht mlos@cs.ptt.edu 5329 Sennott Square Next lecture: Matlab tutoral Announcements Rules for attendng the class: Regstered for credt Regstered for audt (only f there
More informationFace Verification Problem. Face Recognition Problem. Application: Access Control. Biometric Authentication. Face Verification (1:1 matching)
Face Recognton Problem Face Verfcaton Problem Face Verfcaton (1:1 matchng) Querymage face query Face Recognton (1:N matchng) database Applcaton: Access Control www.vsage.com www.vsoncs.com Bometrc Authentcaton
More informationLinear Regression, Regularization BiasVariance Tradeoff
HTF: Ch3, 7 B: Ch3 Lnear Regresson, Regularzaton BasVarance Tradeoff Thanks to C Guestrn, T Detterch, R Parr, N Ray 1 Outlne Lnear Regresson MLE = Least Squares! Bass functons Evaluatng Predctors Tranng
More information1 Example 1: Axisaligned rectangles
COS 511: Theoretcal Machne Learnng Lecturer: Rob Schapre Lecture # 6 Scrbe: Aaron Schld February 21, 2013 Last class, we dscussed an analogue for Occam s Razor for nfnte hypothess spaces that, n conjuncton
More informationHYPOTHESIS TESTING OF PARAMETERS FOR ORDINARY LINEAR CIRCULAR REGRESSION
HYPOTHESIS TESTING OF PARAMETERS FOR ORDINARY LINEAR CIRCULAR REGRESSION Abdul Ghapor Hussn Centre for Foundaton Studes n Scence Unversty of Malaya 563 KUALA LUMPUR Emal: ghapor@umedumy Abstract Ths paper
More informationLecture 2: Single Layer Perceptrons Kevin Swingler
Lecture 2: Sngle Layer Perceptrons Kevn Sngler kms@cs.str.ac.uk Recap: McCullochPtts Neuron Ths vastly smplfed model of real neurons s also knon as a Threshold Logc Unt: W 2 A Y 3 n W n. A set of synapses
More informationFeature selection for intrusion detection. Slobodan Petrović NISlab, Gjøvik University College
Feature selecton for ntruson detecton Slobodan Petrovć NISlab, Gjøvk Unversty College Contents The feature selecton problem Intruson detecton Traffc features relevant for IDS The CFS measure The mrmr measure
More informationCalculating the high frequency transmission line parameters of power cables
< ' Calculatng the hgh frequency transmsson lne parameters of power cables Authors: Dr. John Dcknson, Laboratory Servces Manager, N 0 RW E B Communcatons Mr. Peter J. Ncholson, Project Assgnment Manager,
More informationForecasting the Direction and Strength of Stock Market Movement
Forecastng the Drecton and Strength of Stock Market Movement Jngwe Chen Mng Chen Nan Ye cjngwe@stanford.edu mchen5@stanford.edu nanye@stanford.edu Abstract  Stock market s one of the most complcated systems
More informationCHAPTER 14 MORE ABOUT REGRESSION
CHAPTER 14 MORE ABOUT REGRESSION We learned n Chapter 5 that often a straght lne descrbes the pattern of a relatonshp between two quanttatve varables. For nstance, n Example 5.1 we explored the relatonshp
More informationThe OC Curve of Attribute Acceptance Plans
The OC Curve of Attrbute Acceptance Plans The Operatng Characterstc (OC) curve descrbes the probablty of acceptng a lot as a functon of the lot s qualty. Fgure 1 shows a typcal OC Curve. 10 8 6 4 1 3 4
More informationVision Mouse. Saurabh Sarkar a* University of Cincinnati, Cincinnati, USA ABSTRACT 1. INTRODUCTION
Vson Mouse Saurabh Sarkar a* a Unversty of Cncnnat, Cncnnat, USA ABSTRACT The report dscusses a vson based approach towards trackng of eyes and fngers. The report descrbes the process of locatng the possble
More informationCHAPTER 5 RELATIONSHIPS BETWEEN QUANTITATIVE VARIABLES
CHAPTER 5 RELATIONSHIPS BETWEEN QUANTITATIVE VARIABLES In ths chapter, we wll learn how to descrbe the relatonshp between two quanttatve varables. Remember (from Chapter 2) that the terms quanttatve varable
More informationModule 2 LOSSLESS IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur
Module LOSSLESS IMAGE COMPRESSION SYSTEMS Lesson 3 Lossless Compresson: Huffman Codng Instructonal Objectves At the end of ths lesson, the students should be able to:. Defne and measure source entropy..
More informationQuestions that we may have about the variables
Antono Olmos, 01 Multple Regresson Problem: we want to determne the effect of Desre for control, Famly support, Number of frends, and Score on the BDI test on Perceved Support of Latno women. Dependent
More information+ + +   This circuit than can be reduced to a planar circuit
MeshCurrent Method The meshcurrent s analog of the nodeoltage method. We sole for a new set of arables, mesh currents, that automatcally satsfy KCLs. As such, meshcurrent method reduces crcut soluton to
More informationLogistic Regression. Lecture 4: More classifiers and classes. Logistic regression. Adaboost. Optimization. Multiple class classification
Lecture 4: More classfers and classes C4B Machne Learnng Hlary 20 A. Zsserman Logstc regresson Loss functons revsted Adaboost Loss functons revsted Optmzaton Multple class classfcaton Logstc Regresson
More information) of the Cell class is created containing information about events associated with the cell. Events are added to the Cell instance
Calbraton Method Instances of the Cell class (one nstance for each FMS cell) contan ADC raw data and methods assocated wth each partcular FMS cell. The calbraton method ncludes event selecton (Class Cell
More informationLETTER IMAGE RECOGNITION
LETTER IMAGE RECOGNITION 1. Introducton. 1. Introducton. Objectve: desgn classfers for letter mage recognton. consder accuracy and tme n takng the decson. 20,000 samples: Startng set: mages based on 20
More informationAn Alternative Way to Measure Private Equity Performance
An Alternatve Way to Measure Prvate Equty Performance Peter Todd Parlux Investment Technology LLC Summary Internal Rate of Return (IRR) s probably the most common way to measure the performance of prvate
More information1 Approximation Algorithms
CME 305: Dscrete Mathematcs and Algorthms 1 Approxmaton Algorthms In lght of the apparent ntractablty of the problems we beleve not to le n P, t makes sense to pursue deas other than complete solutons
More informationMultivariate EWMA Control Chart
Multvarate EWMA Control Chart Summary The Multvarate EWMA Control Chart procedure creates control charts for two or more numerc varables. Examnng the varables n a multvarate sense s extremely mportant
More informationCausal, Explanatory Forecasting. Analysis. Regression Analysis. Simple Linear Regression. Which is Independent? Forecasting
Causal, Explanatory Forecastng Assumes causeandeffect relatonshp between system nputs and ts output Forecastng wth Regresson Analyss Rchard S. Barr Inputs System Cause + Effect Relatonshp The job of
More informationDEFINING %COMPLETE IN MICROSOFT PROJECT
CelersSystems DEFINING %COMPLETE IN MICROSOFT PROJECT PREPARED BY James E Aksel, PMP, PMISP, MVP For Addtonal Informaton about Earned Value Management Systems and reportng, please contact: CelersSystems,
More informationv a 1 b 1 i, a 2 b 2 i,..., a n b n i.
SECTION 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS 455 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS All the vector spaces we have studed thus far n the text are real vector spaces snce the scalars are
More informationStudy on CET4 Marks in China s Graded English Teaching
Study on CET4 Marks n Chna s Graded Englsh Teachng CHE We College of Foregn Studes, Shandong Insttute of Busness and Technology, P.R.Chna, 264005 Abstract: Ths paper deploys Logt model, and decomposes
More informationRecurrence. 1 Definitions and main statements
Recurrence 1 Defntons and man statements Let X n, n = 0, 1, 2,... be a MC wth the state space S = (1, 2,...), transton probabltes p j = P {X n+1 = j X n = }, and the transton matrx P = (p j ),j S def.
More informationECE544NA Final Project: Robust Machine Learning Hardware via Classifier Ensemble
1 ECE544NA Fnal Project: Robust Machne Learnng Hardware va Classfer Ensemble Sa Zhang, szhang12@llnos.edu Dept. of Electr. & Comput. Eng., Unv. of Illnos at UrbanaChampagn, Urbana, IL, USA Abstract In
More informationBERNSTEIN POLYNOMIALS
OnLne Geometrc Modelng Notes BERNSTEIN POLYNOMIALS Kenneth I. Joy Vsualzaton and Graphcs Research Group Department of Computer Scence Unversty of Calforna, Davs Overvew Polynomals are ncredbly useful
More informationUsing Mixture Covariance Matrices to Improve Face and Facial Expression Recognitions
Usng Mxture Covarance Matrces to Improve Face and Facal Expresson Recogntons Carlos E. homaz, Duncan F. Glles and Raul Q. Fetosa 2 Imperal College of Scence echnology and Medcne, Department of Computng,
More informationL10: Linear discriminants analysis
L0: Lnear dscrmnants analyss Lnear dscrmnant analyss, two classes Lnear dscrmnant analyss, C classes LDA vs. PCA Lmtatons of LDA Varants of LDA Other dmensonalty reducton methods CSCE 666 Pattern Analyss
More informationOn Mean Squared Error of Hierarchical Estimator
S C H E D A E I N F O R M A T I C A E VOLUME 0 0 On Mean Squared Error of Herarchcal Estmator Stans law Brodowsk Faculty of Physcs, Astronomy, and Appled Computer Scence, Jagellonan Unversty, Reymonta
More informationCalculation of Sampling Weights
Perre Foy Statstcs Canada 4 Calculaton of Samplng Weghts 4.1 OVERVIEW The basc sample desgn used n TIMSS Populatons 1 and 2 was a twostage stratfed cluster desgn. 1 The frst stage conssted of a sample
More informationLinear Circuits Analysis. Superposition, Thevenin /Norton Equivalent circuits
Lnear Crcuts Analyss. Superposton, Theenn /Norton Equalent crcuts So far we hae explored tmendependent (resste) elements that are also lnear. A tmendependent elements s one for whch we can plot an / cure.
More informationOnLine Fault Detection in Wind Turbine Transmission System using Adaptive Filter and Robust Statistical Features
OnLne Fault Detecton n Wnd Turbne Transmsson System usng Adaptve Flter and Robust Statstcal Features Ruoyu L Remote Dagnostcs Center SKF USA Inc. 3443 N. Sam Houston Pkwy., Houston TX 77086 Emal: ruoyu.l@skf.com
More informationDocument image template matching based on component block list
Pattern Recognton Letters 22 2001) 1033±1042 www.elsever.nl/locate/patrec Document mage template matchng based on component block lst Hanchuan Peng a,b,c, *, Fuhu Long b, Zheru Ch b, WanCh Su b a Department
More informationCharacterization of Assembly. Variation Analysis Methods. A Thesis. Presented to the. Department of Mechanical Engineering. Brigham Young University
Characterzaton of Assembly Varaton Analyss Methods A Thess Presented to the Department of Mechancal Engneerng Brgham Young Unversty In Partal Fulfllment of the Requrements for the Degree Master of Scence
More informationI. SCOPE, APPLICABILITY AND PARAMETERS Scope
D Executve Board Annex 9 Page A/R ethodologcal Tool alculaton of the number of sample plots for measurements wthn A/R D project actvtes (Verson 0) I. SOPE, PIABIITY AD PARAETERS Scope. Ths tool s applcable
More informationThe Analysis of Covariance. ERSH 8310 Keppel and Wickens Chapter 15
The Analyss of Covarance ERSH 830 Keppel and Wckens Chapter 5 Today s Class Intal Consderatons Covarance and Lnear Regresson The Lnear Regresson Equaton TheAnalyss of Covarance Assumptons Underlyng the
More informationINVESTIGATION OF VEHICULAR USERS FAIRNESS IN CDMAHDR NETWORKS
21 22 September 2007, BULGARIA 119 Proceedngs of the Internatonal Conference on Informaton Technologes (InfoTech2007) 21 st 22 nd September 2007, Bulgara vol. 2 INVESTIGATION OF VEHICULAR USERS FAIRNESS
More informationLecture 5,6 Linear Methods for Classification. Summary
Lecture 5,6 Lnear Methods for Classfcaton Rce ELEC 697 Farnaz Koushanfar Fall 2006 Summary Bayes Classfers Lnear Classfers Lnear regresson of an ndcator matrx Lnear dscrmnant analyss (LDA) Logstc regresson
More informationNuno Vasconcelos UCSD
Bayesan parameter estmaton Nuno Vasconcelos UCSD 1 Maxmum lkelhood parameter estmaton n three steps: 1 choose a parametrc model for probabltes to make ths clear we denote the vector of parameters by Θ
More informationThe Analysis of Outliers in Statistical Data
THALES Project No. xxxx The Analyss of Outlers n Statstcal Data Research Team Chrysses Caron, Assocate Professor (P.I.) Vaslk Karot, Doctoral canddate Polychrons Economou, Chrstna Perrakou, Postgraduate
More informationJ. Parallel Distrib. Comput.
J. Parallel Dstrb. Comput. 71 (2011) 62 76 Contents lsts avalable at ScenceDrect J. Parallel Dstrb. Comput. journal homepage: www.elsever.com/locate/jpdc Optmzng server placement n dstrbuted systems n
More informationFast Fuzzy Clustering of Web Page Collections
Fast Fuzzy Clusterng of Web Page Collectons Chrstan Borgelt and Andreas Nürnberger Dept. of Knowledge Processng and Language Engneerng OttovonGuerckeUnversty of Magdeburg Unverstätsplatz, D396 Magdeburg,
More informationLogistic Regression. Steve Kroon
Logstc Regresson Steve Kroon Course notes sectons: 24.324.4 Dsclamer: these notes do not explctly ndcate whether values are vectors or scalars, but expects the reader to dscern ths from the context. Scenaro
More informationAn interactive system for structurebased ASCII art creation
An nteractve system for structurebased ASCII art creaton Katsunor Myake Henry Johan Tomoyuk Nshta The Unversty of Tokyo Nanyang Technologcal Unversty Abstract NonPhotorealstc Renderng (NPR), whose am
More informationAn Evaluation of the Extended Logistic, Simple Logistic, and Gompertz Models for Forecasting Short Lifecycle Products and Services
An Evaluaton of the Extended Logstc, Smple Logstc, and Gompertz Models for Forecastng Short Lfecycle Products and Servces Charles V. Trappey a,1, Hsnyng Wu b a Professor (Management Scence), Natonal Chao
More informationPerformance Analysis and Coding Strategy of ECOC SVMs
Internatonal Journal of Grd and Dstrbuted Computng Vol.7, No. (04), pp.6776 http://dx.do.org/0.457/jgdc.04.7..07 Performance Analyss and Codng Strategy of ECOC SVMs Zhgang Yan, and Yuanxuan Yang, School
More informationThe eigenvalue derivatives of linear damped systems
Control and Cybernetcs vol. 32 (2003) No. 4 The egenvalue dervatves of lnear damped systems by YeongJeu Sun Department of Electrcal Engneerng IShou Unversty Kaohsung, Tawan 840, R.O.C emal: yjsun@su.edu.tw
More informationState function: eigenfunctions of hermitian operators> normalization, orthogonality completeness
Schroednger equaton Basc postulates of quantum mechancs. Operators: Hermtan operators, commutators State functon: egenfunctons of hermtan operators> normalzaton, orthogonalty completeness egenvalues and
More informationThe Greedy Method. Introduction. 0/1 Knapsack Problem
The Greedy Method Introducton We have completed data structures. We now are gong to look at algorthm desgn methods. Often we are lookng at optmzaton problems whose performance s exponental. For an optmzaton
More informationNPAR TESTS. OneSample ChiSquare Test. Cell Specification. Observed Frequencies 1O i 6. Expected Frequencies 1EXP i 6
PAR TESTS If a WEIGHT varable s specfed, t s used to replcate a case as many tmes as ndcated by the weght value rounded to the nearest nteger. If the workspace requrements are exceeded and samplng has
More informationQuantization Effects in Digital Filters
Quantzaton Effects n Dgtal Flters Dstrbuton of Truncaton Errors In two's complement representaton an exact number would have nfntely many bts (n general). When we lmt the number of bts to some fnte value
More informationThe Probit Model. Alexander Spermann. SoSe 2009
The Probt Model Aleander Spermann Unversty of Freburg SoSe 009 Course outlne. Notaton and statstcal foundatons. Introducton to the Probt model 3. Applcaton 4. Coeffcents and margnal effects 5. Goodnessofft
More informationSIMPLE LINEAR CORRELATION
SIMPLE LINEAR CORRELATION Smple lnear correlaton s a measure of the degree to whch two varables vary together, or a measure of the ntensty of the assocaton between two varables. Correlaton often s abused.
More informationErrorPropagation.nb 1. Error Propagation
ErrorPropagaton.nb Error Propagaton Suppose that we make observatons of a quantty x that s subject to random fluctuatons or measurement errors. Our best estmate of the true value for ths quantty s then
More informationPSYCHOLOGICAL RESEARCH (PYC 304C) Lecture 12
14 The Chsquared dstrbuton PSYCHOLOGICAL RESEARCH (PYC 304C) Lecture 1 If a normal varable X, havng mean µ and varance σ, s standardsed, the new varable Z has a mean 0 and varance 1. When ths standardsed
More informationPassive Filters. References: Barbow (pp 265275), Hayes & Horowitz (pp 3260), Rizzoni (Chap. 6)
Passve Flters eferences: Barbow (pp 6575), Hayes & Horowtz (pp 360), zzon (Chap. 6) Frequencyselectve or flter crcuts pass to the output only those nput sgnals that are n a desred range of frequences (called
More informationControl Charts for Means (Simulation)
Chapter 290 Control Charts for Means (Smulaton) Introducton Ths procedure allows you to study the run length dstrbuton of Shewhart (Xbar), Cusum, FIR Cusum, and EWMA process control charts for means usng
More informationAnalysis of Premium Liabilities for Australian Lines of Business
Summary of Analyss of Premum Labltes for Australan Lnes of Busness Emly Tao Honours Research Paper, The Unversty of Melbourne Emly Tao Acknowledgements I am grateful to the Australan Prudental Regulaton
More information8.5 UNITARY AND HERMITIAN MATRICES. The conjugate transpose of a complex matrix A, denoted by A*, is given by
6 CHAPTER 8 COMPLEX VECTOR SPACES 5. Fnd the kernel of the lnear transformaton gven n Exercse 5. In Exercses 55 and 56, fnd the mage of v, for the ndcated composton, where and are gven by the followng
More informationHow Sets of Coherent Probabilities May Serve as Models for Degrees of Incoherence
1 st Internatonal Symposum on Imprecse Probabltes and Ther Applcatons, Ghent, Belgum, 29 June 2 July 1999 How Sets of Coherent Probabltes May Serve as Models for Degrees of Incoherence Mar J. Schervsh
More informationProject Networks With MixedTime Constraints
Project Networs Wth MxedTme Constrants L Caccetta and B Wattananon Western Australan Centre of Excellence n Industral Optmsaton (WACEIO) Curtn Unversty of Technology GPO Box U1987 Perth Western Australa
More informationSupport Vector Machine Model for Currency Crisis Discrimination. Arindam Chaudhuri 1. Abstract
Support Vector Machne Model for Currency Crss Dscrmnaton Arndam Chaudhur Abstract Support Vector Machne (SVM) s powerful classfcaton technque based on the dea of structural rsk mnmzaton. Use of kernel
More information8 Algorithm for Binary Searching in Trees
8 Algorthm for Bnary Searchng n Trees In ths secton we present our algorthm for bnary searchng n trees. A crucal observaton employed by the algorthm s that ths problem can be effcently solved when the
More informationQuality Adjustment of Secondhand Motor Vehicle Application of Hedonic Approach in Hong Kong s Consumer Price Index
Qualty Adustment of Secondhand Motor Vehcle Applcaton of Hedonc Approach n Hong Kong s Consumer Prce Index Prepared for the 14 th Meetng of the Ottawa Group on Prce Indces 20 22 May 2015, Tokyo, Japan
More informationNasdaq Iceland Bond Indices 01 April 2015
Nasdaq Iceland Bond Indces 01 Aprl 2015 Fxed duraton Indces Introducton Nasdaq Iceland (the Exchange) began calculatng ts current bond ndces n the begnnng of 2005. They were a response to recent changes
More informationGRAVITY DATA VALIDATION AND OUTLIER DETECTION USING L 1 NORM
GRAVITY DATA VALIDATION AND OUTLIER DETECTION USING L 1 NORM BARRIOT JeanPerre, SARRAILH Mchel BGI/CNES 18.av.E.Beln 31401 TOULOUSE Cedex 4 (France) Emal: jeanperre.barrot@cnes.fr 1/Introducton The
More information 573 A Possible Detector for the Study of Weak Interactions at Fermi Clash R. Singer Argonne National Laboratory
 573 A Possble Detector for the Study of Weak nteractons at Ferm Clash R. Snger Argonne Natonal Laboratory The purpose of ths paper s to pont out what weak nteracton phenomena may exst for centerofmass
More informationChapter 7. RandomVariate Generation 7.1. Prof. Dr. Mesut Güneş Ch. 7 RandomVariate Generation
Chapter 7 RandomVarate Generaton 7. Contents Inversetransform Technque AcceptanceRejecton Technque Specal Propertes 7. Purpose & Overvew Develop understandng of generatng samples from a specfed dstrbuton
More informationLecture 10: Linear Regression Approach, Assumptions and Diagnostics
Approach to Modelng I Lecture 1: Lnear Regresson Approach, Assumptons and Dagnostcs Sandy Eckel seckel@jhsph.edu 8 May 8 General approach for most statstcal modelng: Defne the populaton of nterest State
More informationExtending Probabilistic Dynamic Epistemic Logic
Extendng Probablstc Dynamc Epstemc Logc Joshua Sack May 29, 2008 Probablty Space Defnton A probablty space s a tuple (S, A, µ), where 1 S s a set called the sample space. 2 A P(S) s a σalgebra: a set
More informationAn Analysis of Central Processor Scheduling in Multiprogrammed Computer Systems
STANCS73355 I SUSE73013 An Analyss of Central Processor Schedulng n Multprogrammed Computer Systems (Dgest Edton) by Thomas G. Prce October 1972 Techncal Report No. 57 Reproducton n whole or n part
More informationSingle and multiple stage classifiers implementing logistic discrimination
Sngle and multple stage classfers mplementng logstc dscrmnaton Hélo Radke Bttencourt 1 Dens Alter de Olvera Moraes 2 Vctor Haertel 2 1 Pontfíca Unversdade Católca do Ro Grande do Sul  PUCRS Av. Ipranga,
More information9.1 The Cumulative Sum Control Chart
Learnng Objectves 9.1 The Cumulatve Sum Control Chart 9.1.1 Basc Prncples: Cusum Control Chart for Montorng the Process Mean If s the target for the process mean, then the cumulatve sum control chart s
More informationConversion between the vector and raster data structures using Fuzzy Geographical Entities
Converson between the vector and raster data structures usng Fuzzy Geographcal Enttes Cdála Fonte Department of Mathematcs Faculty of Scences and Technology Unversty of Combra, Apartado 38, 3 454 Combra,
More informationOutsourcing inventory management decisions in healthcare: Models and application
European Journal of Operatonal Research 154 (24) 271 29 O.R. Applcatons Outsourcng nventory management decsons n healthcare: Models and applcaton www.elsever.com/locate/dsw Lawrence Ncholson a, Asoo J.
More informationTime Series Analysis in Studies of AGN Variability. Bradley M. Peterson The Ohio State University
Tme Seres Analyss n Studes of AGN Varablty Bradley M. Peterson The Oho State Unversty 1 Lnear Correlaton Degree to whch two parameters are lnearly correlated can be expressed n terms of the lnear correlaton
More informationANALYZING THE RELATIONSHIPS BETWEEN QUALITY, TIME, AND COST IN PROJECT MANAGEMENT DECISION MAKING
ANALYZING THE RELATIONSHIPS BETWEEN QUALITY, TIME, AND COST IN PROJECT MANAGEMENT DECISION MAKING Matthew J. Lberatore, Department of Management and Operatons, Vllanova Unversty, Vllanova, PA 19085, 6105194390,
More informationLecture 18: Clustering & classification
O CPS260/BGT204. Algorthms n Computatonal Bology October 30, 2003 Lecturer: Pana K. Agarwal Lecture 8: Clusterng & classfcaton Scrbe: Daun Hou Open Problem In HomeWor 2, problem 5 has an open problem whch
More informationA Computer Technique for Solving LP Problems with Bounded Variables
Dhaka Unv. J. Sc. 60(2): 163168, 2012 (July) A Computer Technque for Solvng LP Problems wth Bounded Varables S. M. Atqur Rahman Chowdhury * and Sanwar Uddn Ahmad Department of Mathematcs; Unversty of
More informationForecasting the Demand of Emergency Supplies: Based on the CBR Theory and BP Neural Network
700 Proceedngs of the 8th Internatonal Conference on Innovaton & Management Forecastng the Demand of Emergency Supples: Based on the CBR Theory and BP Neural Network Fu Deqang, Lu Yun, L Changbng School
More informationLearning from Multiple Outlooks
Learnng from Multple Outlooks Maayan Harel Department of Electrcal Engneerng, Technon, Hafa, Israel She Mannor Department of Electrcal Engneerng, Technon, Hafa, Israel maayanga@tx.technon.ac.l she@ee.technon.ac.l
More informationAddendum to: Importing SkillBiased Technology
Addendum to: Importng SkllBased Technology Arel Bursten UCLA and NBER Javer Cravno UCLA August 202 Jonathan Vogel Columba and NBER Abstract Ths Addendum derves the results dscussed n secton 3.3 of our
More informationGraph Theory and Cayley s Formula
Graph Theory and Cayley s Formula Chad Casarotto August 10, 2006 Contents 1 Introducton 1 2 Bascs and Defntons 1 Cayley s Formula 4 4 Prüfer Encodng A Forest of Trees 7 1 Introducton In ths paper, I wll
More informationProceedings of the Annual Meeting of the American Statistical Association, August 59, 2001
Proceedngs of the Annual Meetng of the Amercan Statstcal Assocaton, August 59, 2001 LISTASSISTED SAMPLING: THE EFFECT OF TELEPHONE SYSTEM CHANGES ON DESIGN 1 Clyde Tucker, Bureau of Labor Statstcs James
More informationCapital asset pricing model, arbitrage pricing theory and portfolio management
Captal asset prcng model, arbtrage prcng theory and portfolo management Vnod Kothar The captal asset prcng model (CAPM) s great n terms of ts understandng of rsk decomposton of rsk nto securtyspecfc rsk
More informationInequality and The Accounting Period. Quentin Wodon and Shlomo Yitzhaki. World Bank and Hebrew University. September 2001.
Inequalty and The Accountng Perod Quentn Wodon and Shlomo Ytzha World Ban and Hebrew Unversty September Abstract Income nequalty typcally declnes wth the length of tme taen nto account for measurement.
More informationChapter 4 ECONOMIC DISPATCH AND UNIT COMMITMENT
Chapter 4 ECOOMIC DISATCH AD UIT COMMITMET ITRODUCTIO A power system has several power plants. Each power plant has several generatng unts. At any pont of tme, the total load n the system s met by the
More information