Sciweavers

4377 search results - page 733 / 876
» Mass problems and randomness
Sort
View
COLT
2008
Springer
14 years 11 months ago
On the Power of Membership Queries in Agnostic Learning
We study the properties of the agnostic learning framework of Haussler [Hau92] and Kearns, Schapire and Sellie [KSS94]. In particular, we address the question: is there any situat...
Vitaly Feldman
DIALM
2008
ACM
135views Algorithms» more  DIALM 2008»
14 years 11 months ago
Symmetric range assignment with disjoint MST constraints
If V is a set of n points in the unit square [0, 1]2 , and if R : V + is an assignment of positive real numbers (radii) to to those points, define a graph G(R) as follows: {v, w}...
Eric Schmutz
EPEW
2008
Springer
14 years 11 months ago
Evaluation of P2P Algorithms for Probabilistic Trust Inference in a Web of Trust
The problem of finding trust paths and estimating the trust one can place in a partner arises in various application areas, including virtual organisations, authentication systems ...
Huqiu Zhang, Aad P. A. van Moorsel
AI
2010
Springer
14 years 11 months ago
Improving Multiclass Text Classification with Error-Correcting Output Coding and Sub-class Partitions
Error-Correcting Output Coding (ECOC) is a general framework for multiclass text classification with a set of binary classifiers. It can not only help a binary classifier solve mul...
Baoli Li, Carl Vogel
ALT
2010
Springer
14 years 11 months ago
Online Multiple Kernel Learning: Algorithms and Mistake Bounds
Online learning and kernel learning are two active research topics in machine learning. Although each of them has been studied extensively, there is a limited effort in addressing ...
Rong Jin, Steven C. H. Hoi, Tianbao Yang