SIGN IN
SIGN UP
Batch and online learning algorithms for nonconvex neyman-pearson classification
Full Text:
PDF
Buy this Article
Authors:
Gilles Gasso
LITIS INSA, Rouen, France
Aristidis Pappaioannou
NEC Labs, Princeton, NJ
Marina Spivak
NEC Labs, Princeton, NJ
Léon Bottou
NEC Labs, Princeton, NJ
2011 Article
Research
Refereed
Bibliometrics
· Downloads (6 Weeks): 5
· Downloads (12 Months): 41
· Downloads (cumulative): 131
· Citation Count: 0
Published in:
· Journal
ACM Transactions on Intelligent Systems and Technology (TIST)
archive
Volume 2 Issue 3, April 2011
Article No. 28
ACM
New York, NY
, USA
table of contents
doi>
10.1145/1961189.1961200
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
classifier design and evaluation
dc algorithm
neyman-pearson
nonconvex svm
online learning
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder