Sciweavers

388 search results - page 13 / 78
» The covering number in learning theory
Sort
View
BSL
2011
13 years 2 months ago
Combinatorial dichotomies in set theory
show that an abstract analysis of one of these three set theoretic principles can sometimes lead us to results that do not require additional axioms at all but which could have bee...
Stevo Todorcevic
ECML
2006
Springer
13 years 11 months ago
(Agnostic) PAC Learning Concepts in Higher-Order Logic
This paper studies the PAC and agnostic PAC learnability of some standard function classes in the learning in higher-order logic setting introduced by Lloyd et al. In particular, i...
Kee Siong Ng
ICTAI
2010
IEEE
13 years 4 months ago
Unsupervised Greedy Learning of Finite Mixture Models
This work deals with a new technique for the estimation of the parameters and number of components in a finite mixture model. The learning procedure is performed by means of a expe...
Nicola Greggio, Alexandre Bernardino, Cecilia Lasc...
ICML
2010
IEEE
13 years 8 months ago
Large Graph Construction for Scalable Semi-Supervised Learning
In this paper, we address the scalability issue plaguing graph-based semi-supervised learning via a small number of anchor points which adequately cover the entire point cloud. Cr...
Wei Liu, Junfeng He, Shih-Fu Chang
ACL
2010
13 years 5 months ago
Weakly Supervised Learning of Presupposition Relations between Verbs
Presupposition relations between verbs are not very well covered in existing lexical semantic resources. We propose a weakly supervised algorithm for learning presupposition relat...
Galina Tremper