Login | Register

Support Vector Machines with Convex Combination of Kernels


Support Vector Machines with Convex Combination of Kernels

Rahimi, Farnoosh (2018) Support Vector Machines with Convex Combination of Kernels. Masters thesis, Concordia University.

Text (application/pdf)
Rahimi_MSc_F2018.pdf - Accepted Version


Support Vector Machine (SVMs) are renowned for their excellent performance in solving data-mining problems such as classification, regression and feature selection. In the field of statistical classification, SVMs classify data points into different groups based on finding the hyperplane that maximizes the margin between the two classes. SVMs can also use kernel functions to map the data into a higher dimensional space in case a hyperplane cannot be used to do the separation linearly. Using specific kernels allows us to model a particular feature space, and a suitable kernel can improve the SVMs' performance to classify data more accurately. We present a method to combine existing kernels in order to produce a new kernel which improves the accuracy of the classification and reduce the process time. We will discuss the theoretical and computational issues on SVMs. We are going to implement our method on a simulated data-set to see how it works, and then we will apply it to some large real-world data-sets.

Divisions:Concordia University > Faculty of Arts and Science > Mathematics and Statistics
Item Type:Thesis (Masters)
Authors:Rahimi, Farnoosh
Institution:Concordia University
Degree Name:M. Sc.
Date:28 August 2018
Thesis Supervisor(s):Sen, Arusharka
ID Code:984512
Deposited On:08 Apr 2019 14:25
Last Modified:08 Apr 2019 14:25
All items in Spectrum are protected by copyright, with all rights reserved. The use of items is governed by Spectrum's terms of access.

Repository Staff Only: item control page

Downloads per month over past year

Back to top Back to top