1601 search results - page 40 / 321 » Closed Sets for Labeled Data |
COMBINATORICS
2006
13 years 10 months ago
2006
Simple families of increasing trees can be constructed from simply generated tree families, if one considers for every tree of size n all its increasing labellings, i. e. labellin...
SIGIR
2008
ACM
13 years 10 months ago
2008
ACM
It is difficult to apply machine learning to new domains because often we lack labeled problem instances. In this paper, we provide a solution to this problem that leverages domai...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
Hardness results for maximum agreement problems have close connections to hardness results for proper learning in computational learning theory. In this paper we prove two hardnes...
CVPR
2011
IEEE
13 years 2 months ago
2011
IEEE
Simultaneously segmenting and labeling images is a fundamental problem in Computer Vision. In this paper, we introduce a hierarchical CRF model to deal with the problem of labelin...
CEAS
2007
Springer
14 years 2 months ago
2007
Springer
Active learning methods seek to reduce the number of labeled examples needed to train an effective classifier, and have natural appeal in spam filtering applications where trustwo...