Work

A Simple Algorithm for Maximum Margin Classification, Revisited

Year: 2015

Type: preprint

Abstract: 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.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.1507.01563

Author: Har-Peled, Sariel

Institution: University of Illinois Urbana-Champaign

Language: English

Topic: Machine Learning and Algorithms

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funder: National Science Foundation

Awards: AF: Small: Towards better geometric algorithms: Summarizing, partitioning and shrinking data, AF: Small: Efficient Proximity and Similarity Search in Computational Geometry

OpenAlex ID: W1899600225

Cites: 1

Cited by: 8

Related to: 10