1601 search results - page 135 / 321 » Closed Sets for Labeled Data |
164
click to vote
NAACL
2007
15 years 7 months ago
2007
This paper presents empirical results that contradict the prevailing opinion that entity extraction is a boring solved problem. In particular, we consider data sets that resemble ...
127
click to vote
BTW
2009
Springer
15 years 9 months ago
2009
Springer
: BLINK is a prototype of an in-memory based query processor that exploits heavily the underlying CPU infrastructure. It is very sensitive to the processor’s caches and instructi...
134
click to vote
APAL
2007
15 years 6 months ago
2007
Non-well-founded trees are used in mathematics and computer science, for modelling non-well-founded sets, as well as non-terminating processes or infinite data structures. Catego...
147
click to vote
KDD
2009
ACM
2009
ACM
Quantification and semi-supervised classification methods for handling changes in class distribution
16 years 6 months ago
In realistic settings the prevalence of a class may change after a classifier is induced and this will degrade the performance of the classifier. Further complicating this scenari...
201
click to vote
ICML
2006
IEEE
16 years 7 months ago
2006
IEEE
There has been much work on applying multiple-instance (MI) learning to contentbased image retrieval (CBIR) where the goal is to rank all images in a known repository using a smal...