Please use this identifier to cite or link to this item: http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/7291
Full metadata record
DC FieldValueLanguage
dc.creatorRifkin, Ryan-
dc.creatorPontil, Massimiliano-
dc.creatorVerri, Alessandro-
dc.date2004-10-22T20:17:55Z-
dc.date2004-10-22T20:17:55Z-
dc.date1999-08-11-
dc.date.accessioned2013-10-09T02:48:58Z-
dc.date.available2013-10-09T02:48:58Z-
dc.date.issued2013-10-09-
dc.identifierAIM-1661-
dc.identifierCBCL-177-
dc.identifierhttp://hdl.handle.net/1721.1/7291-
dc.identifier.urihttp://koha.mediu.edu.my:8181/xmlui/handle/1721-
dc.descriptionWhen training Support Vector Machines (SVMs) over non-separable data sets, one sets the threshold $b$ using any dual cost coefficient that is strictly between the bounds of $0$ and $C$. We show that there exist SVM training problems with dual optimal solutions with all coefficients at bounds, but that all such problems are degenerate in the sense that the "optimal separating hyperplane" is given by ${f w} = {f 0}$, and the resulting (degenerate) SVM will classify all future points identically (to the class that supplies more training data). We also derive necessary and sufficient conditions on the input data for this to occur. Finally, we show that an SVM training problem can always be made degenerate by the addition of a single data point belonging to a certain unboundedspolyhedron, which we characterize in terms of its extreme points and rays.-
dc.format10 p.-
dc.format1117769 bytes-
dc.format262084 bytes-
dc.formatapplication/postscript-
dc.formatapplication/pdf-
dc.languageen_US-
dc.relationAIM-1661-
dc.relationCBCL-177-
dc.subjectAI-
dc.subjectMIT-
dc.subjectArtificial Intelligence-
dc.subjectSupport Vector Machines-
dc.subjectScale Sensitive Loss Function-
dc.subjectStatistical Learning Theory.-
dc.titleA Note on Support Vector Machines Degeneracy-
Appears in Collections:MIT Items

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.