LGJul 6, 2015

A Simple Algorithm for Maximum Margin Classification, Revisited

arXiv:1507.01563v17 citations
Originality Synthesis-oriented
AI Analysis

This work is incremental, offering a minor simplification of a known algorithm for classification tasks.

The paper revisits an existing algorithm for computing a linear maximum margin classifier, presenting a slightly simpler version of the original method without reporting new experimental results or performance numbers.

In this note, we revisit the algorithm of Har-Peled et. al. [HRZ07] for computing a linear maximum margin classifier. Our presentation is self contained, and the algorithm itself is slightly simpler than the original algorithm. The algorithm itself is a simple Perceptron like iterative algorithm. For more details and background, the reader is referred to the original paper.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes