Sciweavers

10054 search results - page 78 / 2011
» On the Complexity of Function Learning
Sort
View
90
Voted
ICML
2007
IEEE
16 years 1 months ago
A bound on the label complexity of agnostic active learning
We study the label complexity of pool-based active learning in the agnostic PAC model. Specifically, we derive general bounds on the number of label requests made by the A2 algori...
Steve Hanneke
107
Voted
MLG
2007
Springer
15 years 6 months ago
Transductive Rademacher Complexities for Learning Over a Graph
Recent investigations [12, 2, 8, 5, 6] and [11, 9] indicate the use of a probabilistic (’learning’) perspective of tasks defined on a single graph, as opposed to the traditio...
Kristiaan Pelckmans, Johan A. K. Suykens
88
Voted
CIDM
2007
IEEE
15 years 4 months ago
Efficient Kernel-based Learning for Trees
Kernel methods are effective approaches to the modeling of structured objects in learning algorithms. Their major drawback is the typically high computational complexity of kernel ...
Fabio Aiolli, Giovanni Da San Martino, Alessandro ...
JMLR
2010
101views more  JMLR 2010»
14 years 7 months ago
Classification Using Geometric Level Sets
A variational level set method is developed for the supervised classification problem. Nonlinear classifier decision boundaries are obtained by minimizing an energy functional tha...
Kush R. Varshney, Alan S. Willsky
INCDM
2010
Springer
138views Data Mining» more  INCDM 2010»
14 years 11 months ago
Learning Discriminative Distance Functions for Case Retrieval and Decision Support
The importance of learning distance functions is gradually being acknowledged by the machine learning community, and different techniques are suggested that can successfully learn ...
Alexey Tsymbal, Martin Huber, Shaohua Kevin Zhou