Sciweavers

29 search results - page 1 / 6
» Discriminative Learning of Selectional Preference from Unlab...
Sort
View
EMNLP
2008
13 years 6 months ago
Discriminative Learning of Selectional Preference from Unlabeled Text
We present a discriminative method for learning selectional preferences from unlabeled text. Positive examples are taken from observed predicate-argument pairs, while negatives ar...
Shane Bergsma, Dekang Lin, Randy Goebel
NIPS
1998
13 years 6 months ago
Probabilistic Modeling for Face Orientation Discrimination: Learning from Labeled and Unlabeled Data
This paper presents probabilistic modeling methods to solve the problem of discriminating between five facial orientations with very little labeled data. Three models are explored...
Shumeet Baluja
SIGIR
2008
ACM
13 years 4 months ago
Learning from labeled features using generalized expectation criteria
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...
Gregory Druck, Gideon S. Mann, Andrew McCallum
KDD
2009
ACM
269views Data Mining» more  KDD 2009»
14 years 5 months ago
Extracting discriminative concepts for domain adaptation in text mining
One common predictive modeling challenge occurs in text mining problems is that the training data and the operational (testing) data are drawn from different underlying distributi...
Bo Chen, Wai Lam, Ivor Tsang, Tak-Lam Wong
KDD
2008
ACM
137views Data Mining» more  KDD 2008»
14 years 5 months ago
Learning classifiers from only positive and unlabeled data
The input to an algorithm that learns a binary classifier normally consists of two sets of examples, where one set consists of positive examples of the concept to be learned, and ...
Charles Elkan, Keith Noto