An Integer Support Vector Machine

Authors:
Maryanne Domm;Andrew Engel;Peguy Pierre-Louis;Jeff Goldberg
Affiliations:
The Titan Corporation;Towson University;Towson University;University of Arizona
Venue:
SNPD-SAWN '05 Proceedings of the Sixth International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing and First ACIS International Workshop on Self-Assembling Wireless Networks
Year:
2005

Citing 0
Cited 3

An application of a new meta-heuristic for optimizing the classification accuracy when analyzing some medical datasets

Expert Systems with Applications: An International Journal
Development of an adaptive neuro-fuzzy classifier using linguistic hedges: Part 1

Expert Systems with Applications: An International Journal
A meta-heuristic approach for improving the accuracy in some classification algorithms

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

Data mining is a technique to discover patterns and trends in data and can be used to create a model to predict those patterns and trends. This is particularly useful for data sets that are not amenable to traditional statistical analysis. One particular data mining task is classification, predicting a quantity that can only take on a finite number of values. An important class of binary classifiers are Support Vector Machines (SVMs). Traditional SVMs use constrained optimization to find a separating hyperplane. A new data point is classified based on which side of the separating hyperplane it happens to fall on. All SVMs try to minimize the number of potential errors the classifier will make by minimizing a sum of distances from the hyperplane. However, the actual task of classification does not place any importance on a distance. In order to model this more closely, we propose the Integer Support Vector Machine Classifier (ISVM). ISVM uses binary indicator error variables to directly minimize the number of potential errors the classifier can make.