Referenced Items are not available for this document.
We apply nonsmooth optimization techniques to classification problems, with particular reference to the transductive support vector machine (TSVM) approach, where the considered decision function is nonconvex and nondifferentiable, hence difficult to minimize. We present some numerical results obtained by running the proposed method on some standard test problems drawn from the binary classification literature.
Published in:
Pattern Analysis and Machine Intelligence, IEEE Transactions on
(Volume:29
,
Issue:
12
)
Date of Publication: Dec. 2007
- Page(s):
- 2135 - 2142
- ISSN :
- 0162-8828
- INSPEC Accession Number:
- 9660917
- Digital Object Identifier :
- 10.1109/TPAMI.2007.1102
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 05 November 2007
- Issue Date :
- Dec. 2007
- Sponsored by :
- IEEE Computer Society
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
