Support Vector Machines
|
|
- Kory Logan
- 5 years ago
- Views:
Transcription
1 Support Vector Machnes Some sldes adapted from Alfers & Tsamardnos, Vanderblt Unversty d/ndex.html Rong Jn, Language Technology Insttute ABDBM Ron Shamr 1
2 Support Vector Machnes Decson surface: a hyperplane n feature space One of the most mportant tools n the machne learnng toolbox In a nutshell: map the data to a predetermned very hghdmensonal space va a kernel functon Fnd the hyperplane that maxmzes the margn between the two classes If data are not separable - fnd the hyperplane that maxmzes the margn and mnmzes the (weghted average of the) msclassfcatons ABDBM Ron Shamr 2
3 Support Vector Machnes Three man deas: 1. Defne what an optmal hyperplane s (takng nto account that t needs to be computed effcently): maxmze margn 2. Generalze to non-lnearly separable problems: have a penalty term for msclassfcatons 3. Map data to hgh dmensonal space where t s easer to classfy wth lnear decson surfaces: reformulate problem so that data are mapped mplctly to ths space ABDBM Ron Shamr 3
4 Support Vector Machnes Three man deas: 1. Defne what an optmal hyperplane s (takng nto account that t needs to be computed effcently): maxmze margn 2. Generalze to non-lnearly separable problems: have a penalty term for msclassfcatons 3. Map data to hgh dmensonal space where t s easer to classfy wth lnear decson surfaces: reformulate problem so that data are mapped mplctly to ths space ABDBM Ron Shamr 4
5 Whch Separatng Hyperplane Var 1 to Use? ABDBM Ron Shamr Var 2 5
6 Maxmzng the Margn Var 1 IDEA 1: Select the separatng hyperplane that maxmzes the margn! Margn Wdth Margn Wdth ABDBM Ron Shamr Var 2 6
7 Support Vectors Var 1 Support Vectors Margn Wdth ABDBM Ron Shamr Var 2 7
8 Settng Up the Optmzaton Problem Var 1 The wdth of the margn s: 2 k w w x b k k k w x w x b k b 0 Var 2 w So, the problem s: 2 k max w s. t. ( w x b) k, x of class 1 ( w x b) k, x of class 2 ABDBM Ron Shamr 8
9 Settng Up the Optmzaton Problem Var 1 Scalng w, b so that k=1, the problem becomes: w w x b w x w x b 1 b 0 Var 2 2 max w s. t. ( w x b) 1, x of class 1 ( w x b) 1, x of class 2 ABDBM Ron Shamr 9
10 Settng Up the Optmzaton Problem If class 1 corresponds to 1 and class 2 corresponds to -1, we can rewrte ( w x b) 1, x wth y 1 ( w x b) 1, x wth y 1 as y ( w x b) 1, x So the problem becomes: max 2 w s. t. y ( w x b) 1, x or 1 2 mn w 2 s. t. y ( w x b) 1, x ABDBM Ron Shamr 10
11 Lnear, Hard-Margn SVM Formulaton Fnd w,b that solve 1 2 mn w 2 s. t. y ( w x b) 1, x Quadratc program: quadratc objectve, lnear (n)equalty constrants Problem s convex there s a unque global mnmum value (when feasble) There s also a unque mnmzer,.e. w and b values that provde the mnmum No soluton f the data are not lnearly separable Objectve s PD polynomal-tme soln Very effcent soln wth modern optmzaton software (handles 1000s of constrants and tranng nstances). ABDBM Ron Shamr 11
12 Lagrange multplers Mnmze s. t. 1 w, b, ( w) 0,..., 0 l 1 2 w 2 y ( w x b) Convex quadratc programmng problem Dualty theory apples! ABDBM Ron Shamr 12
13 13 Dual Space Dual Problem Representaton for w Decson functon j j j n l y y D y y y D F x x y Λ Λ y Λ Λ Λ Λ Λ ),,...,, ( ),,...,, ( where 0 0 subject to ) ( Maxmze ) ) ( ( ) ( 1 l y b sgn f x x x l y 1 x w ABDBM Ron Shamr
14 Comments Representaton of vector w Lnear combnaton of examples x # parameters = # examples : the mportance of each examples Only the ponts closest to the bound have 0 Core of the algorthm: xx Both matrx D and decson functon requre the knowledge of xx (More on ths soon) w l D j 1 y y y j x x x j ABDBM Ron Shamr 14
15 Support Vector Machnes Three man deas: 1. Defne what an optmal hyperplane s (takng nto account that t needs to be computed effcently): maxmze margn 2. Generalze to non-lnearly separable problems: have a penalty term for msclassfcatons 3. Map data to hgh dmensonal space where t s easer to classfy wth lnear decson surfaces: reformulate problem so that data are mapped mplctly to ths space ABDBM Ron Shamr 15
16 Non-Lnearly Separable Data Var 1 Introduce slack varables w j w x b 1 Allow some nstances to fall wthn the margn, but penalze them w x b w x b 0 Var 2 ABDBM Ron Shamr 16
17 Formulatng the Optmzaton Problem Constrant becomes : Var 1 y ( w x b) 1, x 0 w w x b 1 ABDBM Ron Shamr j 1 1 w x w x b 1 b 0 Var 2 Objectve functon penalzes for msclassfed nstances and those wthn the margn 1 mn 2 C trades-off margn wdth & msclassfcatons 2 w C 17
18 Lnear, Soft-Margn SVMs 1 mn 2 2 w C y ( w x b) 1, x 0 Algorthm tres to keep at zero whle maxmzng margn Alg does not mnmze the no. of msclassfcatons (NP-complete problem) but the sum of dstances from the margn hyperplanes Other formulatons use 2 nstead C: penalty for msclassfcaton As C, we get closer to the hard-margn soluton ABDBM Ron Shamr 18
19 19 Dual Space j j j n l y y D y y y C D F x x y Λ 1 Λ Λ y Λ Λ Λ Λ Λ ),,...,, ( ),,...,, ( where 0 0 subject to ) ( Maxmze ) ) ( ( ) ( 1 l y b sgn f x x x l y 1 x w Dual Problem Only dfference: upper bound C on Representaton for w Decson functon ABDBM Ron Shamr
20 Param C Comments Controls the range of avods over emphaszng some examples (C - ) = 0 ( complementary slackness ) C can be extended to be case-dependent Weght < C = 0 -th example s correctly classfed not qute mportant = C can be nonzero -th tranng example may be msclassfed very mportant ABDBM Ron Shamr 20
21 Robustness of Soft vs Hard Margn SVMs Var 1 Var 1 Soft Margn SVM w x b 0 Var 2 w x b 0 Hard Margn SVM Var 2 ABDBM Ron Shamr 21
22 Soft vs Hard Margn SVM Soft-Margn always has a soluton Soft-Margn s more robust to outlers Smoother surfaces (n the non-lnear case) Hard-Margn does not requre to guess the cost parameter (requres no parameters at all) ABDBM Ron Shamr 22
23 Support Vector Machnes Three man deas: 1. Defne what an optmal hyperplane s (takng nto account that t needs to be computed effcently): maxmze margn 2. Generalze to non-lnearly separable problems: have a penalty term for msclassfcatons 3. Map data to hgh dmensonal space where t s easer to classfy wth lnear decson surfaces: reformulate problem so that data are mapped mplctly to ths space ABDBM Ron Shamr 23
24 Dsadvantages of Lnear Decson Surfaces Var 1 ABDBM Ron Shamr Var 2 24
25 Advantages of Non-Lnear Surfaces Var 1 ABDBM Ron Shamr Var 2 25
26 Lnear Classfers n Hgh- Dmensonal Spaces Var 1 Constructed Feature 2 Var 2 Constructed Feature 1 Fnd functon (x) to map to a dfferent space ABDBM Ron Shamr 26
27 Mappng Data to a Hgh- Dmensonal Space Fnd functon (x) to map to a dfferent space, then SVM formulaton becomes: 1 mn 2 2 w C s. t. y ( w( x ) b) 1, x 0 Data appear as (x), weghts w are now weghts n the new space Explct mappng expensve f (x) s very hgh dmensonal Can we solve the problem wthout explctly mappng the data? ABDBM Ron Shamr 27
28 The Dual of the SVM Formulaton Orgnal SVM formulaton n nequalty constrants n postvty constrants n number of varables The (Wolfe) dual of ths problem one equalty constrant n postvty constrants n number of varables (Lagrange multplers) Objectve functon more complcated But: Data only appear as (x ) (x j ) 1 mn 2 s. t. 0 1 mn w, b 2 a, j y ( w ( x) b) 1, x s t. w y 2. C C 0, x y 0 j y j ( ( x ) ( x j )) ABDBM Ron Shamr 28
29 The Kernel Trck (x ) t (x j ) means: map data nto new space, then take the nner product of the new vectors Suppose we can fnd a functon such that: K(x, x j ) = (x ) t (x j ),.e., K s the nner product of the mages of the data For tranng, no need to explctly map the data nto the hgh-dmensonal space to solve the optmzaton problem How do we classfy wthout explctly mappng the new nstances? Turns out sgn( wx b) sgn( where b solves ( y for any j wth j j 0 j y K( x y K( x, x) b), x j ) b 1) 0, ABDBM Ron Shamr 29
30 Examples of Kernels Assume we measure x 1,x 2 mappng: Consder the functon: Then: and we use the : x, x { x, x, 2 x x, 2 x, 2 x,1} φ x t φ z = x 1 2 z x 2 2 z x 1 x 2 z 1 z 2 + 2x 1 z 1 + 2x 2 z = x 1 z 1 + x 2 z = x z = K(x, z) 1 K( x, z) ( x z 1) 2 ABDBM Ron Shamr 30
31 Polynomal and Gaussan Kernels K ( x, z) ( x z 1) s called the polynomal kernel of degree p. For p=2, wth 7,000 genes usng the kernel once: nner product wth 7,000 terms, squarng Mappng explctly to the hgh-dmensonal space: calculatng ~50,000,000 new features for both tranng nstances, then takng the nner product of that (another 50,000,000 terms to sum) In general, usng the Kernel trck provdes huge computatonal savngs over explct mappng! Another common opton: Gaussan kernel (maps to l dmensonal space wth l=no of tranng ponts): K( x, z) exp( x z p 2 / 2 ) ABDBM Ron Shamr 31
32 The Mercer Condton Is there a mappng (x) for any symmetrc functon K(x,z)? No The SVM dual formulaton requres calculaton K(x, x j ) for each par of tranng nstances. The matrx G j = K(x,x j ) s called the Gram matrx Theorem (Mercer 1908): There s a feature space (x) ff the Kernel s such that G s postve-sem defnte Recall: M PSD ff z 0 z T Mz>0 ff M has non-negatve egenvalues ABDBM Ron Shamr 32
33 Support Vector Machnes Three man deas: 1. Defne what an optmal hyperplane s (takng nto account that t needs to be computed effcently): maxmze margn 2. Generalze to non-lnearly separable problems: have a penalty term for msclassfcatons 3. Map data to hgh dmensonal space where t s easer to classfy wth lnear decson surfaces: reformulate problem so that data are mapped mplctly to ths space ABDBM Ron Shamr 33
34 Complexty (for one mplementaton, Burges 98) Notaton: l tranng pts of dmenson d, N support vectors (Nl) When most SVs are not at the upper bound: O(N 3 +N 2 l+ndl) f N<<l O(N 3 +nl+ndl) f N~l When most SVs are at the upper bound: O(N 2 + Ndl) f N<<l O(dl 2 ) f N~l ABDBM Ron Shamr 34
35 Other Types of Kernel Methods SVMs that perform regresson SVMs that perform clusterng -Support Vector Machnes: maxmze margn whle boundng the number of margn errors Leave One Out Machnes: mnmze the bound of the leave-one-out error SVM formulatons that allow dfferent cost of msclassfcaton for dfferent classes Kernels sutable for sequences of strngs, or other specalzed kernels ABDBM Ron Shamr 35
36 Feature Selecton wth SVMs Recursve Feature Elmnaton Tran a lnear SVM Remove the x% of varables wth the lowest weghts (those varables affect classfcaton the least) Retran the SVM wth remanng varables and repeat untl classfcaton qualty s reduced Very successful Other formulatons exst where mnmzng the number of varables s folded nto the optmzaton problem Smlar algs for non-lnear SVMs Qute successful ABDBM Ron Shamr 36
37 Why do SVMs Generalze? Even though they map to a very hgh-dmensonal space They have a very strong bas n that space The soluton has to be a lnear combnaton of the tranng nstances Large theory on Structural Rsk Mnmzaton provdng bounds on the error of an SVM Typcally the error bounds too loose to be of practcal use ABDBM Ron Shamr 37
38 Conclusons SVMs formulate learnng as a mathematcal program takng advantage of the rch theory n optmzaton SVM uses kernels to map ndrectly to extremely hgh dmensonal spaces SVMs are extremely successful, robust, effcent, and versatle, and have a good theoretcal bass ABDBM Ron Shamr 39
39 Vladmr Vapnk Vladmr Naumovch Vapnk s one of the man developers of Vapnk Chervonenks theory. He was born n the Sovet Unon. He receved hs master's degree n mathematcs at the Uzbek State Unversty, Samarkand, Uzbek SSR n 1958 and Ph.D n statstcs at the Insttute of Control Scences, Moscow n He worked at ths nsttute from 1961 to 1990 and became Head of the Computer Scence Research Department. At the end of 1990, he moved to the USA and joned the Adaptve Systems Research Department at AT&T Bell Labs n Holmdel, New Jersey. The group later became the Image Processng Research Department of AT&T Laboratores when AT&T spun off Lucent Technologes n Vapnk Left AT&T n 2002 and joned NEC Laboratores n Prnceton, New Jersey, where he currently works n the Machne Learnng group. He also holds a Professor of Computer Scence and Statstcs poston at Royal Holloway, Unversty of London snce 1995, as well as an Adjunct Professor poston at Columba Unversty, New York Cty snce He was nducted nto the U.S. Natonal Academy of Engneerng n He receved the 2008 Pars Kanellaks Award. Whle at AT&T, Vapnk and hs colleagues developed the theory of the support vector machne. They demonstrated ts performance on a number of problems of nterest to the machne learnng communty, ncludng handwrtng recognton ABDBM Ron Shamr
40 Suggested Further Readng many tutorals C. J. C. Burges. "A Tutoral on Support Vector Machnes for Pattern Recognton." Knowledge Dscovery and Data Mnng, 2(2), E. Osuna, R. Freund, and F. Gros. "Support vector machnes: Tranng and applcatons." Techncal Report AIM-1602, MIT A.I. Lab., P.H. Chen, C.-J. Ln, and B. Schölkopf. A tutoral on nu -support vector machnes N. Crstann. ICML'01 tutoral, K.-R. Müller, S. Mka, G. Rätsch, K. Tsuda, and B. Schölkopf. An ntroducton to kernel-based learnng algorthms. IEEE Neural Networks, 12(2): , May (PDF) B. Schölkopf. SVM and kernel methods, Tutoral gven at the NIPS Conference. Haste, Tbshran, Fredman, The Elements of Statstcal Learnng, Sprngel 2001 ABDBM Ron Shamr 41
41 Analyss of mcroarray GE data usng SVM Brown, Grundy, Ln, Crstann, Sugnet, Furey, Ares Jr., Haussler PNAS 97(1) (2000) ABDBM Ron Shamr 42
42 Data Expresson patterns of n=2467 annotated yeast genes over m=79 dfferent condtons Sx gene functonal classes: 5 related to transcrpt levels, trcarboxylc acd (TCA) cycle, respraton, cytoplasmc rbosomes, proteasome, hstones, and 1 unrelated (control) helx-turn-helx protens. For gene x, condton : E level of x n tested condton R level of x n reference condton Normalzed pattern (X 1,,X m ) of gene x: X = log(e /R )/( k log 2 (E k /R k )) 0.5 ABDBM Ron Shamr 43
43 Goal Classfy genes based on gene expresson Tred SVM and other classfers 1/ w ABDBM Ron Shamr 44
44 Kernel functons used Smplest : K(X,Y)=X Y+1 (dot product; lnear kernel) Kernel of degree d: K(X,Y)=(X Y+1) d Radal bass (Gaussan) kernel: exp(- X-Y 2 /2 2 ) n + / n - : no. of postve / negatve examples Problem: n + << n - Overcomng mbalance: modfy K s dagonal: K j =K(X,X j )+c/n + for postve ex, K j =K(X,X j )+c/n - for negatve ex ABDBM Ron Shamr 48
45 Measurng performance True Classfer TP FP - FN TN The mbalance problem: very few postves Performance of method M: C(M) =FP+2FN C(N) = cost of classfyng all as negatves S(M) =C(N)-C(M) (how much we save by the classfer). 3-way cross valdaton: 2/3 learn, 1/3 test ABDBM Ron Shamr 49
46 Results TCA class Method FP FN TP TN S(M) D-p-1-SVM ,432 6 D-p-2-SVM ,443 9 D-p-3-SVM , Radal-SVM , Parzen ,446 6 FLD ,441 5 C ,443-7 MOC ,446-1 D-p--SVM: dot product kernel, degree Other methods used: Parzen wndows, Fsher lnear dscrmnant, C4.5+MOC1: decson trees ABDBM Ron Shamr 50
47 Results: Rbo Class Method FP FN TP TN S(M) D-p-1-SVM , D-p-2-SVM , D-p-3-SVM , Radal-SVM , Parzen , FLD , C , MOC , ABDBM Ron Shamr 51
48 Results: Summary SVM outperformed the other methods Ether hgh-dm dot-product or Gaussan kernels worked best Insenstve to specfc cost weghtng Consstently msclassfed genes requre specal attenton Does not always reflect proten levels and post-translatonal modfcatons Can use classfers for functonal annotaton ABDBM Ron Shamr 52
49 Davd Haussler ABDBM Ron Shamr 53
50 Gene Selecton va the BAHSIC Famly of Algorthms Le Song, Justn Bedo, Karsten M. Borgwardt, Arthur Gretton, Alex Smola ISMB 07 ABDBM Ron Shamr 54
51 Testng 15 two-class datasets (mostly cancer), 2K-25K genes, samples 10-fold cross valdaton Selected the 10 top features accordng to each method pc=pearson s correlaton, snr=sgnal-to-nose rato, pam=shrunken centrod, t=t-statstcs, m-t = moderated t- statstcs, lods=b-statstcs, ln=centrod, RBF= SVM w Gaussan kernel, rfe=svm recursve feature elmnaton, l1=l 1 norm SVM, m=mutual nformaton) Selecton method: RFE: Tran, remove 10% of features that are least relevant, repeat. ABDBM Ron Shamr 55
52 Classfcaton error % Overlap btw the 10 genes selected n each fold Lnear kernel has best overall performance L2 dst from best 56 # tmes alg was best ABDBM Ron Shamr
53 Multclass datasets In a smlar comparson on 13 multclass datasets, lnear kernel was agan best. ABDBM Ron Shamr 58
54 Rules of thumb Always apply the lnear kernel for general purpose gene selecton Apply a Gaussan Kernel f nonlnear effects are present, such as multmodalty or complementary effects of dfferent genes Not a bg surprse, gven the hgh dmenson of mcroarray datasets, but pont drven home by broad expermentaton. ABDBM Ron Shamr 59
Support Vector Machines
Support Vector Machnes Decson surface s a hyperplane (lne n 2D) n feature space (smlar to the Perceptron) Arguably, the most mportant recent dscovery n machne learnng In a nutshell: map the data to a predetermned
More informationMachine Learning. Support Vector Machines. (contains material adapted from talks by Constantin F. Aliferis & Ioannis Tsamardinos, and Martin Law)
Machne Learnng Support Vector Machnes (contans materal adapted from talks by Constantn F. Alfers & Ioanns Tsamardnos, and Martn Law) Bryan Pardo, Machne Learnng: EECS 349 Fall 2014 Support Vector Machnes
More informationSupport Vector Machines
/9/207 MIST.6060 Busness Intellgence and Data Mnng What are Support Vector Machnes? Support Vector Machnes Support Vector Machnes (SVMs) are supervsed learnng technques that analyze data and recognze patterns.
More informationClassification / Regression Support Vector Machines
Classfcaton / Regresson Support Vector Machnes Jeff Howbert Introducton to Machne Learnng Wnter 04 Topcs SVM classfers for lnearly separable classes SVM classfers for non-lnearly separable classes SVM
More information12/2/2009. Announcements. Parametric / Non-parametric. Case-Based Reasoning. Nearest-Neighbor on Images. Nearest-Neighbor Classification
Introducton to Artfcal Intellgence V22.0472-001 Fall 2009 Lecture 24: Nearest-Neghbors & Support Vector Machnes Rob Fergus Dept of Computer Scence, Courant Insttute, NYU Sldes from Danel Yeung, John DeNero
More informationOutline. Discriminative classifiers for image recognition. Where in the World? A nearest neighbor recognition example 4/14/2011. CS 376 Lecture 22 1
4/14/011 Outlne Dscrmnatve classfers for mage recognton Wednesday, Aprl 13 Krsten Grauman UT-Austn Last tme: wndow-based generc obect detecton basc ppelne face detecton wth boostng as case study Today:
More informationAnnouncements. Supervised Learning
Announcements See Chapter 5 of Duda, Hart, and Stork. Tutoral by Burge lnked to on web page. Supervsed Learnng Classfcaton wth labeled eamples. Images vectors n hgh-d space. Supervsed Learnng Labeled eamples
More informationCHAPTER 3 SEQUENTIAL MINIMAL OPTIMIZATION TRAINED SUPPORT VECTOR CLASSIFIER FOR CANCER PREDICTION
48 CHAPTER 3 SEQUENTIAL MINIMAL OPTIMIZATION TRAINED SUPPORT VECTOR CLASSIFIER FOR CANCER PREDICTION 3.1 INTRODUCTION The raw mcroarray data s bascally an mage wth dfferent colors ndcatng hybrdzaton (Xue
More informationLearning the Kernel Parameters in Kernel Minimum Distance Classifier
Learnng the Kernel Parameters n Kernel Mnmum Dstance Classfer Daoqang Zhang 1,, Songcan Chen and Zh-Hua Zhou 1* 1 Natonal Laboratory for Novel Software Technology Nanjng Unversty, Nanjng 193, Chna Department
More informationSupport Vector Machines. CS534 - Machine Learning
Support Vector Machnes CS534 - Machne Learnng Perceptron Revsted: Lnear Separators Bnar classfcaton can be veed as the task of separatng classes n feature space: b > 0 b 0 b < 0 f() sgn( b) Lnear Separators
More informationGSLM Operations Research II Fall 13/14
GSLM 58 Operatons Research II Fall /4 6. Separable Programmng Consder a general NLP mn f(x) s.t. g j (x) b j j =. m. Defnton 6.. The NLP s a separable program f ts objectve functon and all constrants are
More informationFace Recognition University at Buffalo CSE666 Lecture Slides Resources:
Face Recognton Unversty at Buffalo CSE666 Lecture Sldes Resources: http://www.face-rec.org/algorthms/ Overvew of face recognton algorthms Correlaton - Pxel based correspondence between two face mages Structural
More informationEdge Detection in Noisy Images Using the Support Vector Machines
Edge Detecton n Nosy Images Usng the Support Vector Machnes Hlaro Gómez-Moreno, Saturnno Maldonado-Bascón, Francsco López-Ferreras Sgnal Theory and Communcatons Department. Unversty of Alcalá Crta. Madrd-Barcelona
More informationUsing Neural Networks and Support Vector Machines in Data Mining
Usng eural etworks and Support Vector Machnes n Data Mnng RICHARD A. WASIOWSKI Computer Scence Department Calforna State Unversty Domnguez Hlls Carson, CA 90747 USA Abstract: - Multvarate data analyss
More informationSmoothing Spline ANOVA for variable screening
Smoothng Splne ANOVA for varable screenng a useful tool for metamodels tranng and mult-objectve optmzaton L. Rcco, E. Rgon, A. Turco Outlne RSM Introducton Possble couplng Test case MOO MOO wth Game Theory
More informationMachine Learning 9. week
Machne Learnng 9. week Mappng Concept Radal Bass Functons (RBF) RBF Networks 1 Mappng It s probably the best scenaro for the classfcaton of two dataset s to separate them lnearly. As you see n the below
More informationDiscriminative classifiers for object classification. Last time
Dscrmnatve classfers for object classfcaton Thursday, Nov 12 Krsten Grauman UT Austn Last tme Supervsed classfcaton Loss and rsk, kbayes rule Skn color detecton example Sldng ndo detecton Classfers, boostng
More informationCS246: Mining Massive Datasets Jure Leskovec, Stanford University
CS46: Mnng Massve Datasets Jure Leskovec, Stanford Unversty http://cs46.stanford.edu /19/013 Jure Leskovec, Stanford CS46: Mnng Massve Datasets, http://cs46.stanford.edu Perceptron: y = sgn( x Ho to fnd
More informationThe Research of Support Vector Machine in Agricultural Data Classification
The Research of Support Vector Machne n Agrcultural Data Classfcaton Le Sh, Qguo Duan, Xnmng Ma, Me Weng College of Informaton and Management Scence, HeNan Agrcultural Unversty, Zhengzhou 45000 Chna Zhengzhou
More informationFeature Reduction and Selection
Feature Reducton and Selecton Dr. Shuang LIANG School of Software Engneerng TongJ Unversty Fall, 2012 Today s Topcs Introducton Problems of Dmensonalty Feature Reducton Statstc methods Prncpal Components
More informationSubspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points;
Subspace clusterng Clusterng Fundamental to all clusterng technques s the choce of dstance measure between data ponts; D q ( ) ( ) 2 x x = x x, j k = 1 k jk Squared Eucldean dstance Assumpton: All features
More informationClassifier Selection Based on Data Complexity Measures *
Classfer Selecton Based on Data Complexty Measures * Edth Hernández-Reyes, J.A. Carrasco-Ochoa, and J.Fco. Martínez-Trndad Natonal Insttute for Astrophyscs, Optcs and Electroncs, Lus Enrque Erro No.1 Sta.
More informationIncremental Learning with Support Vector Machines and Fuzzy Set Theory
The 25th Workshop on Combnatoral Mathematcs and Computaton Theory Incremental Learnng wth Support Vector Machnes and Fuzzy Set Theory Yu-Mng Chuang 1 and Cha-Hwa Ln 2* 1 Department of Computer Scence and
More informationA Modified Median Filter for the Removal of Impulse Noise Based on the Support Vector Machines
A Modfed Medan Flter for the Removal of Impulse Nose Based on the Support Vector Machnes H. GOMEZ-MORENO, S. MALDONADO-BASCON, F. LOPEZ-FERRERAS, M. UTRILLA- MANSO AND P. GIL-JIMENEZ Departamento de Teoría
More informationKent State University CS 4/ Design and Analysis of Algorithms. Dept. of Math & Computer Science LECT-16. Dynamic Programming
CS 4/560 Desgn and Analyss of Algorthms Kent State Unversty Dept. of Math & Computer Scence LECT-6 Dynamc Programmng 2 Dynamc Programmng Dynamc Programmng, lke the dvde-and-conquer method, solves problems
More informationMachine Learning: Algorithms and Applications
14/05/1 Machne Learnng: Algorthms and Applcatons Florano Zn Free Unversty of Bozen-Bolzano Faculty of Computer Scence Academc Year 011-01 Lecture 10: 14 May 01 Unsupervsed Learnng cont Sldes courtesy of
More informationBOOSTING CLASSIFICATION ACCURACY WITH SAMPLES CHOSEN FROM A VALIDATION SET
1 BOOSTING CLASSIFICATION ACCURACY WITH SAMPLES CHOSEN FROM A VALIDATION SET TZU-CHENG CHUANG School of Electrcal and Computer Engneerng, Purdue Unversty, West Lafayette, Indana 47907 SAUL B. GELFAND School
More informationNUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS
ARPN Journal of Engneerng and Appled Scences 006-017 Asan Research Publshng Network (ARPN). All rghts reserved. NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS Igor Grgoryev, Svetlana
More informationParallelism for Nested Loops with Non-uniform and Flow Dependences
Parallelsm for Nested Loops wth Non-unform and Flow Dependences Sam-Jn Jeong Dept. of Informaton & Communcaton Engneerng, Cheonan Unversty, 5, Anseo-dong, Cheonan, Chungnam, 330-80, Korea. seong@cheonan.ac.kr
More informationINF 4300 Support Vector Machine Classifiers (SVM) Anne Solberg
INF 43 Support Vector Machne Classfers (SVM) Anne Solberg (anne@f.uo.no) 9..7 Lnear classfers th mamum margn for toclass problems The kernel trck from lnear to a hghdmensonal generalzaton Generaton from
More informationLecture 5: Multilayer Perceptrons
Lecture 5: Multlayer Perceptrons Roger Grosse 1 Introducton So far, we ve only talked about lnear models: lnear regresson and lnear bnary classfers. We noted that there are functons that can t be represented
More informationS1 Note. Basis functions.
S1 Note. Bass functons. Contents Types of bass functons...1 The Fourer bass...2 B-splne bass...3 Power and type I error rates wth dfferent numbers of bass functons...4 Table S1. Smulaton results of type
More informationSolving two-person zero-sum game by Matlab
Appled Mechancs and Materals Onlne: 2011-02-02 ISSN: 1662-7482, Vols. 50-51, pp 262-265 do:10.4028/www.scentfc.net/amm.50-51.262 2011 Trans Tech Publcatons, Swtzerland Solvng two-person zero-sum game by
More informationTaxonomy of Large Margin Principle Algorithms for Ordinal Regression Problems
Taxonomy of Large Margn Prncple Algorthms for Ordnal Regresson Problems Amnon Shashua Computer Scence Department Stanford Unversty Stanford, CA 94305 emal: shashua@cs.stanford.edu Anat Levn School of Computer
More informationDiscriminative Dictionary Learning with Pairwise Constraints
Dscrmnatve Dctonary Learnng wth Parwse Constrants Humn Guo Zhuoln Jang LARRY S. DAVIS UNIVERSITY OF MARYLAND Nov. 6 th, Outlne Introducton/motvaton Dctonary Learnng Dscrmnatve Dctonary Learnng wth Parwse
More informationFace Recognition Based on SVM and 2DPCA
Vol. 4, o. 3, September, 2011 Face Recognton Based on SVM and 2DPCA Tha Hoang Le, Len Bu Faculty of Informaton Technology, HCMC Unversty of Scence Faculty of Informaton Scences and Engneerng, Unversty
More informationData Mining: Model Evaluation
Data Mnng: Model Evaluaton Aprl 16, 2013 1 Issues: Evaluatng Classfcaton Methods Accurac classfer accurac: predctng class label predctor accurac: guessng value of predcted attrbutes Speed tme to construct
More informationLECTURE : MANIFOLD LEARNING
LECTURE : MANIFOLD LEARNING Rta Osadchy Some sldes are due to L.Saul, V. C. Raykar, N. Verma Topcs PCA MDS IsoMap LLE EgenMaps Done! Dmensonalty Reducton Data representaton Inputs are real-valued vectors
More informationMulti-stable Perception. Necker Cube
Mult-stable Percepton Necker Cube Spnnng dancer lluson, Nobuuk Kaahara Fttng and Algnment Computer Vson Szelsk 6.1 James Has Acknowledgment: Man sldes from Derek Hoem, Lana Lazebnk, and Grauman&Lebe 2008
More informationCluster Analysis of Electrical Behavior
Journal of Computer and Communcatons, 205, 3, 88-93 Publshed Onlne May 205 n ScRes. http://www.scrp.org/ournal/cc http://dx.do.org/0.4236/cc.205.350 Cluster Analyss of Electrcal Behavor Ln Lu Ln Lu, School
More informationTN348: Openlab Module - Colocalization
TN348: Openlab Module - Colocalzaton Topc The Colocalzaton module provdes the faclty to vsualze and quantfy colocalzaton between pars of mages. The Colocalzaton wndow contans a prevew of the two mages
More informationSUMMARY... I TABLE OF CONTENTS...II INTRODUCTION...
Summary A follow-the-leader robot system s mplemented usng Dscrete-Event Supervsory Control methods. The system conssts of three robots, a leader and two followers. The dea s to get the two followers to
More informationEYE CENTER LOCALIZATION ON A FACIAL IMAGE BASED ON MULTI-BLOCK LOCAL BINARY PATTERNS
P.G. Demdov Yaroslavl State Unversty Anatoly Ntn, Vladmr Khryashchev, Olga Stepanova, Igor Kostern EYE CENTER LOCALIZATION ON A FACIAL IMAGE BASED ON MULTI-BLOCK LOCAL BINARY PATTERNS Yaroslavl, 2015 Eye
More informationMachine Learning. Topic 6: Clustering
Machne Learnng Topc 6: lusterng lusterng Groupng data nto (hopefully useful) sets. Thngs on the left Thngs on the rght Applcatons of lusterng Hypothess Generaton lusters mght suggest natural groups. Hypothess
More informationHuman Face Recognition Using Generalized. Kernel Fisher Discriminant
Human Face Recognton Usng Generalzed Kernel Fsher Dscrmnant ng-yu Sun,2 De-Shuang Huang Ln Guo. Insttute of Intellgent Machnes, Chnese Academy of Scences, P.O.ox 30, Hefe, Anhu, Chna. 2. Department of
More informationTraining of Kernel Fuzzy Classifiers by Dynamic Cluster Generation
Tranng of Kernel Fuzzy Classfers by Dynamc Cluster Generaton Shgeo Abe Graduate School of Scence and Technology Kobe Unversty Nada, Kobe, Japan abe@eedept.kobe-u.ac.jp Abstract We dscuss kernel fuzzy classfers
More informationFace Recognition Method Based on Within-class Clustering SVM
Face Recognton Method Based on Wthn-class Clusterng SVM Yan Wu, Xao Yao and Yng Xa Department of Computer Scence and Engneerng Tong Unversty Shangha, Chna Abstract - A face recognton method based on Wthn-class
More informationSVM-based Learning for Multiple Model Estimation
SVM-based Learnng for Multple Model Estmaton Vladmr Cherkassky and Yunqan Ma Department of Electrcal and Computer Engneerng Unversty of Mnnesota Mnneapols, MN 55455 {cherkass,myq}@ece.umn.edu Abstract:
More informationLecture 4: Principal components
/3/6 Lecture 4: Prncpal components 3..6 Multvarate lnear regresson MLR s optmal for the estmaton data...but poor for handlng collnear data Covarance matrx s not nvertble (large condton number) Robustness
More informationHierarchical clustering for gene expression data analysis
Herarchcal clusterng for gene expresson data analyss Gorgo Valentn e-mal: valentn@ds.unm.t Clusterng of Mcroarray Data. Clusterng of gene expresson profles (rows) => dscovery of co-regulated and functonally
More informationEfficient Text Classification by Weighted Proximal SVM *
Effcent ext Classfcaton by Weghted Proxmal SVM * Dong Zhuang 1, Benyu Zhang, Qang Yang 3, Jun Yan 4, Zheng Chen, Yng Chen 1 1 Computer Scence and Engneerng, Bejng Insttute of echnology, Bejng 100081, Chna
More informationAngle-Independent 3D Reconstruction. Ji Zhang Mireille Boutin Daniel Aliaga
Angle-Independent 3D Reconstructon J Zhang Mrelle Boutn Danel Alaga Goal: Structure from Moton To reconstruct the 3D geometry of a scene from a set of pctures (e.g. a move of the scene pont reconstructon
More informationU.C. Berkeley CS294: Beyond Worst-Case Analysis Handout 5 Luca Trevisan September 7, 2017
U.C. Bereley CS294: Beyond Worst-Case Analyss Handout 5 Luca Trevsan September 7, 207 Scrbed by Haars Khan Last modfed 0/3/207 Lecture 5 In whch we study the SDP relaxaton of Max Cut n random graphs. Quc
More informationCollaboratively Regularized Nearest Points for Set Based Recognition
Academc Center for Computng and Meda Studes, Kyoto Unversty Collaboratvely Regularzed Nearest Ponts for Set Based Recognton Yang Wu, Mchhko Mnoh, Masayuk Mukunok Kyoto Unversty 9/1/013 BMVC 013 @ Brstol,
More informationAn Optimal Algorithm for Prufer Codes *
J. Software Engneerng & Applcatons, 2009, 2: 111-115 do:10.4236/jsea.2009.22016 Publshed Onlne July 2009 (www.scrp.org/journal/jsea) An Optmal Algorthm for Prufer Codes * Xaodong Wang 1, 2, Le Wang 3,
More informationRECOGNIZING GENDER THROUGH FACIAL IMAGE USING SUPPORT VECTOR MACHINE
Journal of Theoretcal and Appled Informaton Technology 30 th June 06. Vol.88. No.3 005-06 JATIT & LLS. All rghts reserved. ISSN: 99-8645 www.jatt.org E-ISSN: 87-395 RECOGNIZING GENDER THROUGH FACIAL IMAGE
More informationUnsupervised Learning
Pattern Recognton Lecture 8 Outlne Introducton Unsupervsed Learnng Parametrc VS Non-Parametrc Approach Mxture of Denstes Maxmum-Lkelhood Estmates Clusterng Prof. Danel Yeung School of Computer Scence and
More informationA Robust LS-SVM Regression
PROCEEDIGS OF WORLD ACADEMY OF SCIECE, EGIEERIG AD ECHOLOGY VOLUME 7 AUGUS 5 ISS 37- A Robust LS-SVM Regresson József Valyon, and Gábor Horváth Abstract In comparson to the orgnal SVM, whch nvolves a quadratc
More informationCS 534: Computer Vision Model Fitting
CS 534: Computer Vson Model Fttng Sprng 004 Ahmed Elgammal Dept of Computer Scence CS 534 Model Fttng - 1 Outlnes Model fttng s mportant Least-squares fttng Maxmum lkelhood estmaton MAP estmaton Robust
More informationOutline. Type of Machine Learning. Examples of Application. Unsupervised Learning
Outlne Artfcal Intellgence and ts applcatons Lecture 8 Unsupervsed Learnng Professor Danel Yeung danyeung@eee.org Dr. Patrck Chan patrckchan@eee.org South Chna Unversty of Technology, Chna Introducton
More informationOutline. Self-Organizing Maps (SOM) US Hebbian Learning, Cntd. The learning rule is Hebbian like:
Self-Organzng Maps (SOM) Turgay İBRİKÇİ, PhD. Outlne Introducton Structures of SOM SOM Archtecture Neghborhoods SOM Algorthm Examples Summary 1 2 Unsupervsed Hebban Learnng US Hebban Learnng, Cntd 3 A
More informationNetwork Intrusion Detection Based on PSO-SVM
TELKOMNIKA Indonesan Journal of Electrcal Engneerng Vol.1, No., February 014, pp. 150 ~ 1508 DOI: http://dx.do.org/10.11591/telkomnka.v1.386 150 Network Intruson Detecton Based on PSO-SVM Changsheng Xang*
More informationCategorizing objects: of appearance
Categorzng objects: global and part-based models of appearance UT Austn Generc categorzaton problem 1 Challenges: robustness Realstc scenes are crowded, cluttered, have overlappng objects. Generc category
More informationPolyhedral Compilation Foundations
Polyhedral Complaton Foundatons Lous-Noël Pouchet pouchet@cse.oho-state.edu Dept. of Computer Scence and Engneerng, the Oho State Unversty Feb 8, 200 888., Class # Introducton: Polyhedral Complaton Foundatons
More informationMULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION
MULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION Paulo Quntlano 1 & Antono Santa-Rosa 1 Federal Polce Department, Brasla, Brazl. E-mals: quntlano.pqs@dpf.gov.br and
More information5 The Primal-Dual Method
5 The Prmal-Dual Method Orgnally desgned as a method for solvng lnear programs, where t reduces weghted optmzaton problems to smpler combnatoral ones, the prmal-dual method (PDM) has receved much attenton
More informationThe Study of Remote Sensing Image Classification Based on Support Vector Machine
Sensors & Transducers 03 by IFSA http://www.sensorsportal.com The Study of Remote Sensng Image Classfcaton Based on Support Vector Machne, ZHANG Jan-Hua Key Research Insttute of Yellow Rver Cvlzaton and
More informationCMPSCI 670: Computer Vision! Object detection continued. University of Massachusetts, Amherst November 10, 2014 Instructor: Subhransu Maji
CMPSCI 670: Computer Vson! Object detecton contnued Unversty of Massachusetts, Amherst November 10, 2014 Instructor: Subhransu Maj No class on Wednesday Admnstrva Followng Tuesday s schedule ths Wednesday
More informationLecture #15 Lecture Notes
Lecture #15 Lecture Notes The ocean water column s very much a 3-D spatal entt and we need to represent that structure n an economcal way to deal wth t n calculatons. We wll dscuss one way to do so, emprcal
More informationComputer Vision. Pa0ern Recogni4on Concepts Part II. Luis F. Teixeira MAP- i 2012/13
Computer Vson Pa0ern Recogn4on Concepts Part II Lus F. Texera MAP- 2012/13 Last lecture The Bayes classfer yelds the op#mal decson rule f the pror and class- cond4onal dstrbu4ons are known. Ths s unlkely
More informationCLASSIFICATION OF ULTRASONIC SIGNALS
The 8 th Internatonal Conference of the Slovenan Socety for Non-Destructve Testng»Applcaton of Contemporary Non-Destructve Testng n Engneerng«September -3, 5, Portorož, Slovena, pp. 7-33 CLASSIFICATION
More informationLECTURE NOTES Duality Theory, Sensitivity Analysis, and Parametric Programming
CEE 60 Davd Rosenberg p. LECTURE NOTES Dualty Theory, Senstvty Analyss, and Parametrc Programmng Learnng Objectves. Revew the prmal LP model formulaton 2. Formulate the Dual Problem of an LP problem (TUES)
More informationClassification of Face Images Based on Gender using Dimensionality Reduction Techniques and SVM
Classfcaton of Face Images Based on Gender usng Dmensonalty Reducton Technques and SVM Fahm Mannan 260 266 294 School of Computer Scence McGll Unversty Abstract Ths report presents gender classfcaton based
More informationRecognizing Faces. Outline
Recognzng Faces Drk Colbry Outlne Introducton and Motvaton Defnng a feature vector Prncpal Component Analyss Lnear Dscrmnate Analyss !"" #$""% http://www.nfotech.oulu.f/annual/2004 + &'()*) '+)* 2 ! &
More informationAn AAM-based Face Shape Classification Method Used for Facial Expression Recognition
Internatonal Journal of Research n Engneerng and Technology (IJRET) Vol. 2, No. 4, 23 ISSN 2277 4378 An AAM-based Face Shape Classfcaton Method Used for Facal Expresson Recognton Lunng. L, Jaehyun So,
More informationSum of Linear and Fractional Multiobjective Programming Problem under Fuzzy Rules Constraints
Australan Journal of Basc and Appled Scences, 2(4): 1204-1208, 2008 ISSN 1991-8178 Sum of Lnear and Fractonal Multobjectve Programmng Problem under Fuzzy Rules Constrants 1 2 Sanjay Jan and Kalash Lachhwan
More informationThe Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique
//00 :0 AM Outlne and Readng The Greedy Method The Greedy Method Technque (secton.) Fractonal Knapsack Problem (secton..) Task Schedulng (secton..) Mnmum Spannng Trees (secton.) Change Money Problem Greedy
More informationUnsupervised Learning and Clustering
Unsupervsed Learnng and Clusterng Supervsed vs. Unsupervsed Learnng Up to now we consdered supervsed learnng scenaro, where we are gven 1. samples 1,, n 2. class labels for all samples 1,, n Ths s also
More informationImage Alignment CSC 767
Image Algnment CSC 767 Image algnment Image from http://graphcs.cs.cmu.edu/courses/15-463/2010_fall/ Image algnment: Applcatons Panorama sttchng Image algnment: Applcatons Recognton of object nstances
More informationNAG Fortran Library Chapter Introduction. G10 Smoothing in Statistics
Introducton G10 NAG Fortran Lbrary Chapter Introducton G10 Smoothng n Statstcs Contents 1 Scope of the Chapter... 2 2 Background to the Problems... 2 2.1 Smoothng Methods... 2 2.2 Smoothng Splnes and Regresson
More informationEvolutionary Support Vector Regression based on Multi-Scale Radial Basis Function Kernel
Eolutonary Support Vector Regresson based on Mult-Scale Radal Bass Functon Kernel Tanasanee Phenthrakul and Boonserm Kjsrkul Abstract Kernel functons are used n support ector regresson (SVR) to compute
More informationFlatten a Curved Space by Kernel: From Einstein to Euclid
Flatten a Curved Space by Kernel: From Ensten to Eucld Quyuan Huang, Dapeng Olver Wu Ensten s general theory of relatvty fundamentally changed our vew about the physcal world. Dfferent from Newton s theory,
More informationCS434a/541a: Pattern Recognition Prof. Olga Veksler. Lecture 15
CS434a/541a: Pattern Recognton Prof. Olga Veksler Lecture 15 Today New Topc: Unsupervsed Learnng Supervsed vs. unsupervsed learnng Unsupervsed learnng Net Tme: parametrc unsupervsed learnng Today: nonparametrc
More informationINF Repetition Anne Solberg INF
INF 43 7..7 Repetton Anne Solberg anne@f.uo.no INF 43 Classfers covered Gaussan classfer k =I k = k arbtrary Knn-classfer Support Vector Machnes Recommendaton: lnear or Radal Bass Functon kernels INF 43
More informationFuzzy Modeling of the Complexity vs. Accuracy Trade-off in a Sequential Two-Stage Multi-Classifier System
Fuzzy Modelng of the Complexty vs. Accuracy Trade-off n a Sequental Two-Stage Mult-Classfer System MARK LAST 1 Department of Informaton Systems Engneerng Ben-Guron Unversty of the Negev Beer-Sheva 84105
More informationClassifying Acoustic Transient Signals Using Artificial Intelligence
Classfyng Acoustc Transent Sgnals Usng Artfcal Intellgence Steve Sutton, Unversty of North Carolna At Wlmngton (suttons@charter.net) Greg Huff, Unversty of North Carolna At Wlmngton (jgh7476@uncwl.edu)
More informationA Binarization Algorithm specialized on Document Images and Photos
A Bnarzaton Algorthm specalzed on Document mages and Photos Ergna Kavalleratou Dept. of nformaton and Communcaton Systems Engneerng Unversty of the Aegean kavalleratou@aegean.gr Abstract n ths paper, a
More informationOn Multiple Kernel Learning with Multiple Labels
On Multple Kernel Learnng wth Multple Labels Le Tang Department of CSE Arzona State Unversty L.Tang@asu.edu Janhu Chen Department of CSE Arzona State Unversty Janhu.Chen@asu.edu Jepng Ye Department of
More informationSolving the SVM Problem. Christopher Sentelle, Ph.D. Candidate L-3 CyTerra Corporation
Solvng the SVM Problem Chrstopher Sentelle, Ph.D. Canddate L-3 Cyerra Corporaton Introducton SVM Background Kernel Methods Generalzaton and Structural Rsk Mnmzaton Solvng the SVM QP Problem Actve Set Method
More informationAn Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices
Internatonal Mathematcal Forum, Vol 7, 2012, no 52, 2549-2554 An Applcaton of the Dulmage-Mendelsohn Decomposton to Sparse Null Space Bases of Full Row Rank Matrces Mostafa Khorramzadeh Department of Mathematcal
More information11. APPROXIMATION ALGORITHMS
Copng wth NP-completeness 11. APPROXIMATION ALGORITHMS load balancng center selecton prcng method: vertex cover LP roundng: vertex cover generalzed load balancng knapsack problem Q. Suppose I need to solve
More informationShape Representation Robust to the Sketching Order Using Distance Map and Direction Histogram
Shape Representaton Robust to the Sketchng Order Usng Dstance Map and Drecton Hstogram Department of Computer Scence Yonse Unversty Kwon Yun CONTENTS Revew Topc Proposed Method System Overvew Sketch Normalzaton
More informationToday Using Fourier-Motzkin elimination for code generation Using Fourier-Motzkin elimination for determining schedule constraints
Fourer Motzkn Elmnaton Logstcs HW10 due Frday Aprl 27 th Today Usng Fourer-Motzkn elmnaton for code generaton Usng Fourer-Motzkn elmnaton for determnng schedule constrants Unversty Fourer-Motzkn Elmnaton
More informationHermite Splines in Lie Groups as Products of Geodesics
Hermte Splnes n Le Groups as Products of Geodescs Ethan Eade Updated May 28, 2017 1 Introducton 1.1 Goal Ths document defnes a curve n the Le group G parametrzed by tme and by structural parameters n the
More informationSemi-Supervised Discriminant Analysis Based On Data Structure
IOSR Journal of Computer Engneerng (IOSR-JCE) e-issn: 2278-0661,p-ISSN: 2278-8727, Volume 17, Issue 3, Ver. VII (May Jun. 2015), PP 39-46 www.osrournals.org Sem-Supervsed Dscrmnant Analyss Based On Data
More informationOptimizing Document Scoring for Query Retrieval
Optmzng Document Scorng for Query Retreval Brent Ellwen baellwe@cs.stanford.edu Abstract The goal of ths project was to automate the process of tunng a document query engne. Specfcally, I used machne learnng
More informationAdaptive Virtual Support Vector Machine for the Reliability Analysis of High-Dimensional Problems
Proceedngs of the ASME 2 Internatonal Desgn Engneerng Techncal Conferences & Computers and Informaton n Engneerng Conference IDETC/CIE 2 August 29-3, 2, Washngton, D.C., USA DETC2-47538 Adaptve Vrtual
More informationAPPLICATION OF A SUPPORT VECTOR MACHINE FOR LIQUEFACTION ASSESSMENT
38 Journal of Marne Scence and echnology, Vol., o. 3, pp. 38-34 (03) DOI: 0.69/JMS-0-058-3 APPLICAIO OF A SUPPOR VECOR MACHIE FOR LIQUEFACIO ASSESSME Chng-Ynn Lee and Shuh-G Chern Key ords: A, CP, lquefacton,
More informationAn Anti-Noise Text Categorization Method based on Support Vector Machines *
An Ant-Nose Text ategorzaton Method based on Support Vector Machnes * hen Ln, Huang Je and Gong Zheng-Hu School of omputer Scence, Natonal Unversty of Defense Technology, hangsha, 410073, hna chenln@nudt.edu.cn,
More informationApplications of Support Vector Machines for Pattern Recognition: A Survey
Applcatons of Support Vector Machnes for Pattern Recognton: A Survey Hyeran Byun and Seong-Whan Lee 2 Department of Computer Scence, Yonse Unversty Shnchon-dong, Seodaemun-gu, Seoul 20-749, Korea hrbyun@cs.yonse.ac.kr
More information