Sciweavers

10054 search results - page 157 / 2011
» On the Complexity of Function Learning
Sort
View
FOCS
1999
IEEE
15 years 5 months ago
Boosting and Hard-Core Sets
This paper connects two fundamental ideas from theoretical computer science: hard-core set construction, a type of hardness amplification from computational complexity, and boosti...
Adam Klivans, Rocco A. Servedio
109
Voted
TMI
2008
154views more  TMI 2008»
15 years 16 days ago
Brain Anatomical Structure Segmentation by Hybrid Discriminative/Generative Models
In this paper, a hybrid discriminative/generative model for brain anatomical structure segmentation is proposed. The learning aspect of the approach is emphasized. In the discrimin...
Zhuowen Tu, Katherine Narr, Piotr Dollár, I...
KES
2008
Springer
15 years 18 days ago
Classification and Retrieval through Semantic Kernels
Abstract. This work proposes a family of language-independent semantic kernel functions defined for individuals in an ontology. This allows exploiting wellfounded kernel methods fo...
Claudia d'Amato, Nicola Fanizzi, Floriana Esposito
78
Voted
GECCO
2009
Springer
110views Optimization» more  GECCO 2009»
15 years 5 months ago
EMO shines a light on the holes of complexity space
Typical domains used in machine learning analyses only partially cover the complexity space, remaining a large proportion of problem difficulties that are not tested. Since the ac...
Núria Macià, Albert Orriols-Puig, Es...
ECML
1993
Springer
15 years 4 months ago
Complexity Dimensions and Learnability
In machine learning theory, problem classes are distinguished because of di erences in complexity. In 6 , a stochastic model of learning from examples was introduced. This PAClear...
Shan-Hwei Nienhuys-Cheng, Mark Polman