124 search results - page 6 / 25 » Learning from Positive and Unlabeled Examples with Different... |
PLDI
2011
ACM
12 years 10 months ago
2011
ACM
Software modifications are often systematic—they consist of similar, but not identical, program changes to multiple contexts. Existing tools for systematic program transformati...
IJCAI
2007
13 years 8 months ago
2007
Traditional classification involves building a classifier using labeled training examples from a set of predefined classes and then applying the classifier to classify test instan...
ECML
2003
Springer
14 years 18 days ago
2003
Springer
We present an algorithm for learning context free grammars from positive structural examples (unlabeled parse trees). The algorithm receives a parameter in the form of a finite se...
ACL
2012
11 years 9 months ago
2012
The named entity disambiguation task is to resolve the many-to-many correspondence between ambiguous names and the unique realworld entity. This task can be modeled as a classifi...
COLT
2003
Springer
14 years 18 days ago
2003
Springer
The application of statistical methods to natural language processing has been remarkably successful over the past two decades. But, to deal with recent problems arising in this ...