The Margitron: A Generalised Perceptron with Margin

Simple item page
dc.creatorPanagiotakopoulos, Constantinos
dc.creatorTsampouka, Petroula
dc.date2008-05-18
dc.date.accessioned2026-07-07T12:19:01Z
dc.date.available2026-07-07T12:19:01Z
dc.descriptionWe identify the classical Perceptron algorithm with margin as a member of a broader family of large margin classifiers which we collectively call the Margitron. The Margitron, (despite its) sharing the same update rule with the Perceptron, is shown in an incremental setting to converge in a finite number of updates to solutions possessing any desirable fraction of the maximum margin. Experiments comparing the Margitron with decomposition SVMs on tasks involving linear kernels and 2-norm soft margin are also reported.
dc.description18 pages
dc.identifierhttps://arxiv.org/abs/0805.2752
dc.identifierhttp://arxiv.org/abs/0805.2752
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/212610
dc.subjectMachine Learning
dc.titleThe Margitron: A Generalised Perceptron with Margin
dc.typetext

Files

Collections

arXiv