Home
Resource
A comparison of the triangle algorithm and sequential minimal optimization algorithm for solving the hard margin problem
PDF
PDF format is widely accepted and good for printing.
Plug-in required
PDF-1(317.98 kb)
Citation & Export
View Usage Statistics
Staff View

Citation & Export
Hide

Simple citation

Gupta, Mayank. A comparison of the triangle algorithm and sequential minimal optimization algorithm for solving the hard margin problem. Retrieved from https://doi.org/doi:10.7282/T3TT4T3M

Export

Click here for information about Citation Management Tools at Rutgers.

Statistics
Hide

Description

TitleA comparison of the triangle algorithm and sequential minimal optimization algorithm for solving the hard margin problem
NameGupta, Mayank (author); Kalantari, Bahman (chair); Steiger, William (internal member); Awasthi, Pranjal (internal member); Rutgers University; Graduate School - New Brunswick
Date Created2016
Other Date2016-05 (degree)
SubjectComputer Science, Convex sets
Extent1 online resource (vii, 35 p. : ill.)
DescriptionIn this article we consider the problem of testing, for two nite sets of points in the Euclidean space, if their convex hulls are disjoint and computing an optimal supporting hyperplane if so. This is a fundamental problem of classi cation in machine learning known as the hard-margin SVM. The problem can be formulated as a quadratic programming problem. The SMO algorithm [1] is the current state of art algorithm for solving it, but it does not answer the question of separability. An alternative to solving both problems is the triangle algorithm [2], a geometrically inspired algorithm, initially described for the convex hull membership problem [3], a fundamental problem in linear programming. First, we describe the experimental performance of the triangle algorithm for testing the intersection of two convex hulls. Next, we compare the performance of triangle algorithm with SMO for nding the optimal supporting hyperplane. Based on experimental results ranging up to 5000 points in each set in dimensions up to 10000, the triangle algorithm outperforms SMO.
NoteM.S.
NoteIncludes bibliographical references
Noteby Mayank Gupta
Genretheses, ETD graduate
Persistent URLhttps://doi.org/doi:10.7282/T3TT4T3M
Languageeng
CollectionGraduate School - New Brunswick Electronic Theses and Dissertations
Organization NameRutgers, The State University of New Jersey
RightsThe author owns the copyright to this work.
Version 8.5.5
Rutgers University Libraries - Copyright ©2024