Sciweavers

73 search results - page 6 / 15
» The Complexity of Learning Concept Classes with Polynomial G...
Sort
View
ICML
2004
IEEE
14 years 8 months ago
SVM-based generalized multiple-instance learning via approximate box counting
The multiple-instance learning (MIL) model has been very successful in application areas such as drug discovery and content-based imageretrieval. Recently, a generalization of thi...
Qingping Tao, Stephen D. Scott, N. V. Vinodchandra...
ML
2007
ACM
108views Machine Learning» more  ML 2007»
13 years 7 months ago
Unconditional lower bounds for learning intersections of halfspaces
We prove new lower bounds for learning intersections of halfspaces, one of the most important concept classes in computational learning theory. Our main result is that any statist...
Adam R. Klivans, Alexander A. Sherstov
COLT
2001
Springer
14 years 1 days ago
Limitations of Learning via Embeddings in Euclidean Half-Spaces
The notion of embedding a class of dichotomies in a class of linear half spaces is central to the support vector machines paradigm. We examine the question of determining the mini...
Shai Ben-David, Nadav Eiron, Hans-Ulrich Simon
ALT
2005
Springer
14 years 4 months ago
Teaching Learners with Restricted Mind Changes
Within learning theory teaching has been studied in various ways. In a common variant the teacher has to teach all learners that are restricted to output only consistent hypotheses...
Frank J. Balbach, Thomas Zeugmann
ICGI
2010
Springer
13 years 8 months ago
Generalizing over Several Learning Settings
We recapitulate regular one-shot learning from membership and equivalence queries, positive and negative finite data. We present a meta-algorithm that generalizes over as many sett...
Anna Kasprzik