Kernel Methods and Support Vector Machines
|
|
- Clement May
- 5 years ago
- Views:
Transcription
1 Kernel Methods and Support Vector Machines Oliver Schulte - CMPT 726 Bishop PRML Ch. 6
2 Support Vector Machines Defining Characteristics Like logistic regression, good for continuous input features, discrete target variable. Like nearest neighbor, a kernel method: classification is based on weighted similar instances. The kernel defines similarity measure. Sparsity: Tries to find a few important instances, the support vectors. Intuition: Netflix recommendation system.
3 SVMs: Pros and Cons Pros Very good classification performance, basically unbeatable. Fast and scaleable learning. Pretty fast inference. Cons No model is built, therefore black-box. Still need to specify kernel function (like specifying basis functions). Issues with multiple classes, can use probabilistic version. (Relevance Vector Machine).
4 Two Views of SVMs Theoretical View: linear separator SVM looks for linear separator but in new feature space. Uses a new criterion to choose a line separating classes: max-margin. User View: kernel-based classification User specifies a kernel function. SVM learns weights for instances. Classification is performed by taking average of the labels of other instances, weighted by a) similarity b) instance weight. Nice demo on web
5 Two Views of SVMs Theoretical View: linear separator SVM looks for linear separator but in new feature space. Uses a new criterion to choose a line separating classes: max-margin. User View: kernel-based classification User specifies a kernel function. SVM learns weights for instances. Classification is performed by taking average of the labels of other instances, weighted by a) similarity b) instance weight. Nice demo on web
6 Two Views of SVMs Theoretical View: linear separator SVM looks for linear separator but in new feature space. Uses a new criterion to choose a line separating classes: max-margin. User View: kernel-based classification User specifies a kernel function. SVM learns weights for instances. Classification is performed by taking average of the labels of other instances, weighted by a) similarity b) instance weight. Nice demo on web
7 Two Views of SVMs Theoretical View: linear separator SVM looks for linear separator but in new feature space. Uses a new criterion to choose a line separating classes: max-margin. User View: kernel-based classification User specifies a kernel function. SVM learns weights for instances. Classification is performed by taking average of the labels of other instances, weighted by a) similarity b) instance weight. Nice demo on web
8 Outline Theoretical View User View Building Kernels Computing the Max-Margin Classifier Non-Separable Data
9 Linear Classification Revisited Consider a two class classification problem Use a linear model y(x) = w x + b followed by a threshold function For now, let s assume training data are linearly separable (possibly after mapping to higher-dimensional space). Recall that the perceptron would converge to a perfect classifier for such data But there are many such perfect classifiers
10 Max Margin Classifiers y = 1 y = 0 y = 1 margin We can define the margin of a classifier as the minimum distance to any example In support vector machines the decision boundary which maximizes the margin is chosen. Intuitively, this is the line right in the middle between the two classes.
11 Support Vectors y = 1 y = 0 y = 1 The support vectors are the points at minimum distance to the decision boundary. The max-margin boundary depends only on the support vectors: other data points do not matter for classification and need not be stored.
12 Outline Theoretical View User View Building Kernels Computing the Max-Margin Classifier Non-Separable Data
13 Example: X-OR X-OR problem: class of (x 1, x 2 ) is positive iff x 1 x 2 > 0. Not linearly separable in input space, but linearly separable if we add extra dimensions. Use 6 basis functions φ(x 1, x 2 ) = (1, 2x 1, 2x 2, x 2 1, 2x 1 x 2, x 2 2 ). Simple classifier y(x 1, x 2 ) = φ 5 (x 1, x 2 ) = 2x 1 x 2. Linear in basis function space.
14 Example: X-OR X-OR problem: class of (x 1, x 2 ) is positive iff x 1 x 2 > 0. Not linearly separable in input space, but linearly separable if we add extra dimensions. Use 6 basis functions φ(x 1, x 2 ) = (1, 2x 1, 2x 2, x 2 1, 2x 1 x 2, x 2 2 ). Simple classifier y(x 1, x 2 ) = φ 5 (x 1, x 2 ) = 2x 1 x 2. Linear in basis function space.
15 Linear Separability Example x x 1 Decision Boundary x x x 1 x x x D mapping (x 2 1, x2 2, 2x 1 x 2 ).
16 Linear Separability Example x x 1 Decision Boundary x x x 1 x x x D mapping (x 2 1, x2 2, 2x 1 x 2 ).
17 The Kernel Trick There can be many extra dimensions, even infinite (see assignment). Don t want to compute basis function mapping φ(x). Key insight 1: Linear classification requires only the dot product. Key insight 2: The high-dimensional dot product φ(x) φ(z) can often be computed as a kernel function of the input vectors only: φ(x) φ(z) = k(x, z).
18 Kernel Trick Example Consider again the X-OR 6 basis functions φ(x 1, x 2 ) = (1, 2x 1, 2x 2, x 2 1, 2x 1 x 2, x 2 2 ). Exercise: find a closed form expression for φ(x) φ(z) Solution: Dot product φ(x) φ(z) = (1 + x z) 2 = k(x, z). A quadratic kernel.
19 Kernel Trick Example Consider again the X-OR 6 basis functions φ(x 1, x 2 ) = (1, 2x 1, 2x 2, x 2 1, 2x 1 x 2, x 2 2 ). Exercise: find a closed form expression for φ(x) φ(z) Solution: Dot product φ(x) φ(z) = (1 + x z) 2 = k(x, z). A quadratic kernel.
20 The Kernel Classification Formula Suppose we have a kernel function k and N labelled instances with weights a n 0, n = 1,..., N. As with the perceptron, the target labels +1 are for positive class, -1 for negative class. Then y(x) = a n t n k(x, x n ) + b n=1 x is classified as positive if y(x) > 0, negative otherwise. If a n > 0, then x n is a support vector. Don t need to store other vectors. a will be sparse - many zeros.
21 Example1 SVM with Gaussian kernel Support vectors circled. They are the closest to the other class. Note non-linear decision boundary in x space
22 the number the number of degrees of degrees of freedom of freedom is higher, is higher, for thefor linearly the linearly separable separable case (left case panel), (left panel), the the Theoretical View User View Building Kernels Computing the Max-Margin Classifier Non-Separable Data solution solution is roughly is roughly linear, linear, indicating indicating that the thatcapacity the capacity is being is being controlled; controlled; and that and the that the linearly linearly non-separable non-separable case (right case (right panel) panel) has become has become separable. separable. Example2 From Burges, A Tutorial on Support Vector Machines for Pattern Recognition (1998) Figure 9. Figure Degree 9. Degree 3 polynomial 3 polynomial kernel. kernel. The background The background colour colour shows the shows shape the of shape the of decision the decision surface. surface. Finally, Finally, note that notealthough that although the SVM the classifiers SVM classifiers described described above above are binary are binary classifiers, classifiers, they they are easily are easily combined combined to handle to handle the multiclass the multiclass case. case. A simple, A simple, effective effective combination combination trains trains SVM trained using cubic polynomial kernel k(x 1, x 2 ) = (x 1 x 2 + 1) 3 Left is linearly separable Note decision boundary is almost linear, even using cubic polynomial kernel Right is not linearly separable But is separable using polynomial kernel
23 Learning the Instance Weights The max-margin classifier is found by solving the following problem: Maximize wrt a L(a) = a n 1 2 n=1 subject to the constraints a n 0, n = 1,..., N N n=1 a nt n = 0 n=1 m=1 a n a m t n t m k(x n, x m ) It is quadratic, with linear constraints, convex in a Optimal a can be found With large datasets, local search strategies employed let s check SVM demo
24 Learning the Instance Weights The max-margin classifier is found by solving the following problem: Maximize wrt a L(a) = a n 1 2 n=1 subject to the constraints a n 0, n = 1,..., N N n=1 a nt n = 0 n=1 m=1 a n a m t n t m k(x n, x m ) It is quadratic, with linear constraints, convex in a Optimal a can be found With large datasets, local search strategies employed let s check SVM demo
25 Outline Theoretical View User View Building Kernels Computing the Max-Margin Classifier Non-Separable Data
26 Valid Kernels Valid kernels: if k(, ) satisfies: Symmetric; k(x i, x j ) = k(x j, x i ) Positive definite; for any x 1,..., x N, the Gram matrix K must be positive semi-definite: K = k(x 1, x 1 ) k(x 1, x 2 )... k(x 1, x N ) k(x N, x 1 ) k(x N, x 2 )... k(x N, x N ) Positive semi-definite means x Kx 0 for all x (like metric) then k(, ) corresponds to a dot product in some space φ a.k.a. Mercer kernel, admissible kernel, reproducing kernel Theorem of Mercer s 1909!
27 Examples of Kernels Some kernels: Linear kernel k(x 1, x 2 ) = x 1 x 2 Polynomial kernel k(x 1, x 2 ) = (1 + x 1 x 2 ) d Contains all polynomial terms up to degree d Gaussian kernel k(x 1, x 2 ) = exp( x 1 x 2 2 /2σ 2 ) Infinite dimension feature space
28 Constructing Kernels Can build new valid kernels from existing valid ones: k(x 1, x 2 ) = ck 1 (x 1, x 2 ), c > 0 k(x 1, x 2 ) = k 1 (x 1, x 2 ) + k 2 (x 1, x 2 ) k(x 1, x 2 ) = k 1 (x 1, x 2 )k 2 (x 1, x 2 ) k(x 1, x 2 ) = exp(k 1 (x 1, x 2 )) Table on p. 296 gives many such rules
29 More Kernels Stationary kernels are only a function of the difference between arguments: k(x 1, x 2 ) = k(x 1 x 2 ) Translation invariant in input space: k(x 1, x 2 ) = k(x 1 + c, x 2 + c) Homogeneous kernels, a. k. a. radial basis functions only a function of magnitude of difference: k(x 1, x 2 ) = k( x 1 x 2 ) Set subsets k(a 1, A 2 ) = 2 A 1 A 2, where A denotes number of elements in A Domain-specific: think hard about your problem, figure out what it means to be similar, define as k(, ), prove positive definite.
30 Outline Theoretical View User View Building Kernels Computing the Max-Margin Classifier Non-Separable Data
31 Marginal Geometry y > 0 y = 0 y < 0 R2 x2 R1 w x y(x) w x x1 w0 w See assignment. Projection of x in w dir. is w x w y(x) = 0 when w x = b, or w x w = b w So w x w b w = y(x) w is signed distance to decision boundary
32 Support Vectors y = 1 y = 0 y = 1 Assuming data are separated by the hyperplane, distance to decision boundary is tny(xn) w The maximum margin criterion chooses w, b by: { } 1 arg max w,b w min[t n(w x n + b)] n Points with this min value are known as support vectors
33 Canonical Representation This optimization problem is complex: { } 1 arg max w,b w min[t n(w x n ) + b)] n Exercise: Prove that rescaling w κw and b κb does not change distance tny(xn) w (many equiv. answers) So for x closest to surface, can set (how?): t (w x + b) = 1 All other points are at least this far away: n, t n (w x n + b) 1 Knowing that min distance = 1, the optimization becomes: arg max w,b 1 1 = arg min w w,b 2 w 2
34 Canonical Representation This optimization problem is complex: { } 1 arg max w,b w min[t n(w x n ) + b)] n Exercise: Prove that rescaling w κw and b κb does not change distance tny(xn) w (many equiv. answers) So for x closest to surface, can set (how?): t (w x + b) = 1 All other points are at least this far away: n, t n (w x n + b) 1 Knowing that min distance = 1, the optimization becomes: arg max w,b 1 1 = arg min w w,b 2 w 2
35 Canonical Representation This optimization problem is complex: { } 1 arg max w,b w min[t n(w x n ) + b)] n Exercise: Prove that rescaling w κw and b κb does not change distance tny(xn) w (many equiv. answers) So for x closest to surface, can set (how?): t (w x + b) = 1 All other points are at least this far away: n, t n (w x n + b) 1 Knowing that min distance = 1, the optimization becomes: arg max w,b 1 1 = arg min w w,b 2 w 2
36 Canonical Representation This optimization problem is complex: { } 1 arg max w,b w min[t n(w x n ) + b)] n Exercise: Prove that rescaling w κw and b κb does not change distance tny(xn) w (many equiv. answers) So for x closest to surface, can set (how?): t (w x + b) = 1 All other points are at least this far away: n, t n (w x n + b) 1 Knowing that min distance = 1, the optimization becomes: arg max w,b 1 1 = arg min w w,b 2 w 2
37 Canonical Representation So the optimization problem is now a constrained optimization problem: 1 arg min w,b 2 w 2 s.t. n, t n (w x n + b) 1 To solve this, we need to use Lagrange multipliers
38 Lagrange Multipliers - Inequality Constraints rf(x) Consider the problem: rg(x) xb xa min f (x) x s.t. g 1 (x) 0,..., g N (x) 0 g(x) > 0 g(x) = 0 Solutions are stationary points of the Lagrangian L(x, a) = f (x) a n g n (x) n=1 where for each n we have the KKT conditions, a n 0 g n (x) 0 a n g n (x) = 0 Therefore a n = 0 (inactive constraint) or g n (x) = 0 (active constraint).
39 Lagrange Multipliers - Inequality Constraints rf(x) Consider the problem: rg(x) xb xa min f (x) x s.t. g 1 (x) 0,..., g N (x) 0 g(x) > 0 g(x) = 0 Solutions are stationary points of the Lagrangian L(x, a) = f (x) a n g n (x) n=1 where for each n we have the KKT conditions, a n 0 g n (x) 0 a n g n (x) = 0 Therefore a n = 0 (inactive constraint) or g n (x) = 0 (active constraint).
40 Now Where Were We So the optimization problem is now a constrained optimization problem: w 2 arg min w,b 2 s.t. n, t n (w x n + b) 1 For this problem, the Lagrangian (with N multipliers a n ) is: L(w, b, a) = w 2 a n {t n (w x n + b) 1} 2 n=1 We can find the derivatives of L wrt w, b and set to 0: w = a n t n x n 0 = n=1 a n t n n=1
41 The Dual Formulation Recall the condition: w = a n t n x n n=1 Exercise: Show that w 2 2 = 1 2 N n=1 N m=1 a na m t n t m (x n x m ). Exercise: Show that n=1 m=1 a n {t n (w x n + b) 1} = n=1 a n a m t n t m (x n x m ) + b a n t n n=1 n=1 a n
42 Solving The Dual Formulation Combining the exercise results, we obtain the dual Lagrangian as a function of the Lagrange multipliers only: L(a) = a n 1 2 n=1 n=1 m=1 a n a m t n t m (x n x m ) The stationary points of L provide lower bounds on the original problem, so we want to maximize L (see http: //en.wikipedia.org/wiki/lagrange_duality). Apply the kernel trick to replace with kernel k, and remember the constraints on the Lagrange multipliers, to arrive at the following problem: Maximize L(a) = N n=1 a n 1 N N 2 n=1 m=1 a na m t n t m k(x n, x m ) subject to the constraints that a n 0, n = 1,..., N N n=1 a nt n = 0
43 From The Dual Solution a to a Classifier Given the solution a, we have formulas for w and for b (omitted). Then classify as follows: w = a n t n φ(x n ) n=1 y(x) = w φ(x) + b = a n t n k(x, x n ) + b n=1 Recall that every constraint is either inactive (a n = 0) or active (a n > 0 and t n y(x n ) = 1). If a n > 0, then x n is a support vector. a will be sparse - many zeros. Don t need to store x n for which a n = 0
44 Outline Theoretical View User View Building Kernels Computing the Max-Margin Classifier Non-Separable Data
45 Non-Separable Data > 1 y = 1 y = 0 y = 1 < 1 = 0 = 0 For most problems, data will not be linearly separable (even in feature space φ) Can relax the constraints from t n y(x n ) 1 to t n y(x n ) 1 ξ n The ξ n 0 are called slack variables ξ n = 0, satisfy original problem, so x n is on margin or correct side of margin 0 < ξ n < 1, inside margin, but still correctly classifed ξ n > 1, mis-classified
46 Loss Function For Non-separable Data > 1 y = 1 y = 0 y = 1 < 1 = 0 = 0 Non-zero slack variables are bad, penalize while maximizing the margin: min C ξ n w 2 n=1 Constant C > 0 controls importance of large margin versus incorrect (non-zero slack) Set using cross-validation Optimization is same quadratic, different constraints, convex
47 SVM Loss Function The SVM for the separable case solved the problem: 1 arg min w 2 w 2 s.t. n, t n y n 1 Can write this as: arg min w E (t n y n ) + λ w 2 n=1 where E (z) = 0 if z 1, otherwise Non-separable case relaxes this to be: arg min E SV (t n y n ) + λ w 2 w n=1 where E SV (z) = [z] + hinge loss [z] + = z if u 1, 0 otherwise
48 SVM Loss Function The SVM for the separable case solved the problem: 1 arg min w 2 w 2 s.t. n, t n y n 1 Can write this as: arg min w E (t n y n ) + λ w 2 n=1 where E (z) = 0 if z 1, otherwise Non-separable case relaxes this to be: arg min E SV (t n y n ) + λ w 2 w n=1 where E SV (z) = [z] + hinge loss [z] + = z if u 1, 0 otherwise
49 SVM Loss Function The SVM for the separable case solved the problem: 1 arg min w 2 w 2 s.t. n, t n y n 1 Can write this as: arg min w E (t n y n ) + λ w 2 n=1 where E (z) = 0 if z 1, otherwise Non-separable case relaxes this to be: arg min E SV (t n y n ) + λ w 2 w n=1 where E SV (z) = [z] + hinge loss [z] + = z if u 1, 0 otherwise
50 Loss Functions E(z) z Linear classifiers, compare loss function used for learning z = y n t n 0 iff there is an error (with t n {+1, 1}). z = y n t n 1 iff the point is on the right side of the margin boundary. Black is misclassification error Transformed simple linear classifier, squared error: (y n t n ) 2 Transformed logistic regression, cross-entropy error: t n ln y n SVM, hinge loss: positive only if the point is on the wrong side of the margin boundary. Sparse solutions.
51 Two Views of Learning as Optimization The original SVM goal was of the form: Find the simplest hypothesis that is consistent with the data, or Maximize simplicity, given a consistency constraint. This general idea appears in much scientific model building, in image processing, and other applications. Bayesian methods use a criterion of the form Find a trade-off between simplicity and data fit, or Maximize sum of the type (data fit - λ simplicity) e.g., ln(p(d M)) λln(p(m)) where the model prior M is higher for simpler models.
52 Pros and Cons of Learning Criteria The Bayesian approach has a solid probabilistic foundation in Bayes theorem. Seems to be especially suitable for noisy data. The constraint-based approach is often easy for users to understand. Often leads to sparser simpler models. Suitable for clean data.
53 Conclusion Readings: Ch (pp ) Non-linear features, or domain-specific similarity measurements are useful Dot products of non-linear features, or similarity measurements, can be written as kernel functions Validity by positive semi-definiteness of kernel function Can have algorithm work in non-linear feature space without actually mapping inputs to feature space Advantageous when feature space is high-dimensional
Max Margin-Classifier
Max Margin-Classifier Oliver Schulte - CMPT 726 Bishop PRML Ch. 7 Outline Maximum Margin Criterion Math Maximizing the Margin Non-Separable Data Kernels and Non-linear Mappings Where does the maximization
More information(Kernels +) Support Vector Machines
(Kernels +) Support Vector Machines Machine Learning Torsten Möller Reading Chapter 5 of Machine Learning An Algorithmic Perspective by Marsland Chapter 6+7 of Pattern Recognition and Machine Learning
More informationPattern Recognition 2018 Support Vector Machines
Pattern Recognition 2018 Support Vector Machines Ad Feelders Universiteit Utrecht Ad Feelders ( Universiteit Utrecht ) Pattern Recognition 1 / 48 Support Vector Machines Ad Feelders ( Universiteit Utrecht
More informationSupport Vector Machine (continued)
Support Vector Machine continued) Overlapping class distribution: In practice the class-conditional distributions may overlap, so that the training data points are no longer linearly separable. We need
More informationKernel Methods. Foundations of Data Analysis. Torsten Möller. Möller/Mori 1
Kernel Methods Foundations of Data Analysis Torsten Möller Möller/Mori 1 Reading Chapter 6 of Pattern Recognition and Machine Learning by Bishop Chapter 12 of The Elements of Statistical Learning by Hastie,
More informationCheng Soon Ong & Christian Walder. Canberra February June 2018
Cheng Soon Ong & Christian Walder Research Group and College of Engineering and Computer Science Canberra February June 2018 Outlines Overview Introduction Linear Algebra Probability Linear Regression
More informationLinear & nonlinear classifiers
Linear & nonlinear classifiers Machine Learning Hamid Beigy Sharif University of Technology Fall 1394 Hamid Beigy (Sharif University of Technology) Linear & nonlinear classifiers Fall 1394 1 / 34 Table
More informationSupport Vector Machines
Support Vector Machines Reading: Ben-Hur & Weston, A User s Guide to Support Vector Machines (linked from class web page) Notation Assume a binary classification problem. Instances are represented by vector
More informationSupport Vector Machine
Support Vector Machine Kernel: Kernel is defined as a function returning the inner product between the images of the two arguments k(x 1, x 2 ) = ϕ(x 1 ), ϕ(x 2 ) k(x 1, x 2 ) = k(x 2, x 1 ) modularity-
More informationSupport Vector Machine (SVM) and Kernel Methods
Support Vector Machine (SVM) and Kernel Methods CE-717: Machine Learning Sharif University of Technology Fall 2014 Soleymani Outline Margin concept Hard-Margin SVM Soft-Margin SVM Dual Problems of Hard-Margin
More informationNon-Bayesian Classifiers Part II: Linear Discriminants and Support Vector Machines
Non-Bayesian Classifiers Part II: Linear Discriminants and Support Vector Machines Selim Aksoy Department of Computer Engineering Bilkent University saksoy@cs.bilkent.edu.tr CS 551, Fall 2018 CS 551, Fall
More informationSupport Vector Machine (SVM) & Kernel CE-717: Machine Learning Sharif University of Technology. M. Soleymani Fall 2012
Support Vector Machine (SVM) & Kernel CE-717: Machine Learning Sharif University of Technology M. Soleymani Fall 2012 Linear classifier Which classifier? x 2 x 1 2 Linear classifier Margin concept x 2
More informationMachine Learning and Data Mining. Support Vector Machines. Kalev Kask
Machine Learning and Data Mining Support Vector Machines Kalev Kask Linear classifiers Which decision boundary is better? Both have zero training error (perfect training accuracy) But, one of them seems
More informationStatistical Machine Learning from Data
Samy Bengio Statistical Machine Learning from Data 1 Statistical Machine Learning from Data Support Vector Machines Samy Bengio IDIAP Research Institute, Martigny, Switzerland, and Ecole Polytechnique
More informationLinear & nonlinear classifiers
Linear & nonlinear classifiers Machine Learning Hamid Beigy Sharif University of Technology Fall 1396 Hamid Beigy (Sharif University of Technology) Linear & nonlinear classifiers Fall 1396 1 / 44 Table
More informationIntroduction to Support Vector Machines
Introduction to Support Vector Machines Shivani Agarwal Support Vector Machines (SVMs) Algorithm for learning linear classifiers Motivated by idea of maximizing margin Efficient extension to non-linear
More informationSupport Vector Machine (SVM) and Kernel Methods
Support Vector Machine (SVM) and Kernel Methods CE-717: Machine Learning Sharif University of Technology Fall 2015 Soleymani Outline Margin concept Hard-Margin SVM Soft-Margin SVM Dual Problems of Hard-Margin
More informationKernel Machines. Pradeep Ravikumar Co-instructor: Manuela Veloso. Machine Learning
Kernel Machines Pradeep Ravikumar Co-instructor: Manuela Veloso Machine Learning 10-701 SVM linearly separable case n training points (x 1,, x n ) d features x j is a d-dimensional vector Primal problem:
More informationSupport Vector Machines. CSE 6363 Machine Learning Vassilis Athitsos Computer Science and Engineering Department University of Texas at Arlington
Support Vector Machines CSE 6363 Machine Learning Vassilis Athitsos Computer Science and Engineering Department University of Texas at Arlington 1 A Linearly Separable Problem Consider the binary classification
More informationSupport Vector Machines
Two SVM tutorials linked in class website (please, read both): High-level presentation with applications (Hearst 1998) Detailed tutorial (Burges 1998) Support Vector Machines Machine Learning 10701/15781
More informationEE613 Machine Learning for Engineers. Kernel methods Support Vector Machines. jean-marc odobez 2015
EE613 Machine Learning for Engineers Kernel methods Support Vector Machines jean-marc odobez 2015 overview Kernel methods introductions and main elements defining kernels Kernelization of k-nn, K-Means,
More informationSupport Vector Machines. Introduction to Data Mining, 2 nd Edition by Tan, Steinbach, Karpatne, Kumar
Data Mining Support Vector Machines Introduction to Data Mining, 2 nd Edition by Tan, Steinbach, Karpatne, Kumar 02/03/2018 Introduction to Data Mining 1 Support Vector Machines Find a linear hyperplane
More informationSUPPORT VECTOR MACHINE
SUPPORT VECTOR MACHINE Mainly based on https://nlp.stanford.edu/ir-book/pdf/15svm.pdf 1 Overview SVM is a huge topic Integration of MMDS, IIR, and Andrew Moore s slides here Our foci: Geometric intuition
More informationLinear vs Non-linear classifier. CS789: Machine Learning and Neural Network. Introduction
Linear vs Non-linear classifier CS789: Machine Learning and Neural Network Support Vector Machine Jakramate Bootkrajang Department of Computer Science Chiang Mai University Linear classifier is in the
More informationSupport Vector Machines, Kernel SVM
Support Vector Machines, Kernel SVM Professor Ameet Talwalkar Professor Ameet Talwalkar CS260 Machine Learning Algorithms February 27, 2017 1 / 40 Outline 1 Administration 2 Review of last lecture 3 SVM
More informationJeff Howbert Introduction to Machine Learning Winter
Classification / Regression Support Vector Machines Jeff Howbert Introduction to Machine Learning Winter 2012 1 Topics SVM classifiers for linearly separable classes SVM classifiers for non-linearly separable
More informationPerceptron Revisited: Linear Separators. Support Vector Machines
Support Vector Machines Perceptron Revisited: Linear Separators Binary classification can be viewed as the task of separating classes in feature space: w T x + b > 0 w T x + b = 0 w T x + b < 0 Department
More informationSupport Vector Machines for Classification and Regression. 1 Linearly Separable Data: Hard Margin SVMs
E0 270 Machine Learning Lecture 5 (Jan 22, 203) Support Vector Machines for Classification and Regression Lecturer: Shivani Agarwal Disclaimer: These notes are a brief summary of the topics covered in
More informationData Mining. Linear & nonlinear classifiers. Hamid Beigy. Sharif University of Technology. Fall 1396
Data Mining Linear & nonlinear classifiers Hamid Beigy Sharif University of Technology Fall 1396 Hamid Beigy (Sharif University of Technology) Data Mining Fall 1396 1 / 31 Table of contents 1 Introduction
More informationAnnouncements - Homework
Announcements - Homework Homework 1 is graded, please collect at end of lecture Homework 2 due today Homework 3 out soon (watch email) Ques 1 midterm review HW1 score distribution 40 HW1 total score 35
More informationLecture 9: Large Margin Classifiers. Linear Support Vector Machines
Lecture 9: Large Margin Classifiers. Linear Support Vector Machines Perceptrons Definition Perceptron learning rule Convergence Margin & max margin classifiers (Linear) support vector machines Formulation
More informationLINEAR CLASSIFICATION, PERCEPTRON, LOGISTIC REGRESSION, SVC, NAÏVE BAYES. Supervised Learning
LINEAR CLASSIFICATION, PERCEPTRON, LOGISTIC REGRESSION, SVC, NAÏVE BAYES Supervised Learning Linear vs non linear classifiers In K-NN we saw an example of a non-linear classifier: the decision boundary
More informationSupport Vector Machine (SVM) and Kernel Methods
Support Vector Machine (SVM) and Kernel Methods CE-717: Machine Learning Sharif University of Technology Fall 2016 Soleymani Outline Margin concept Hard-Margin SVM Soft-Margin SVM Dual Problems of Hard-Margin
More informationML (cont.): SUPPORT VECTOR MACHINES
ML (cont.): SUPPORT VECTOR MACHINES CS540 Bryan R Gibson University of Wisconsin-Madison Slides adapted from those used by Prof. Jerry Zhu, CS540-1 1 / 40 Support Vector Machines (SVMs) The No-Math Version
More informationMachine Learning. Support Vector Machines. Manfred Huber
Machine Learning Support Vector Machines Manfred Huber 2015 1 Support Vector Machines Both logistic regression and linear discriminant analysis learn a linear discriminant function to separate the data
More informationSparse Kernel Machines - SVM
Sparse Kernel Machines - SVM Henrik I. Christensen Robotics & Intelligent Machines @ GT Georgia Institute of Technology, Atlanta, GA 30332-0280 hic@cc.gatech.edu Henrik I. Christensen (RIM@GT) Support
More informationLinear, threshold units. Linear Discriminant Functions and Support Vector Machines. Biometrics CSE 190 Lecture 11. X i : inputs W i : weights
Linear Discriminant Functions and Support Vector Machines Linear, threshold units CSE19, Winter 11 Biometrics CSE 19 Lecture 11 1 X i : inputs W i : weights θ : threshold 3 4 5 1 6 7 Courtesy of University
More informationSupport Vector Machine & Its Applications
Support Vector Machine & Its Applications A portion (1/3) of the slides are taken from Prof. Andrew Moore s SVM tutorial at http://www.cs.cmu.edu/~awm/tutorials Mingyue Tan The University of British Columbia
More informationSupport Vector Machines for Classification and Regression
CIS 520: Machine Learning Oct 04, 207 Support Vector Machines for Classification and Regression Lecturer: Shivani Agarwal Disclaimer: These notes are designed to be a supplement to the lecture. They may
More informationLinear Classification and SVM. Dr. Xin Zhang
Linear Classification and SVM Dr. Xin Zhang Email: eexinzhang@scut.edu.cn What is linear classification? Classification is intrinsically non-linear It puts non-identical things in the same class, so a
More informationLinear classifiers selecting hyperplane maximizing separation margin between classes (large margin classifiers)
Support vector machines In a nutshell Linear classifiers selecting hyperplane maximizing separation margin between classes (large margin classifiers) Solution only depends on a small subset of training
More informationCS798: Selected topics in Machine Learning
CS798: Selected topics in Machine Learning Support Vector Machine Jakramate Bootkrajang Department of Computer Science Chiang Mai University Jakramate Bootkrajang CS798: Selected topics in Machine Learning
More informationCIS 520: Machine Learning Oct 09, Kernel Methods
CIS 520: Machine Learning Oct 09, 207 Kernel Methods Lecturer: Shivani Agarwal Disclaimer: These notes are designed to be a supplement to the lecture They may or may not cover all the material discussed
More informationLinear Models for Classification
Linear Models for Classification Oliver Schulte - CMPT 726 Bishop PRML Ch. 4 Classification: Hand-written Digit Recognition CHINE INTELLIGENCE, VOL. 24, NO. 24, APRIL 2002 x i = t i = (0, 0, 0, 1, 0, 0,
More informationLecture Support Vector Machine (SVM) Classifiers
Introduction to Machine Learning Lecturer: Amir Globerson Lecture 6 Fall Semester Scribe: Yishay Mansour 6.1 Support Vector Machine (SVM) Classifiers Classification is one of the most important tasks in
More informationCSE546: SVMs, Dual Formula5on, and Kernels Winter 2012
CSE546: SVMs, Dual Formula5on, and Kernels Winter 2012 Luke ZeClemoyer Slides adapted from Carlos Guestrin Linear classifiers Which line is becer? w. = j w (j) x (j) Data Example i Pick the one with the
More informationSupport Vector Machines
Support Vector Machines Stephan Dreiseitl University of Applied Sciences Upper Austria at Hagenberg Harvard-MIT Division of Health Sciences and Technology HST.951J: Medical Decision Support Overview Motivation
More informationReview: Support vector machines. Machine learning techniques and image analysis
Review: Support vector machines Review: Support vector machines Margin optimization min (w,w 0 ) 1 2 w 2 subject to y i (w 0 + w T x i ) 1 0, i = 1,..., n. Review: Support vector machines Margin optimization
More informationSVMs, Duality and the Kernel Trick
SVMs, Duality and the Kernel Trick Machine Learning 10701/15781 Carlos Guestrin Carnegie Mellon University February 26 th, 2007 2005-2007 Carlos Guestrin 1 SVMs reminder 2005-2007 Carlos Guestrin 2 Today
More informationLinear classifiers selecting hyperplane maximizing separation margin between classes (large margin classifiers)
Support vector machines In a nutshell Linear classifiers selecting hyperplane maximizing separation margin between classes (large margin classifiers) Solution only depends on a small subset of training
More informationCOMP 652: Machine Learning. Lecture 12. COMP Lecture 12 1 / 37
COMP 652: Machine Learning Lecture 12 COMP 652 Lecture 12 1 / 37 Today Perceptrons Definition Perceptron learning rule Convergence (Linear) support vector machines Margin & max margin classifier Formulation
More informationLecture 10: Support Vector Machine and Large Margin Classifier
Lecture 10: Support Vector Machine and Large Margin Classifier Applied Multivariate Analysis Math 570, Fall 2014 Xingye Qiao Department of Mathematical Sciences Binghamton University E-mail: qiao@math.binghamton.edu
More informationSupport Vector Machines.
Support Vector Machines www.cs.wisc.edu/~dpage 1 Goals for the lecture you should understand the following concepts the margin slack variables the linear support vector machine nonlinear SVMs the kernel
More informationSupport Vector Machines
EE 17/7AT: Optimization Models in Engineering Section 11/1 - April 014 Support Vector Machines Lecturer: Arturo Fernandez Scribe: Arturo Fernandez 1 Support Vector Machines Revisited 1.1 Strictly) Separable
More informationSupport vector machines Lecture 4
Support vector machines Lecture 4 David Sontag New York University Slides adapted from Luke Zettlemoyer, Vibhav Gogate, and Carlos Guestrin Q: What does the Perceptron mistake bound tell us? Theorem: The
More informationSupport Vector Machines: Maximum Margin Classifiers
Support Vector Machines: Maximum Margin Classifiers Machine Learning and Pattern Recognition: September 16, 2008 Piotr Mirowski Based on slides by Sumit Chopra and Fu-Jie Huang 1 Outline What is behind
More information18.9 SUPPORT VECTOR MACHINES
744 Chapter 8. Learning from Examples is the fact that each regression problem will be easier to solve, because it involves only the examples with nonzero weight the examples whose kernels overlap the
More informationLecture 10: A brief introduction to Support Vector Machine
Lecture 10: A brief introduction to Support Vector Machine Advanced Applied Multivariate Analysis STAT 2221, Fall 2013 Sungkyu Jung Department of Statistics, University of Pittsburgh Xingye Qiao Department
More informationSupport'Vector'Machines. Machine(Learning(Spring(2018 March(5(2018 Kasthuri Kannan
Support'Vector'Machines Machine(Learning(Spring(2018 March(5(2018 Kasthuri Kannan kasthuri.kannan@nyumc.org Overview Support Vector Machines for Classification Linear Discrimination Nonlinear Discrimination
More informationLINEAR CLASSIFIERS. J. Elder CSE 4404/5327 Introduction to Machine Learning and Pattern Recognition
LINEAR CLASSIFIERS Classification: Problem Statement 2 In regression, we are modeling the relationship between a continuous input variable x and a continuous target variable t. In classification, the input
More informationSupport Vector Machines and Kernel Methods
2018 CS420 Machine Learning, Lecture 3 Hangout from Prof. Andrew Ng. http://cs229.stanford.edu/notes/cs229-notes3.pdf Support Vector Machines and Kernel Methods Weinan Zhang Shanghai Jiao Tong University
More informationCSC 411 Lecture 17: Support Vector Machine
CSC 411 Lecture 17: Support Vector Machine Ethan Fetaya, James Lucas and Emad Andrews University of Toronto CSC411 Lec17 1 / 1 Today Max-margin classification SVM Hard SVM Duality Soft SVM CSC411 Lec17
More informationIndirect Rule Learning: Support Vector Machines. Donglin Zeng, Department of Biostatistics, University of North Carolina
Indirect Rule Learning: Support Vector Machines Indirect learning: loss optimization It doesn t estimate the prediction rule f (x) directly, since most loss functions do not have explicit optimizers. Indirection
More informationIntroduction to SVM and RVM
Introduction to SVM and RVM Machine Learning Seminar HUS HVL UIB Yushu Li, UIB Overview Support vector machine SVM First introduced by Vapnik, et al. 1992 Several literature and wide applications Relevance
More informationMachine Learning Support Vector Machines. Prof. Matteo Matteucci
Machine Learning Support Vector Machines Prof. Matteo Matteucci Discriminative vs. Generative Approaches 2 o Generative approach: we derived the classifier from some generative hypothesis about the way
More informationL5 Support Vector Classification
L5 Support Vector Classification Support Vector Machine Problem definition Geometrical picture Optimization problem Optimization Problem Hard margin Convexity Dual problem Soft margin problem Alexander
More informationConstrained Optimization and Support Vector Machines
Constrained Optimization and Support Vector Machines Man-Wai MAK Dept. of Electronic and Information Engineering, The Hong Kong Polytechnic University enmwmak@polyu.edu.hk http://www.eie.polyu.edu.hk/
More informationStatistical Pattern Recognition
Statistical Pattern Recognition Support Vector Machine (SVM) Hamid R. Rabiee Hadi Asheri, Jafar Muhammadi, Nima Pourdamghani Spring 2013 http://ce.sharif.edu/courses/91-92/2/ce725-1/ Agenda Introduction
More information10/05/2016. Computational Methods for Data Analysis. Massimo Poesio SUPPORT VECTOR MACHINES. Support Vector Machines Linear classifiers
Computational Methods for Data Analysis Massimo Poesio SUPPORT VECTOR MACHINES Support Vector Machines Linear classifiers 1 Linear Classifiers denotes +1 denotes -1 w x + b>0 f(x,w,b) = sign(w x + b) How
More informationPattern Recognition and Machine Learning. Perceptrons and Support Vector machines
Pattern Recognition and Machine Learning James L. Crowley ENSIMAG 3 - MMIS Fall Semester 2016 Lessons 6 10 Jan 2017 Outline Perceptrons and Support Vector machines Notation... 2 Perceptrons... 3 History...3
More informationSupport Vector Machines
Wien, June, 2010 Paul Hofmarcher, Stefan Theussl, WU Wien Hofmarcher/Theussl SVM 1/21 Linear Separable Separating Hyperplanes Non-Linear Separable Soft-Margin Hyperplanes Hofmarcher/Theussl SVM 2/21 (SVM)
More informationSupport Vector Machine
Support Vector Machine Fabrice Rossi SAMM Université Paris 1 Panthéon Sorbonne 2018 Outline Linear Support Vector Machine Kernelized SVM Kernels 2 From ERM to RLM Empirical Risk Minimization in the binary
More informationThe Perceptron Algorithm, Margins
The Perceptron Algorithm, Margins MariaFlorina Balcan 08/29/2018 The Perceptron Algorithm Simple learning algorithm for supervised classification analyzed via geometric margins in the 50 s [Rosenblatt
More informationSupport Vector Machines (SVM) in bioinformatics. Day 1: Introduction to SVM
1 Support Vector Machines (SVM) in bioinformatics Day 1: Introduction to SVM Jean-Philippe Vert Bioinformatics Center, Kyoto University, Japan Jean-Philippe.Vert@mines.org Human Genome Center, University
More informationNONLINEAR CLASSIFICATION AND REGRESSION. J. Elder CSE 4404/5327 Introduction to Machine Learning and Pattern Recognition
NONLINEAR CLASSIFICATION AND REGRESSION Nonlinear Classification and Regression: Outline 2 Multi-Layer Perceptrons The Back-Propagation Learning Algorithm Generalized Linear Models Radial Basis Function
More informationSupport Vector Machines for Classification: A Statistical Portrait
Support Vector Machines for Classification: A Statistical Portrait Yoonkyung Lee Department of Statistics The Ohio State University May 27, 2011 The Spring Conference of Korean Statistical Society KAIST,
More informationLearning with kernels and SVM
Learning with kernels and SVM Šámalova chata, 23. května, 2006 Petra Kudová Outline Introduction Binary classification Learning with Kernels Support Vector Machines Demo Conclusion Learning from data find
More informationCS6375: Machine Learning Gautam Kunapuli. Support Vector Machines
Gautam Kunapuli Example: Text Categorization Example: Develop a model to classify news stories into various categories based on their content. sports politics Use the bag-of-words representation for this
More informationLinear classifiers selecting hyperplane maximizing separation margin between classes (large margin classifiers)
Support vector machines In a nutshell Linear classifiers selecting hyperplane maximizing separation margin between classes (large margin classifiers) Solution only depends on a small subset of training
More informationSupport Vector Machines Explained
December 23, 2008 Support Vector Machines Explained Tristan Fletcher www.cs.ucl.ac.uk/staff/t.fletcher/ Introduction This document has been written in an attempt to make the Support Vector Machines (SVM),
More informationCS , Fall 2011 Assignment 2 Solutions
CS 94-0, Fall 20 Assignment 2 Solutions (8 pts) In this question we briefly review the expressiveness of kernels (a) Construct a support vector machine that computes the XOR function Use values of + and
More informationSupport Vector Machine for Classification and Regression
Support Vector Machine for Classification and Regression Ahlame Douzal AMA-LIG, Université Joseph Fourier Master 2R - MOSIG (2013) November 25, 2013 Loss function, Separating Hyperplanes, Canonical Hyperplan
More informationCS145: INTRODUCTION TO DATA MINING
CS145: INTRODUCTION TO DATA MINING 5: Vector Data: Support Vector Machine Instructor: Yizhou Sun yzsun@cs.ucla.edu October 18, 2017 Homework 1 Announcements Due end of the day of this Thursday (11:59pm)
More informationIntroduction to Support Vector Machines
Introduction to Support Vector Machines Hsuan-Tien Lin Learning Systems Group, California Institute of Technology Talk in NTU EE/CS Speech Lab, November 16, 2005 H.-T. Lin (Learning Systems Group) Introduction
More informationSupport Vector Machines
Support Vector Machines Some material on these is slides borrowed from Andrew Moore's excellent machine learning tutorials located at: http://www.cs.cmu.edu/~awm/tutorials/ Where Should We Draw the Line????
More informationSupport Vector Machine
Andrea Passerini passerini@disi.unitn.it Machine Learning Support vector machines In a nutshell Linear classifiers selecting hyperplane maximizing separation margin between classes (large margin classifiers)
More informationSVMs: Non-Separable Data, Convex Surrogate Loss, Multi-Class Classification, Kernels
SVMs: Non-Separable Data, Convex Surrogate Loss, Multi-Class Classification, Kernels Karl Stratos June 21, 2018 1 / 33 Tangent: Some Loose Ends in Logistic Regression Polynomial feature expansion in logistic
More informationKernelized Perceptron Support Vector Machines
Kernelized Perceptron Support Vector Machines Emily Fox University of Washington February 13, 2017 What is the perceptron optimizing? 1 The perceptron algorithm [Rosenblatt 58, 62] Classification setting:
More informationAbout this class. Maximizing the Margin. Maximum margin classifiers. Picture of large and small margin hyperplanes
About this class Maximum margin classifiers SVMs: geometric derivation of the primal problem Statement of the dual problem The kernel trick SVMs as the solution to a regularization problem Maximizing the
More informationSupport Vector Machines and Kernel Methods
Support Vector Machines and Kernel Methods Geoff Gordon ggordon@cs.cmu.edu July 10, 2003 Overview Why do people care about SVMs? Classification problems SVMs often produce good results over a wide range
More informationClassification and Support Vector Machine
Classification and Support Vector Machine Yiyong Feng and Daniel P. Palomar The Hong Kong University of Science and Technology (HKUST) ELEC 5470 - Convex Optimization Fall 2017-18, HKUST, Hong Kong Outline
More informationMachine Learning Lecture 7
Course Outline Machine Learning Lecture 7 Fundamentals (2 weeks) Bayes Decision Theory Probability Density Estimation Statistical Learning Theory 23.05.2016 Discriminative Approaches (5 weeks) Linear Discriminant
More informationSupport vector machines
Support vector machines Guillaume Obozinski Ecole des Ponts - ParisTech SOCN course 2014 SVM, kernel methods and multiclass 1/23 Outline 1 Constrained optimization, Lagrangian duality and KKT 2 Support
More informationWarm up: risk prediction with logistic regression
Warm up: risk prediction with logistic regression Boss gives you a bunch of data on loans defaulting or not: {(x i,y i )} n i= x i 2 R d, y i 2 {, } You model the data as: P (Y = y x, w) = + exp( yw T
More informationSupport Vector Machines. Maximizing the Margin
Support Vector Machines Support vector achines (SVMs) learn a hypothesis: h(x) = b + Σ i= y i α i k(x, x i ) (x, y ),..., (x, y ) are the training exs., y i {, } b is the bias weight. α,..., α are the
More informationMachine Learning Practice Page 2 of 2 10/28/13
Machine Learning 10-701 Practice Page 2 of 2 10/28/13 1. True or False Please give an explanation for your answer, this is worth 1 pt/question. (a) (2 points) No classifier can do better than a naive Bayes
More informationLecture Notes on Support Vector Machine
Lecture Notes on Support Vector Machine Feng Li fli@sdu.edu.cn Shandong University, China 1 Hyperplane and Margin In a n-dimensional space, a hyper plane is defined by ω T x + b = 0 (1) where ω R n is
More informationSupport Vector Machines
Support Vector Machines Hypothesis Space variable size deterministic continuous parameters Learning Algorithm linear and quadratic programming eager batch SVMs combine three important ideas Apply optimization
More informationMark your answers ON THE EXAM ITSELF. If you are not sure of your answer you may wish to provide a brief explanation.
CS 189 Spring 2015 Introduction to Machine Learning Midterm You have 80 minutes for the exam. The exam is closed book, closed notes except your one-page crib sheet. No calculators or electronic items.
More informationSupport Vector Machines and Speaker Verification
1 Support Vector Machines and Speaker Verification David Cinciruk March 6, 2013 2 Table of Contents Review of Speaker Verification Introduction to Support Vector Machines Derivation of SVM Equations Soft
More information