1458 search results - page 55 / 292 » Practical Preference Relations for Large Data Sets |
183
Voted
ACL
2009
15 years 2 months ago
2009
Creating labeled training data for relation extraction is expensive. In this paper, we study relation extraction in a special weakly-supervised setting when we have only a few see...
135
click to vote
BMCBI
2008
15 years 5 months ago
2008
Background: The methodologies we use both enable and help define our research. However, as experimental complexity has increased the choice of appropriate methodologies has become...
141
click to vote
ICML
2009
IEEE
16 years 5 months ago
2009
IEEE
Practical data mining rarely falls exactly into the supervised learning scenario. Rather, the growing amount of unlabeled data poses a big challenge to large-scale semi-supervised...
133
click to vote
ICDM
2006
IEEE
15 years 11 months ago
2006
IEEE
Recently, there has been considerable interest in computing strongly correlated pairs in large databases. Most previous studies require the specification of a minimum correlation...
171
click to vote
CORR
2002
Springer
15 years 4 months ago
2002
Springer
A relational database is inconsistent if it does not satisfy a given set of integrity constraints. Nevertheless, it is likely that most of the data in it is consistent with the co...