Domain Adaptation of Conditional Probability Models Via Feature Subsetting

The goal in domain adaptation is to train a model using labeled data sampled from a domain different from the target domain on which the model will be deployed. We exploit unlabeled data from the target domain to train a model that maximizes likelihood over the training sample while minimizing the distance between the training and target distribution. Our focus is conditional probability models used for predicting a label structure y given input x based on features defined jointly over x and y. We propose practical measures of divergence between the two domains based on which we penalize features with large divergence, while improving the effectiveness of other less deviant correlated features. Empirical evaluation on several real-life information extraction tasks using Conditional Random Fields (CRFs) show that our method of domain adaptation leads to significant reduction in error.

• Type: Conference
• Year: 2007
• Where: PKDD
• Authors: Sandeepkumar Satpal, Sunita Sarawagi
• Keywords: Conditional Probability Models, Domain Adaptation, PKDD 2007, Target Domain