Sciweavers

683 search results - page 119 / 137
» Generalization Bounds for Learning Kernels
Sort
View
COLT
2005
Springer
14 years 27 days ago
Margin-Based Ranking Meets Boosting in the Middle
Abstract. We present several results related to ranking. We give a general margin-based bound for ranking based on the L∞ covering number of the hypothesis space. Our bound sugge...
Cynthia Rudin, Corinna Cortes, Mehryar Mohri, Robe...
JMLR
2006
99views more  JMLR 2006»
13 years 7 months ago
Worst-Case Analysis of Selective Sampling for Linear Classification
A selective sampling algorithm is a learning algorithm for classification that, based on the past observed data, decides whether to ask the label of each new instance to be classi...
Nicolò Cesa-Bianchi, Claudio Gentile, Luca ...
BMCBI
2005
117views more  BMCBI 2005»
13 years 7 months ago
An SVM-based system for predicting protein subnuclear localizations
Background: The large gap between the number of protein sequences in databases and the number of functionally characterized proteins calls for the development of a fast computatio...
Zhengdeng Lei, Yang Dai
WWW
2011
ACM
13 years 2 months ago
A self-training approach for resolving object coreference on the semantic web
An object on the Semantic Web is likely to be denoted with multiple URIs by different parties. Object coreference resolution is to identify “equivalent” URIs that denote the ...
Wei Hu, Jianfeng Chen, Yuzhong Qu
DAGM
2011
Springer
12 years 7 months ago
Agnostic Domain Adaptation
The supervised learning paradigm assumes in general that both training and test data are sampled from the same distribution. When this assumption is violated, we are in the setting...
Alexander Vezhnevets, Joachim M. Buhmann