Feature Selection for SVMs
|
|
- Merryl Tucker
- 6 years ago
- Views:
Transcription
1 Feature Selecton for SVMs J. Weston y, S. Mukherjee yy, O. Chapelle Λ, M. Pontl yy T. Poggo yy, V. Vapnk Λ;yyy y Barnhll BoInformatcs.com, Savannah, Georga, USA. yy CBCL MIT, Cambrdge, Massachusetts, USA. Λ AT&T Research Laboratores, Red Bank, USA. yyy Royal Holloway, Unversty of London, Egham, Surrey, UK. Abstract We ntroduce a method of feature selecton for Support Vector Machnes. The method s based upon fndng those features whch mnmze bounds on the leave-one-out error. Ths search can be effcently performed va gradent descent. The resultng algorthms are shown to be superor to some standard feature selecton algorthms on both toy data and real-lfe problems of face recognton, pedestran detecton and analyzng DNA mcroarray data. 1 Introducton In many supervsed learnng problems feature selecton s mportant for a varety of reasons: generalzaton performance, runnng tme requrements, and constrants and nterpretatonal ssues mposed by the problem tself. In classfcaton problems we are gven ` data ponts x 2 R n labeled y 2±1drawn..d from a probablty dstrbuton P (x;y). We would lke to select a subset of features whle preservng or mprovng the dscrmnatve ablty of a classfer. As a brute force search of all possble features s a combnatoral problem one needs to take nto account both the qualty of soluton and the computatonal expense of any gven algorthm. Support vector machnes (SVMs) have been extensvely used as a classfcaton tool wth a great deal of success from object recognton [5, 11] to classfcaton of cancer morphologes [10] and a varety of other areas, see e.g [13]. In ths artcle we ntroduce feature selecton algorthms for SVMs. The methods are based on mnmzng generalzaton bounds va gradent descent and are feasble to compute. Ths allows several new possbltes: one can speed up tme crtcal applcatons (e.g object recognton) and one can perform feature dscovery (e.g cancer dagnoss). We also show how SVMs can perform badly n the stuaton of many rrelevant features, a problem whch s remeded by usng our feature selecton approach. The artcle s organzed as follows. In secton 2 we descrbe the feature selecton problem, n secton 3 we revew SVMs and some of ther generalzaton bounds and n secton 4 we ntroduce the new SVM feature selecton method. Secton 5 then descrbes results on toy and real lfe data ndcatng the usefulness of our approach.
2 2 The Feature Selecton problem The feature selecton problem can be addressed n the followng two ways: (1) gven a fxed m f n, fnd the m features that gve the smallest expected generalzaton error; or (2) gven a maxmum allowable generalzaton error fl, fnd the smallest m. In both of these problems the expected generalzaton error s of course unknown, and thus must be estmated. In ths artcle we wll consder problem (1). Note that choces of m n problem (1) can usually can be reparameterzed as choces of fl n problem (2). Problem (1) s formulated as follows. Gven a fxed set of functons y = f (x;ff) we wsh to fnd a preprocessng of the data x 7! (x Λ ff), ff 2f0; 1g n, and the parameters ff of the functon f that gve the mnmum value of f (ff;ff)= Z V (y; f((x Λ ff);ff))dp (x;y) (1) subject to jjffjj 0 = m, where P (x;y) s unknown, x Λ ff =(x 1 ff 1 ;:::;x n ff n ) denotes an elementwse product, V ( ; ) s a loss functonal and jj jj 0 s the 0-norm. In the lterature one dstngushes between two types of method to solve ths problem: the so-called flter and wrapper methods [2]. Flter methods are defned as a preprocessng step to nducton that can remove rrelevant attrbutes before nducton occurs, and thus wsh to be vald for any set of functons f (x;ff). For example one popular flter method s to use Pearson correlaton coeffcents. The wrapper method, on the other hand, s defned as a search through the space of feature subsets usng the estmated accuracy from an nducton algorthm as a measure of goodness of a partcular feature subset. Thus, one approxmates f (ff;ff) by mnmzng f wrap (ff;ff) = mn f alg (ff) (2) ff subject to ff 2f0; 1g n where f alg s a learnng algorthm traned on data preprocessed wth fxed ff. Wrapper methods can provde more accurate solutons than flter methods [9], but n general are more computatonally expensve snce the nducton algorthm f alg must be evaluated over each feature set (vector ff) consdered, typcally usng performance on a hold out set as a measure of goodness of ft. In ths artcle we ntroduce a feature selecton algorthm for SVMs that takes advantage of the performance ncrease of wrapper methods whlst avodng ther computatonal complexty. Note, some prevous work on feature selecton for SVMs does exst, however results have been lmted to lnear kernels [3, 7] or lnear probablstc models [8]. Our approach can be appled to nonlnear problems. In order to descrbe ths algorthm, we frst revew the SVM method and some of ts propertes. 3 Support Vector Learnng Support Vector Machnes [13] realze the followng dea: they map x 2 R n nto a hgh (possbly nfnte) dmensonal space and construct an optmal hyperplane n ths space. Dfferent mappngs x 7! Φ(x) 2Hconstruct dfferent SVMs. The mappng Φ( ) s performed by a kernel functon K( ; ) whch defnes an nner product n H. The decson functon gven by an SVM s thus: f (x) =w Φ(x) +b = X ff 0 y K(x ; x) +b: (3) The optmal hyperplane s the one wth the maxmal dstance (n H space) to the closest mage Φ(x ) from the tranng data (called the maxmal margn). Ths reduces to maxmzng
3 the followng optmzaton problem: W 2 (ff) = `X =1 ff 1 2 `X ;j=1 ff ff j y y j K(x ; x j ) (4) under constrants P` ff =1 y =0 and ff 0; = 1;:::;`. For the non-separable case one can quadratcally penalze errors wth the modfed kernel K ψ K + 1 I where I s the dentty matrx and a constant penalzng the tranng errors (see [4] for reasons for ths choce). Suppose that the sze of the maxmal margn s M and the mages Φ(x 1 );:::;Φ(x`) of the tranng vectors are wthn a sphere of radus R. Then the followng holds true [13]. Theorem 1 If mages of tranng data of sze ` belongng to a sphere of sze R are separable wth the correspondng margn M, then the expectaton of the error probablty has the bound ρ ff EP err» 1` R 2 E 1` Φ Ψ M 2 = E R 2 W 2 (ff 0 ) ; (5) where expectaton s taken over sets of tranng data of sze `. Ths theorem justfes the dea that the performance depends on the rato EfR 2 =M 2 g and not smply on the large margn M, where R s controlled by the mappng functon Φ( ). Other bounds also exst, n partcular Vapnk and Chapelle [4] derved an estmate usng the concept of the span of support vectors. Theorem 2 Under the assumpton that the set of support vectors does not change when removng the example p EP ` 1 err» 1` E `X p=1 Ψ ψ! ff 0 p (K 1 SV ) 1 pp where Ψ s the step functon, K SV s the matrx of dot products between support vectors, p` 1 err s the probablty of test error for the machne traned on a sample of sze ` 1 and the expectatons are taken over the random choce of the sample. 4 Feature Selecton for SVMs In the problem of feature selecton we wsh to mnmze equaton (1) over ff and ff. The support vector method attempts to fnd the functon from the set f (x;w;b)=w Φ(x)+b that mnmzes generalzaton error. We frst enlarge the set of functons consdered by the algorthm to f (x;w;b;ff)=w Φ(x Λ ff) +b. Note that the mappng Φ ff (x) =Φ(x Λ ff) can be represented by choosng the kernel functon K ff n equatons (3) and (4): K ff (x; y) =K((x Λ ff); (y Λ ff)) = (Φ ff (x) Φ ff (y)) (7) for any K. Thus for these kernels the bounds n Theorems (1) and (2) stll hold. Hence, to mnmze f (ff;ff) over ff and ff we mnmze the wrapper functonal f wrap n equaton (2) where f alg s gven by the equatons (5) or (6) choosng a fxed value of ff mplemented by the kernel (7). Usng equaton (5) one mnmzes over ff: R 2 W 2 (ff) =R 2 (ff)w 2 (ff 0 ;ff) (8) where the radus R for kernel K ff can be computed by maxmzng (see, e.g [13]): R 2 (ff) = max f X f K ff (x ; x ) X ;j (6) f f j K ff (x ; x j ) (9)
4 P subject to f =1; f 0; =1;:::;`, and W 2 (ff 0 ;ff) s defned by the maxmum of functonal (4) usng kernel (7). In a smlar way, one can mnmze the span bound over ff nstead of equaton (8). Fndng the mnmum of R 2 W 2 over ff requres searchng over all possble subsets of n features whch s a combnatoral problem. To avod ths problem classcal methods of search nclude greedly addng or removng features (forward or backward selecton) and hll clmbng. All of these methods are expensve to compute f n s large. As an alternatve to these approaches we suggest the followng method: approxmate the bnary valued vector ff 2 f0; 1g n ; wth a real valued vector ff 2 R n. Then, to fnd the optmum value of ff one can mnmze R 2 W 2, or some other dfferentable crteron, by gradent descent. As explaned n [4] the dervatve of our crteron 2 W 2 (ff) = 2 (ff 0 2 ;ff) 2 (ff) = f 0 ff (x ; x 2 (ff 0 ;ff) = X ;j + W 2 (ff 0 (ff) (10) X ;j f 0 f 0 ff (x ; x j ) (11) ff 0 ff0 j y y ff (x ; x j ) : (12) We estmate the mnmum of f (ff;ff) by mnmzng equaton (8) n the space ff 2 R n usng the gradents (10) wth the followng extra constrant whch approxmates nteger programmng: X R 2 W 2 (ff) + (ff ) p (13) P subject to ff = m; ff 0; =1;:::;`. For large enough as p! 0 only m elements of ff wll be nonzero, approxmatng optmzaton problem f (ff;ff). One can further smplfy computatons by consderng a stepwse approxmaton procedure to fnd m features. To do ths one can mnmze R 2 W 2 (ff) wth ff unconstraned. One then sets the q f n smallest values of ff to zero, and repeats the mnmzaton untl only m nonzero elements of ff reman. Ths can mean repeatedly tranng a SVM just a few tmes, whch can be fast. 5 Experments 5.1 Toy data We compared standard SVMs, our feature selecton algorthms and three classcal flter methods to select features followed by SVM tranng. The three flter methods chose the m largest features accordng to: Pearson correlaton coeffcents, the Fsher crteron score 1, and the Kolmogorov-Smrnov test 2 ). The Pearson coeffcents and Fsher crteron cannot model nonlnear dependences. In the two followng artfcal datasets our objectve was to assess the ablty of the algorthm to select a small number of target features n the presence of rrelevant and redundant features. f 1 ff μ + f F (r) = r μ r ff, ff r + 2 where μ ± +ff r 2 r s the mean value for the r-th feature n the postve and negatve classes and ff ± 2 r s the standard devaton 2 KS tst(r) = p` sup ^P fx» f rg ^P fx» f r;y r =1g where f r denotes the r-th feature from each tranng example, and ^P s the correspondng emprcal dstrbuton.
5 Lnear problem Sx dmensons of 202 were relevant. The probablty of y = 1or 1 was equal. The frst three features fx 1 ;x 2 ;x 3 g were drawn as x = yn(; 1) and the second three features fx 4 ;x 5 ;x 6 g were drawn as x = N (0; 1) wth a probablty of 0:7, otherwse the frst three were drawn as x = N (0; 1) and the second three as x = yn( 3; 1). The remanng features are nose x = N (0; 20), =7;:::;202. Nonlnear problem Two dmensons of 52 were relevant. The probablty of y =1or 1 was equal. The data are drawn from the followng: f y = 1 then fx 1 ;x 2 g are drawn from N (μ 1 ; ±) or N (μ 2 ; ±) wth equal probablty, μ 1 = f 3; 3g and μ 4 2 = f 3 ; 3g and 4 ±=I, fy =1then fx 1 ;x 2 g are drawn agan from two normal dstrbutons wth equal probablty, wth μ 1 = f3; 3g and μ 2 = f 3; 3g and the same ± as before. The rest of the features are nose x = N (0; 20);=3;:::;52. In the lnear problem the frst sx features have redundancy and the rest of the features are rrelevant. In the nonlnear problem all but the frst two features are rrelevant. We used a lnear SVM for the lnear problem and a second order polynomal kernel for the nonlnear problem. For the flter methods and the SVM wth feature selecton we selected the 2 best features. The results are shown n Fgure (1) for varous tranng set szes, takng the average test error on 500 samples over 30 runs of each tranng set sze. The Fsher score (not shown n graphs due to space constrants) performed almost dentcally to correlaton coeffcents. In both problems standard SVMs perform poorly: n the lnear example usng ` = 500 ponts one obtans a test error of 13% for SVMs, whch should be compared to a test error of 3% wth ` =50usng our methods. Our SVM feature selecton methods also outperformed the flter methods, wth forward selecton beng margnally better than gradent descent. In the nonlnear problem, among the flter methods only the Kolmogorov-Smrnov test mproved performance over standard SVMs. 0.7 Span Bound & Forward Selecton RW Bound & Gradent Standard SVMs 0.6 Correlaton Coeffcents Kolmogorov Smrnov Test Span Bound & Forward Selecton RW Bound & Gradent Standard SVMs 0.6 Correlaton Coeffcents Kolmogorov Smrnov Test (a) (b) Fgure 1: A comparson of feature selecton methods on (a) a lnear problem and (b) a nonlnear problem both wth many rrelevant features. The x-axs s the number of tranng ponts, and the y-axs the test error as a fracton of test ponts. 5.2 Real-lfe data For the followng problems we compared mnmzng R 2 W 2 va gradent descent to the Fsher crteron score. Face detecton The face detecton experments descrbed n ths secton are for the system ntroduced n [12, 5]. The tranng set conssted of 2; 429 postve mages of frontal faces of
6 sze 19x19 and 13; 229 negatve mages not contanng faces. The test set conssted of 105 postve mages and 2; 000; 000 negatve mages. A wavelet representaton of these mages [5] was used, whch resulted n 1; 740 coeffcents for each mage. Performance of the system usng all coeffcents, 725 coeffcents, and 120 coeffcents s shown n the ROC curve n fgure (2a). The best results were acheved usng all features, however R 2 W 2 outperfomed the Fsher score. In ths case feature selecton was not useful for elmnatng rrelevant features, but one could obtan a soluton wth comparable performance but reduced complexty, whch could be mportant for tme crtcal applcatons. Pedestran detecton The pedestran detecton experments descrbed n ths secton are for the system ntroduced n [11]. The tranng set conssted of 924 postve mages of people of sze 128x64 and 10; 044 negatve mages not contanng pedestrans. The test set conssted of 124 postve mages and 800; 000 negatve mages. A wavelet representaton of these mages [5, 11] was used, whch resulted n 1; 326 coeffcents for each mage. Performance of the system usng all coeffcents and 120 coeffcents s shown n the ROC curve n fgure (2b). The results showed the same trends that were observed n the face recognton problem Detecton Rate False Postve Rate Detecton Rate Detecton Rate False Postve Rate (a) False Postve Rate (b) Fgure 2: The sold lne s usng all features, the sold lne wth a crcle s our feature selecton method (mnmzng R 2 W 2 by gradent descent) and the dotted lne s the Fsher score. (a)the top ROC curves are for 725 features and the bottom one for 120 features for face detecton. (b) ROC curves usng all features and 120 features for pedestran detecton. Cancer morphology classfcaton For DNA mcroarray data analyss one needs to determne the relevant genes n dscrmnaton as well as dscrmnate accurately. We look at two leukema dscrmnaton problems [6, 10] and a colon cancer problem [1] (see also [7] for a treatment of both of these problems). The frst problem was classfyng myelod and lymphoblastc leukemas based on the expresson of 7129 genes. The tranng set conssts of 38 examples and the test set of 34 examples. Usng all genes a lnear SVM makes 1 error on the test set. Usng 20 genes 0 errors are made for R 2 W 2 and 3 errors are made usng the Fsher score. Usng 5 genes 1 error s made for R 2 W 2 and 5 errors are made for the Fsher score. The method of [6] performs comparably to the Fsher score. The second problem was dscrmnatng B versus T cells for lymphoblastc cells [6]. S- tandard lnear SVMs make 1 error for ths problem. Usng 5 genes 0 errors are made for R 2 W 2 and 3 errors are made usng the Fsher score.
7 In the colon cancer problem [1] 62 tssue samples probed by olgonucleotde arrays contan 22 normal and 40 colon cancer tssues that must be dscrmnated based upon the expresson of 2000 genes. Splttng the data nto a tranng set of 50 and a test set of 12 n 50 separate trals we obtaned a test error of 13% for standard lnear SVMs. Takng 15 genes for each feature selecton method we obtaned 12.8% for R 2 W 2, 17.0% for Pearson correlaton coeffcents, 19.3% for the Fsher score and 19.2% for the Kolmogorov-Smrnov test. Our method s only worse than the best flter method n 8 of the 50 trals. 6 Concluson In ths artcle we have ntroduced a method to perform feature selecton for SVMs. Ths method s computatonally feasble for hgh dmensonal datasets compared to exstng wrapper methods, and experments on a varety of toy and real datasets show superor performance to the flter methods tred. Ths method, amongst other applcatons, speeds up SVMs for tme crtcal applcatons (e.g pedestran detecton), and makes possble feature dscovery (e.g gene dscovery). Secondly, n smple experments we showed that SVMs can ndeed suffer n hgh dmensonal spaces where many features are rrelevant. Our method provdes one way to crcumvent ths naturally occurng, complex problem. References [1] U. Alon, N. Barka, D. Notterman, K. Gsh, S. Ybarra, D. Mack, and A. Levne. Broad patterns of gene expresson revealed by clusterng analyss of tumor and normal colon cancer tssues probed by olgonucleotde arrays. Cell Bology, 96: , [2] A. Blum and P. Langley. Selecton of relevant features and examples n machne learnng. Artfcal Intellgence, 97: ,, [3] P. S. Bradley and O. L. Mangasaran. Feature selecton va concave mnmzaton and support vector machnes. In Proc. 13th Internatonal Conference on Machne Learnng, pages 82 90, San Francsco, CA, [4] O. Chapelle, V. Vapnk, O. Bousquet, and S. Mukherjee. Choosng kernel parameters for support vector machnes. Machne Learnng, [5] T. Evgenou, M. Pontl, C. Papageorgou, and T. Poggo. Image representatons for object detecton usng kernel classfers. In Asan Conference on Computer Vson, [6] T. Golub, D. Slonm, P. Tamayo, C. Huard, M. Gaasenbeek, J. Mesrov, H. Coller, M. Loh, J. Downng, M. Calgur, C. D. Bloomfeld, and E. S. Lander. Molecular classfcaton of cancer: Class dscovery and class predcton by gene expresson montorng. Scence, 286: , [7] I. Guyon, J. Weston, S. Barnhll, and V. Vapnk. Gene selecton for cancer classfcaton usng support vector machnes. Machne Learnng, [8] T. Jebara and T. Jaakkola. Feature selecton and dualtes n maxmum entropy dscrmnaton. In Uncertanty In Artfcal Intellegence, [9] J. Kohav. Wrappers for feature subset selecton. AIJ ssue on relevance, [10] S. Mukherjee, P. Tamayo, D. Slonm, A. Verr, T. Golub, J. Mesrov, and T. Poggo. Support vector machne classfcaton of mcroarray data. AI Memo 1677, Massachusetts Insttute of Technology, [11] M. Oren, C. Papageorgou, P. Snha, E. Osuna, and T. Poggo. Pedestran detecton usng wavelet templates. In Proc. Computer Vson and Pattern Recognton, pages , Puerto Rco, June [12] C. Papageorgou, M. Oren, and T. Poggo. A general framework for object detecton. In Internatonal Conference on Computer Vson, Bombay, Inda, January [13] V. Vapnk. Statstcal Learnng Theory. John Wley and Sons, New York, 1998.
Feature Selection for SVMs
Feature Selection for SVMs J. Weston, S. Mukherjee, O. Chapelle, M. Pontil T. Poggio, V. Vapnik, Barnhill BioInformatics.com, Savannah, Georgia, USA. CBCL MIT, Cambridge, Massachusetts, USA. AT&T Research
More informationKernel Methods and SVMs Extension
Kernel Methods and SVMs Extenson The purpose of ths document s to revew materal covered n Machne Learnng 1 Supervsed Learnng regardng support vector machnes (SVMs). Ths document also provdes a general
More informationLecture Notes on Linear Regression
Lecture Notes on Lnear Regresson Feng L fl@sdueducn Shandong Unversty, Chna Lnear Regresson Problem In regresson problem, we am at predct a contnuous target value gven an nput feature vector We assume
More informationProblem Set 9 Solutions
Desgn and Analyss of Algorthms May 4, 2015 Massachusetts Insttute of Technology 6.046J/18.410J Profs. Erk Demane, Srn Devadas, and Nancy Lynch Problem Set 9 Solutons Problem Set 9 Solutons Ths problem
More informationCS 3710: Visual Recognition Classification and Detection. Adriana Kovashka Department of Computer Science January 13, 2015
CS 3710: Vsual Recognton Classfcaton and Detecton Adrana Kovashka Department of Computer Scence January 13, 2015 Plan for Today Vsual recognton bascs part 2: Classfcaton and detecton Adrana s research
More informationGeneralized Linear Methods
Generalzed Lnear Methods 1 Introducton In the Ensemble Methods the general dea s that usng a combnaton of several weak learner one could make a better learner. More formally, assume that we have a set
More informationLinear Classification, SVMs and Nearest Neighbors
1 CSE 473 Lecture 25 (Chapter 18) Lnear Classfcaton, SVMs and Nearest Neghbors CSE AI faculty + Chrs Bshop, Dan Klen, Stuart Russell, Andrew Moore Motvaton: Face Detecton How do we buld a classfer to dstngush
More informationFeature Selection: Part 1
CSE 546: Machne Learnng Lecture 5 Feature Selecton: Part 1 Instructor: Sham Kakade 1 Regresson n the hgh dmensonal settng How do we learn when the number of features d s greater than the sample sze n?
More informationSupport Vector Machines
Support Vector Machnes Konstantn Tretyakov (kt@ut.ee) MTAT.03.227 Machne Learnng So far Supervsed machne learnng Lnear models Least squares regresson Fsher s dscrmnant, Perceptron, Logstc model Non-lnear
More informationSupport Vector Machines. Vibhav Gogate The University of Texas at dallas
Support Vector Machnes Vbhav Gogate he Unversty of exas at dallas What We have Learned So Far? 1. Decson rees. Naïve Bayes 3. Lnear Regresson 4. Logstc Regresson 5. Perceptron 6. Neural networks 7. K-Nearest
More informationWhich Separator? Spring 1
Whch Separator? 6.034 - Sprng 1 Whch Separator? Mamze the margn to closest ponts 6.034 - Sprng Whch Separator? Mamze the margn to closest ponts 6.034 - Sprng 3 Margn of a pont " # y (w $ + b) proportonal
More informationSupport Vector Machines
Support Vector Machnes Konstantn Tretyakov (kt@ut.ee) MTAT.03.227 Machne Learnng So far So far Supervsed machne learnng Lnear models Non-lnear models Unsupervsed machne learnng Generc scaffoldng So far
More informationMMA and GCMMA two methods for nonlinear optimization
MMA and GCMMA two methods for nonlnear optmzaton Krster Svanberg Optmzaton and Systems Theory, KTH, Stockholm, Sweden. krlle@math.kth.se Ths note descrbes the algorthms used n the author s 2007 mplementatons
More informationFor now, let us focus on a specific model of neurons. These are simplified from reality but can achieve remarkable results.
Neural Networks : Dervaton compled by Alvn Wan from Professor Jtendra Malk s lecture Ths type of computaton s called deep learnng and s the most popular method for many problems, such as computer vson
More informationModule 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur
Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Verson ECE IIT, Kharagpur Lesson 6 Theory of Quantzaton Verson ECE IIT, Kharagpur Instructonal Objectves At the end of ths lesson, the students should be able to:
More informationLecture 10 Support Vector Machines II
Lecture 10 Support Vector Machnes II 22 February 2016 Taylor B. Arnold Yale Statstcs STAT 365/665 1/28 Notes: Problem 3 s posted and due ths upcomng Frday There was an early bug n the fake-test data; fxed
More information2E Pattern Recognition Solutions to Introduction to Pattern Recognition, Chapter 2: Bayesian pattern classification
E395 - Pattern Recognton Solutons to Introducton to Pattern Recognton, Chapter : Bayesan pattern classfcaton Preface Ths document s a soluton manual for selected exercses from Introducton to Pattern Recognton
More informationLogistic Regression. CAP 5610: Machine Learning Instructor: Guo-Jun QI
Logstc Regresson CAP 561: achne Learnng Instructor: Guo-Jun QI Bayes Classfer: A Generatve model odel the posteror dstrbuton P(Y X) Estmate class-condtonal dstrbuton P(X Y) for each Y Estmate pror dstrbuton
More informationEvaluation of simple performance measures for tuning SVM hyperparameters
Evaluaton of smple performance measures for tunng SVM hyperparameters Kabo Duan, S Sathya Keerth, Aun Neow Poo Department of Mechancal Engneerng, Natonal Unversty of Sngapore, 0 Kent Rdge Crescent, 960,
More informationA Robust Method for Calculating the Correlation Coefficient
A Robust Method for Calculatng the Correlaton Coeffcent E.B. Nven and C. V. Deutsch Relatonshps between prmary and secondary data are frequently quantfed usng the correlaton coeffcent; however, the tradtonal
More informationCIS526: Machine Learning Lecture 3 (Sept 16, 2003) Linear Regression. Preparation help: Xiaoying Huang. x 1 θ 1 output... θ M x M
CIS56: achne Learnng Lecture 3 (Sept 6, 003) Preparaton help: Xaoyng Huang Lnear Regresson Lnear regresson can be represented by a functonal form: f(; θ) = θ 0 0 +θ + + θ = θ = 0 ote: 0 s a dummy attrbute
More informationThe Minimum Universal Cost Flow in an Infeasible Flow Network
Journal of Scences, Islamc Republc of Iran 17(2): 175-180 (2006) Unversty of Tehran, ISSN 1016-1104 http://jscencesutacr The Mnmum Unversal Cost Flow n an Infeasble Flow Network H Saleh Fathabad * M Bagheran
More informationLecture 12: Classification
Lecture : Classfcaton g Dscrmnant functons g The optmal Bayes classfer g Quadratc classfers g Eucldean and Mahalanobs metrcs g K Nearest Neghbor Classfers Intellgent Sensor Systems Rcardo Guterrez-Osuna
More informationFinding Dense Subgraphs in G(n, 1/2)
Fndng Dense Subgraphs n Gn, 1/ Atsh Das Sarma 1, Amt Deshpande, and Rav Kannan 1 Georga Insttute of Technology,atsh@cc.gatech.edu Mcrosoft Research-Bangalore,amtdesh,annan@mcrosoft.com Abstract. Fndng
More informationVARIATION OF CONSTANT SUM CONSTRAINT FOR INTEGER MODEL WITH NON UNIFORM VARIABLES
VARIATION OF CONSTANT SUM CONSTRAINT FOR INTEGER MODEL WITH NON UNIFORM VARIABLES BÂRZĂ, Slvu Faculty of Mathematcs-Informatcs Spru Haret Unversty barza_slvu@yahoo.com Abstract Ths paper wants to contnue
More informationNatural Language Processing and Information Retrieval
Natural Language Processng and Informaton Retreval Support Vector Machnes Alessandro Moschtt Department of nformaton and communcaton technology Unversty of Trento Emal: moschtt@ds.untn.t Summary Support
More informationCSE 252C: Computer Vision III
CSE 252C: Computer Vson III Lecturer: Serge Belonge Scrbe: Catherne Wah LECTURE 15 Kernel Machnes 15.1. Kernels We wll study two methods based on a specal knd of functon k(x, y) called a kernel: Kernel
More information10-701/ Machine Learning, Fall 2005 Homework 3
10-701/15-781 Machne Learnng, Fall 2005 Homework 3 Out: 10/20/05 Due: begnnng of the class 11/01/05 Instructons Contact questons-10701@autonlaborg for queston Problem 1 Regresson and Cross-valdaton [40
More informationLearning Theory: Lecture Notes
Learnng Theory: Lecture Notes Lecturer: Kamalka Chaudhur Scrbe: Qush Wang October 27, 2012 1 The Agnostc PAC Model Recall that one of the constrants of the PAC model s that the data dstrbuton has to be
More informationPattern Classification
Pattern Classfcaton All materals n these sldes ere taken from Pattern Classfcaton (nd ed) by R. O. Duda, P. E. Hart and D. G. Stork, John Wley & Sons, 000 th the permsson of the authors and the publsher
More information1 Convex Optimization
Convex Optmzaton We wll consder convex optmzaton problems. Namely, mnmzaton problems where the objectve s convex (we assume no constrants for now). Such problems often arse n machne learnng. For example,
More informationMaximal Margin Classifier
CS81B/Stat41B: Advanced Topcs n Learnng & Decson Makng Mamal Margn Classfer Lecturer: Mchael Jordan Scrbes: Jana van Greunen Corrected verson - /1/004 1 References/Recommended Readng 1.1 Webstes www.kernel-machnes.org
More informationNUMERICAL DIFFERENTIATION
NUMERICAL DIFFERENTIATION 1 Introducton Dfferentaton s a method to compute the rate at whch a dependent output y changes wth respect to the change n the ndependent nput x. Ths rate of change s called the
More informationRegularized Discriminant Analysis for Face Recognition
1 Regularzed Dscrmnant Analyss for Face Recognton Itz Pma, Mayer Aladem Department of Electrcal and Computer Engneerng, Ben-Guron Unversty of the Negev P.O.Box 653, Beer-Sheva, 845, Israel. Abstract Ths
More informationChapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems
Numercal Analyss by Dr. Anta Pal Assstant Professor Department of Mathematcs Natonal Insttute of Technology Durgapur Durgapur-713209 emal: anta.bue@gmal.com 1 . Chapter 5 Soluton of System of Lnear Equatons
More informationEstimating the Fundamental Matrix by Transforming Image Points in Projective Space 1
Estmatng the Fundamental Matrx by Transformng Image Ponts n Projectve Space 1 Zhengyou Zhang and Charles Loop Mcrosoft Research, One Mcrosoft Way, Redmond, WA 98052, USA E-mal: fzhang,cloopg@mcrosoft.com
More informationADVANCED MACHINE LEARNING ADVANCED MACHINE LEARNING
1 ADVANCED ACHINE LEARNING ADVANCED ACHINE LEARNING Non-lnear regresson technques 2 ADVANCED ACHINE LEARNING Regresson: Prncple N ap N-dm. nput x to a contnuous output y. Learn a functon of the type: N
More informationOn the Multicriteria Integer Network Flow Problem
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 5, No 2 Sofa 2005 On the Multcrtera Integer Network Flow Problem Vassl Vasslev, Marana Nkolova, Maryana Vassleva Insttute of
More informationU.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017
U.C. Berkeley CS94: Beyond Worst-Case Analyss Handout 4s Luca Trevsan September 5, 07 Summary of Lecture 4 In whch we ntroduce semdefnte programmng and apply t to Max Cut. Semdefnte Programmng Recall that
More informationA PROBABILITY-DRIVEN SEARCH ALGORITHM FOR SOLVING MULTI-OBJECTIVE OPTIMIZATION PROBLEMS
HCMC Unversty of Pedagogy Thong Nguyen Huu et al. A PROBABILITY-DRIVEN SEARCH ALGORITHM FOR SOLVING MULTI-OBJECTIVE OPTIMIZATION PROBLEMS Thong Nguyen Huu and Hao Tran Van Department of mathematcs-nformaton,
More informationMin Cut, Fast Cut, Polynomial Identities
Randomzed Algorthms, Summer 016 Mn Cut, Fast Cut, Polynomal Identtes Instructor: Thomas Kesselhem and Kurt Mehlhorn 1 Mn Cuts n Graphs Lecture (5 pages) Throughout ths secton, G = (V, E) s a mult-graph.
More informationSupporting Information
Supportng Informaton The neural network f n Eq. 1 s gven by: f x l = ReLU W atom x l + b atom, 2 where ReLU s the element-wse rectfed lnear unt, 21.e., ReLUx = max0, x, W atom R d d s the weght matrx to
More informationSupport Vector Machines CS434
Support Vector Machnes CS434 Lnear Separators Many lnear separators exst that perfectly classfy all tranng examples Whch of the lnear separators s the best? Intuton of Margn Consder ponts A, B, and C We
More informationVQ widely used in coding speech, image, and video
at Scalar quantzers are specal cases of vector quantzers (VQ): they are constraned to look at one sample at a tme (memoryless) VQ does not have such constrant better RD perfomance expected Source codng
More informationKristin P. Bennett. Rensselaer Polytechnic Institute
Support Vector Machnes and Other Kernel Methods Krstn P. Bennett Mathematcal Scences Department Rensselaer Polytechnc Insttute Support Vector Machnes (SVM) A methodology for nference based on Statstcal
More informationCSci 6974 and ECSE 6966 Math. Tech. for Vision, Graphics and Robotics Lecture 21, April 17, 2006 Estimating A Plane Homography
CSc 6974 and ECSE 6966 Math. Tech. for Vson, Graphcs and Robotcs Lecture 21, Aprl 17, 2006 Estmatng A Plane Homography Overvew We contnue wth a dscusson of the major ssues, usng estmaton of plane projectve
More informationINF 5860 Machine learning for image classification. Lecture 3 : Image classification and regression part II Anne Solberg January 31, 2018
INF 5860 Machne learnng for mage classfcaton Lecture 3 : Image classfcaton and regresson part II Anne Solberg January 3, 08 Today s topcs Multclass logstc regresson and softma Regularzaton Image classfcaton
More informationThe Multiple Classical Linear Regression Model (CLRM): Specification and Assumptions. 1. Introduction
ECONOMICS 5* -- NOTE (Summary) ECON 5* -- NOTE The Multple Classcal Lnear Regresson Model (CLRM): Specfcaton and Assumptons. Introducton CLRM stands for the Classcal Lnear Regresson Model. The CLRM s also
More informationHomework Assignment 3 Due in class, Thursday October 15
Homework Assgnment 3 Due n class, Thursday October 15 SDS 383C Statstcal Modelng I 1 Rdge regresson and Lasso 1. Get the Prostrate cancer data from http://statweb.stanford.edu/~tbs/elemstatlearn/ datasets/prostate.data.
More informationMDL-Based Unsupervised Attribute Ranking
MDL-Based Unsupervsed Attrbute Rankng Zdravko Markov Computer Scence Department Central Connectcut State Unversty New Brtan, CT 06050, USA http://www.cs.ccsu.edu/~markov/ markovz@ccsu.edu MDL-Based Unsupervsed
More informationSimulated Power of the Discrete Cramér-von Mises Goodness-of-Fit Tests
Smulated of the Cramér-von Mses Goodness-of-Ft Tests Steele, M., Chaselng, J. and 3 Hurst, C. School of Mathematcal and Physcal Scences, James Cook Unversty, Australan School of Envronmental Studes, Grffth
More informationLearning with Tensor Representation
Report No. UIUCDCS-R-2006-276 UILU-ENG-2006-748 Learnng wth Tensor Representaton by Deng Ca, Xaofe He, and Jawe Han Aprl 2006 Learnng wth Tensor Representaton Deng Ca Xaofe He Jawe Han Department of Computer
More informationLinear Approximation with Regularization and Moving Least Squares
Lnear Approxmaton wth Regularzaton and Movng Least Squares Igor Grešovn May 007 Revson 4.6 (Revson : March 004). 5 4 3 0.5 3 3.5 4 Contents: Lnear Fttng...4. Weghted Least Squares n Functon Approxmaton...
More informationLecture 10 Support Vector Machines. Oct
Lecture 10 Support Vector Machnes Oct - 20-2008 Lnear Separators Whch of the lnear separators s optmal? Concept of Margn Recall that n Perceptron, we learned that the convergence rate of the Perceptron
More informationLecture 20: November 7
0-725/36-725: Convex Optmzaton Fall 205 Lecturer: Ryan Tbshran Lecture 20: November 7 Scrbes: Varsha Chnnaobreddy, Joon Sk Km, Lngyao Zhang Note: LaTeX template courtesy of UC Berkeley EECS dept. Dsclamer:
More informationCOS 521: Advanced Algorithms Game Theory and Linear Programming
COS 521: Advanced Algorthms Game Theory and Lnear Programmng Moses Charkar February 27, 2013 In these notes, we ntroduce some basc concepts n game theory and lnear programmng (LP). We show a connecton
More informationEEE 241: Linear Systems
EEE : Lnear Systems Summary #: Backpropagaton BACKPROPAGATION The perceptron rule as well as the Wdrow Hoff learnng were desgned to tran sngle layer networks. They suffer from the same dsadvantage: they
More informationCSC 411 / CSC D11 / CSC C11
18 Boostng s a general strategy for learnng classfers by combnng smpler ones. The dea of boostng s to take a weak classfer that s, any classfer that wll do at least slghtly better than chance and use t
More informationGrover s Algorithm + Quantum Zeno Effect + Vaidman
Grover s Algorthm + Quantum Zeno Effect + Vadman CS 294-2 Bomb 10/12/04 Fall 2004 Lecture 11 Grover s algorthm Recall that Grover s algorthm for searchng over a space of sze wors as follows: consder the
More informationLinear Feature Engineering 11
Lnear Feature Engneerng 11 2 Least-Squares 2.1 Smple least-squares Consder the followng dataset. We have a bunch of nputs x and correspondng outputs y. The partcular values n ths dataset are x y 0.23 0.19
More informationMLE and Bayesian Estimation. Jie Tang Department of Computer Science & Technology Tsinghua University 2012
MLE and Bayesan Estmaton Je Tang Department of Computer Scence & Technology Tsnghua Unversty 01 1 Lnear Regresson? As the frst step, we need to decde how we re gong to represent the functon f. One example:
More informationOnline Classification: Perceptron and Winnow
E0 370 Statstcal Learnng Theory Lecture 18 Nov 8, 011 Onlne Classfcaton: Perceptron and Wnnow Lecturer: Shvan Agarwal Scrbe: Shvan Agarwal 1 Introducton In ths lecture we wll start to study the onlne learnng
More informationEnsemble Methods: Boosting
Ensemble Methods: Boostng Ncholas Ruozz Unversty of Texas at Dallas Based on the sldes of Vbhav Gogate and Rob Schapre Last Tme Varance reducton va baggng Generate new tranng data sets by samplng wth replacement
More informationSolutions HW #2. minimize. Ax = b. Give the dual problem, and make the implicit equality constraints explicit. Solution.
Solutons HW #2 Dual of general LP. Fnd the dual functon of the LP mnmze subject to c T x Gx h Ax = b. Gve the dual problem, and make the mplct equalty constrants explct. Soluton. 1. The Lagrangan s L(x,
More informationStatistical pattern recognition
Statstcal pattern recognton Bayes theorem Problem: decdng f a patent has a partcular condton based on a partcular test However, the test s mperfect Someone wth the condton may go undetected (false negatve
More informationSemi-supervised Classification with Active Query Selection
Sem-supervsed Classfcaton wth Actve Query Selecton Jao Wang and Swe Luo School of Computer and Informaton Technology, Beng Jaotong Unversty, Beng 00044, Chna Wangjao088@63.com Abstract. Labeled samples
More informationSome modelling aspects for the Matlab implementation of MMA
Some modellng aspects for the Matlab mplementaton of MMA Krster Svanberg krlle@math.kth.se Optmzaton and Systems Theory Department of Mathematcs KTH, SE 10044 Stockholm September 2004 1. Consdered optmzaton
More informationErrors for Linear Systems
Errors for Lnear Systems When we solve a lnear system Ax b we often do not know A and b exactly, but have only approxmatons  and ˆb avalable. Then the best thng we can do s to solve ˆx ˆb exactly whch
More informationAPPENDIX A Some Linear Algebra
APPENDIX A Some Lnear Algebra The collecton of m, n matrces A.1 Matrces a 1,1,..., a 1,n A = a m,1,..., a m,n wth real elements a,j s denoted by R m,n. If n = 1 then A s called a column vector. Smlarly,
More informationSupport Vector Machines
CS 2750: Machne Learnng Support Vector Machnes Prof. Adrana Kovashka Unversty of Pttsburgh February 17, 2016 Announcement Homework 2 deadlne s now 2/29 We ll have covered everythng you need today or at
More informationChapter Newton s Method
Chapter 9. Newton s Method After readng ths chapter, you should be able to:. Understand how Newton s method s dfferent from the Golden Secton Search method. Understand how Newton s method works 3. Solve
More informationSection 8.3 Polar Form of Complex Numbers
80 Chapter 8 Secton 8 Polar Form of Complex Numbers From prevous classes, you may have encountered magnary numbers the square roots of negatve numbers and, more generally, complex numbers whch are the
More informationSupport Vector Machines CS434
Support Vector Machnes CS434 Lnear Separators Many lnear separators exst that perfectly classfy all tranng examples Whch of the lnear separators s the best? + + + + + + + + + Intuton of Margn Consder ponts
More informationStatistics for Economics & Business
Statstcs for Economcs & Busness Smple Lnear Regresson Learnng Objectves In ths chapter, you learn: How to use regresson analyss to predct the value of a dependent varable based on an ndependent varable
More informationIntro to Visual Recognition
CS 2770: Computer Vson Intro to Vsual Recognton Prof. Adrana Kovashka Unversty of Pttsburgh February 13, 2018 Plan for today What s recognton? a.k.a. classfcaton, categorzaton Support vector machnes Separable
More informationNumerical Heat and Mass Transfer
Master degree n Mechancal Engneerng Numercal Heat and Mass Transfer 06-Fnte-Dfference Method (One-dmensonal, steady state heat conducton) Fausto Arpno f.arpno@uncas.t Introducton Why we use models and
More informationClassification as a Regression Problem
Target varable y C C, C,, ; Classfcaton as a Regresson Problem { }, 3 L C K To treat classfcaton as a regresson problem we should transform the target y nto numercal values; The choce of numercal class
More informationNeural networks. Nuno Vasconcelos ECE Department, UCSD
Neural networs Nuno Vasconcelos ECE Department, UCSD Classfcaton a classfcaton problem has two types of varables e.g. X - vector of observatons (features) n the world Y - state (class) of the world x X
More informationMAXIMUM A POSTERIORI TRANSDUCTION
MAXIMUM A POSTERIORI TRANSDUCTION LI-WEI WANG, JU-FU FENG School of Mathematcal Scences, Peng Unversty, Bejng, 0087, Chna Center for Informaton Scences, Peng Unversty, Bejng, 0087, Chna E-MIAL: {wanglw,
More informationA Bayes Algorithm for the Multitask Pattern Recognition Problem Direct Approach
A Bayes Algorthm for the Multtask Pattern Recognton Problem Drect Approach Edward Puchala Wroclaw Unversty of Technology, Char of Systems and Computer etworks, Wybrzeze Wyspanskego 7, 50-370 Wroclaw, Poland
More informationC4B Machine Learning Answers II. = σ(z) (1 σ(z)) 1 1 e z. e z = σ(1 σ) (1 + e z )
C4B Machne Learnng Answers II.(a) Show that for the logstc sgmod functon dσ(z) dz = σ(z) ( σ(z)) A. Zsserman, Hlary Term 20 Start from the defnton of σ(z) Note that Then σ(z) = σ = dσ(z) dz = + e z e z
More informationStanford University CS359G: Graph Partitioning and Expanders Handout 4 Luca Trevisan January 13, 2011
Stanford Unversty CS359G: Graph Parttonng and Expanders Handout 4 Luca Trevsan January 3, 0 Lecture 4 In whch we prove the dffcult drecton of Cheeger s nequalty. As n the past lectures, consder an undrected
More informationLecture 4: Universal Hash Functions/Streaming Cont d
CSE 5: Desgn and Analyss of Algorthms I Sprng 06 Lecture 4: Unversal Hash Functons/Streamng Cont d Lecturer: Shayan Oves Gharan Aprl 6th Scrbe: Jacob Schreber Dsclamer: These notes have not been subjected
More informationP R. Lecture 4. Theory and Applications of Pattern Recognition. Dept. of Electrical and Computer Engineering /
Theory and Applcatons of Pattern Recognton 003, Rob Polkar, Rowan Unversty, Glassboro, NJ Lecture 4 Bayes Classfcaton Rule Dept. of Electrcal and Computer Engneerng 0909.40.0 / 0909.504.04 Theory & Applcatons
More informationSparse Gaussian Processes Using Backward Elimination
Sparse Gaussan Processes Usng Backward Elmnaton Lefeng Bo, Lng Wang, and Lcheng Jao Insttute of Intellgent Informaton Processng and Natonal Key Laboratory for Radar Sgnal Processng, Xdan Unversty, X an
More informationSingular Value Decomposition: Theory and Applications
Sngular Value Decomposton: Theory and Applcatons Danel Khashab Sprng 2015 Last Update: March 2, 2015 1 Introducton A = UDV where columns of U and V are orthonormal and matrx D s dagonal wth postve real
More informationSolving Nonlinear Differential Equations by a Neural Network Method
Solvng Nonlnear Dfferental Equatons by a Neural Network Method Luce P. Aarts and Peter Van der Veer Delft Unversty of Technology, Faculty of Cvlengneerng and Geoscences, Secton of Cvlengneerng Informatcs,
More informationFUZZY GOAL PROGRAMMING VS ORDINARY FUZZY PROGRAMMING APPROACH FOR MULTI OBJECTIVE PROGRAMMING PROBLEM
Internatonal Conference on Ceramcs, Bkaner, Inda Internatonal Journal of Modern Physcs: Conference Seres Vol. 22 (2013) 757 761 World Scentfc Publshng Company DOI: 10.1142/S2010194513010982 FUZZY GOAL
More informationSupport Vector Machines
Separatng boundary, defned by w Support Vector Machnes CISC 5800 Professor Danel Leeds Separatng hyperplane splts class 0 and class 1 Plane s defned by lne w perpendcular to plan Is data pont x n class
More informationMining Phenotypes and Informative Genes from Gene Expression Data
Mnng Phenotypes and Informatve enes from ene Expresson Data Chun Tang Adong Zhang and Jan Pe Department of Computer cence and Engneerng tate Unversty of New York at Buffalo cdna Mcroarray Experment http://www.pam.ucla.edu/programs/fg2000/fgt_speed7.ppt
More informationAssortment Optimization under MNL
Assortment Optmzaton under MNL Haotan Song Aprl 30, 2017 1 Introducton The assortment optmzaton problem ams to fnd the revenue-maxmzng assortment of products to offer when the prces of products are fxed.
More informationThe Geometry of Logit and Probit
The Geometry of Logt and Probt Ths short note s meant as a supplement to Chapters and 3 of Spatal Models of Parlamentary Votng and the notaton and reference to fgures n the text below s to those two chapters.
More informationStatistical machine learning and its application to neonatal seizure detection
19/Oct/2009 Statstcal machne learnng and ts applcaton to neonatal sezure detecton Presented by Andry Temko Department of Electrcal and Electronc Engneerng Page 2 of 42 A. Temko, Statstcal Machne Learnng
More informationDifference Equations
Dfference Equatons c Jan Vrbk 1 Bascs Suppose a sequence of numbers, say a 0,a 1,a,a 3,... s defned by a certan general relatonshp between, say, three consecutve values of the sequence, e.g. a + +3a +1
More informationBounds on the Generalization Performance of Kernel Machines Ensembles
Bounds on the Generalzaton Performance of Kernel Machnes Ensembles Theodoros Evgenou theos@a.mt.edu Lus Perez-Breva lpbreva@a.mt.edu Massmlano Pontl pontl@a.mt.edu Tomaso Poggo tp@a.mt.edu Center for Bologcal
More information1 Matrix representations of canonical matrices
1 Matrx representatons of canoncal matrces 2-d rotaton around the orgn: ( ) cos θ sn θ R 0 = sn θ cos θ 3-d rotaton around the x-axs: R x = 1 0 0 0 cos θ sn θ 0 sn θ cos θ 3-d rotaton around the y-axs:
More informationEcon107 Applied Econometrics Topic 3: Classical Model (Studenmund, Chapter 4)
I. Classcal Assumptons Econ7 Appled Econometrcs Topc 3: Classcal Model (Studenmund, Chapter 4) We have defned OLS and studed some algebrac propertes of OLS. In ths topc we wll study statstcal propertes
More informationThe Expectation-Maximization Algorithm
The Expectaton-Maxmaton Algorthm Charles Elan elan@cs.ucsd.edu November 16, 2007 Ths chapter explans the EM algorthm at multple levels of generalty. Secton 1 gves the standard hgh-level verson of the algorthm.
More informationStatistical Foundations of Pattern Recognition
Statstcal Foundatons of Pattern Recognton Learnng Objectves Bayes Theorem Decson-mang Confdence factors Dscrmnants The connecton to neural nets Statstcal Foundatons of Pattern Recognton NDE measurement
More informationAPPROXIMATE PRICES OF BASKET AND ASIAN OPTIONS DUPONT OLIVIER. Premia 14
APPROXIMAE PRICES OF BASKE AND ASIAN OPIONS DUPON OLIVIER Prema 14 Contents Introducton 1 1. Framewor 1 1.1. Baset optons 1.. Asan optons. Computng the prce 3. Lower bound 3.1. Closed formula for the prce
More information