2008 LearningfromLabeledFeaturesUsin

(Druck et al., 2008) ⇒ Gregory Druck, Gideon Mann, and Andrew McCallum. (2008). “Learning from Labeled Features Using Generalized Expectation Criteria.” In: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval. doi:10.1145/1390334.1390436

Subject Headings: Weakly Labeled Training Data.

Notes

Cited By

Quotes

Author Keywords

^^Learning with Domain Knowledge¸¸, Labeled Features, Semi-Supervised Learning, Text Classification

Abstract

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 domain knowledge in the form of affinities between input features and classes. For example, in a baseball vs. hockey text classification problem, even without any labeled data, we know that the presence of the word puck is a strong indicator of hockey. We refer to this type of domain knowledge as a labeled feature. In this paper, we propose a method for training discriminative probabilistic models with labeled features and unlabeled instances. Unlike previous approaches that use labeled features to create labeled pseudo-instances, we use labeled features directly to constrain the model's predictions on unlabeled instances. We express these soft constraints using generalized expectation (GE) criteria --- terms in a parameter estimation objective function that express preferences on values of a model expectation. In this paper we train multinomial logistic regression models using GE criteria, but the method we develop is applicable to other discriminative probabilistic models. The complete objective function also includes a Gaussian prior on parameters, which encourages generalization by spreading parameter weight to unlabeled features. Experimental results on text classification data sets show that this method outperforms heuristic approaches to training classifiers with labeled features. Experiments with human annotators show that it is more beneficial to spend limited annotation time labeling features rather than labeling instances. For example, after only one minute of labeling features, we can achieve 80% accuracy on the ibm vs. mac text classification problem using GE-FL, whereas ten minutes labeling documents results in an accuracy of only 77%

References

,

	Author	volume	Date Value	title	type	journal	titleUrl	doi	note	year
2008 LearningfromLabeledFeaturesUsin	Gregory Druck Gideon Mann			Learning from Labeled Features Using Generalized Expectation Criteria				10.1145/1390334.1390436