Elamur Research⌕
☰
home / papers / 2007 / Biographies, Bollywood, Boom-boxes and Blenders: Domain Adaptation for Sentiment Classification

Biographies, Bollywood, Boom-boxes and Blenders: Domain Adaptation for Sentiment Classification

Summary

Sentiment classifiers trained on one kind of review often lose accuracy on others, and labeling data for every new product category is costly. The authors study cross-domain transfer for binary review polarity. They build a new Amazon corpus with reviews from four categories: books, DVDs, electronics and kitchen appliances. They then extend structural correspondence learning (SCL) in two ways. First, pivot features are chosen not only because they are frequent in both domains but also because of their mutual information with the source labels (SCL-MI). Second, a small number of labeled target examples is used to fix cases where SCL links features incorrectly. On average, these changes cut the relative error caused by domain shift by 30% compared with original SCL and by 46% compared with a non-adapted baseline. The authors also show that the A-distance, which needs only unlabeled data, correlates well with adaptation loss. This makes it a practical tool for deciding which few domains are worth annotating as sources.

Key points

  • Dataset. The Amazon reviews corpus has four domains, each with 1000 positive and 1000 negative reviews.
    • Reviews above 3 stars count as positive and below 3 as negative; 3-star reviews are discarded.
    • Each domain is split 1600 for training and 400 for testing.
    • Each domain also has 3685 (DVDs) to 5945 (kitchen) unlabeled reviews.
  • Classifier setup. The model is a linear classifier over unigram and bigram features, trained with Huber loss and stochastic gradient descent.
    • SCL uses k = 50 singular vectors.
    • Pivots must appear in more than five documents per domain.
  • Example result (DVDs → books). The baseline reaches 72.8%, SCL-MI reaches 79.7%, and the in-domain classifier reaches 80.4%. SCL-MI therefore removes about 90.8% of the adaptation loss.
  • Domain grouping. The domains form two clusters: books/DVDs and electronics/kitchen. For kitchen → electronics, SCL-MI even beats the in-domain classifier, apparently thanks to information in the unlabeled data.
  • Feature overlap. For books versus kitchen, 85–90% of each domain's top 1000 informative features are not among the other domain's most informative ones.

Interesting ideas

  • I1. Task-aware pivot selection. Pick bridge features that are both shared across domains and strongly tied to the label, not just frequent. Frequent shared words suit tasks like POS tagging, but for semantic tasks they are mostly noise. This filter could carry over to any representation-alignment method for new text genres, such as Ukrainian news versus social media.
  • I2. Correspondence via shared co-occurrence. Domain-specific phrases can be aligned without any labels if they correlate with the same pivot words in unlabeled text. For example, a phone-specific phrase and a laptop-specific phrase may both co-occur with "excellent". This is a cheap way to transfer lexical knowledge when target labels are scarce.
  • I3. Limited use of target labels. When a few labeled target examples exist, the authors update only the part of the model tied to the learned projection rather than retraining everything. This fits small budgets because it corrects misaligned features without overfitting the full weight vector.
  • I4. Unlabeled domain distance to guide annotation. The A-distance, measured from unlabeled data alone, can rank candidate source domains before any annotation money is spent. This is useful for planning which corpora or regions to label first.
  • I5. Similar sources beat a diverse mix. In the authors' experiments, a source close to the target worked better than mixing several sources for the same amount of labeled data. This challenges the habit of simply pooling all available data when building training sets.

Our summary of the paper, in our own words — not its text. The work belongs to its authors; read it at the links above.

Fields: Natural language processing

Cited by

383 papers of our library cite it (of the 140884 whose bibliographies we read); 16 of them have a page here, 367 not yet.

Cite

The paper itself, not this page. BibTeX from the library's record of the work.

@inproceedings{blitzer2007biographies,
  title = {{Biographies, Bollywood, Boom-boxes and Blenders: Domain Adaptation for Sentiment Classification}},
  author = {Blitzer, John and Dredze, Mark and Pereira, Fernando},
  booktitle = {Proceedings of the 45th Annual Meeting of the Association of Computational Linguistics},
  year = {2007},
  url = {https://aclanthology.org/P07-1056/}
}

References

13 references, 5 of them with a card of ours. ↗ leads to the work, «find» searches for one we have no id for yet.

  1. Rie Ando and Tong Zhang. 2005. A framework for learning predictive structures from multiple tasks and unlabeled data. JMLR, 6:1817–1853. find
  2. Anthony Aue and Michael Gamon. 2005. Customizing sentiment classifiers to new domains: a case study. http://research.microsoft.com/ anthaue/. ↗
  3. Shai Ben-David, John Blitzer, Koby Crammer, and Fernando Pereira. 2006. Analysis of representations for domain adaptation. In Neural Information Processing Systems (NIPS). find
  4. John Blitzer, Ryan McDonald, and Fernando Pereira. 2006. Domain adaptation with structural correspondence learning. In Empirical Methods in Natural Language Processing (EMNLP). find our card
  5. Ciprian Chelba and Alex Acero. 2004. Adaptation of maximum entropy capitalizer: Little data can help a lot. In EMNLP. find
  6. Sanjiv Das and Mike Chen. 2001. Yahoo! for amazon: Extracting market sentiment from stock message boards. In Proceedings of Athe Asia Pacific Finance Association Annual Conference. find
  7. R. Florian, H. Hassan, A.Ittycheriah, H. Jing, N. Kambhatla, X. Luo, N. Nicolov, and S. Roukos. 2004. A statistical model for multilingual entity detection and tracking. In of HLT-NAACL. find
  8. Andrew Goldberg and Xiaojin Zhu. 2004. Seeing stars when there aren’t many stars: Graph-based semi-supervised learning for sentiment categorization. In HLT-NAACL 2006 Workshop on Textgraphs: Graph-based Algorithms for Natural Language Processing. find
  9. Bo Pang and Lillian Lee. 2005. Seeing stars: Exploiting class relationships for sentiment categorization with respect to rating scales. In Proceedings of Association for Computational Linguistics. find our card
  10. Bo Pang, Lillian Lee, and Shivakumar Vaithyanathan. 2002. Thumbs up? sentiment classification using machine learning techniques. In Proceedings of Empirical Methods in Natural Language Processing. find our card
  11. Matt Thomas, Bo Pang, and Lillian Lee. 2006. Get out the vote: Determining support or opposition from congressional floor-debate transcripts. In Empirical Methods in Natural Language Processing (EMNLP). find our card
  12. Peter Turney. 2002. Thumbs up or thumbs down? semantic orientation applied to unsupervised classification of reviews. In Proceedings of Association for Computational Linguistics. find our card
  13. Tong Zhang. 2004. Solving large scale linear prediction problems using stochastic gradient descent algorithms. In International Conference on Machine Learning (ICML). find

↑ back to top

This page in Markdown → https://md.research.elamur.ai/free/en/papers/blitzer-2007-biographies-bollywood-boom-boxes-blenders/