Skip to main content

Text Representation Using Dependency Tree Subgraphs for Sentiment Analysis

  • Conference paper
Database Systems for Adanced Applications (DASFAA 2011)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 6637))

Included in the following conference series:

Abstract

A standard approach for supervised sentiment analysis with n-grams features cannot correctly identify complex sentiment expressions due to the loss of information when representing a text using the bag-of-words model. In our research, we propose to use subgraphs from the dependency tree of a parsed sentence as features for sentiment classification. We represent a text with a feature vector based on extracted subgraphs and use state of the art SVM classifier to identify the polarity of the given text. Our experimental evaluations on the movie-review dataset show that using our proposed features outperforms the standard bag-of-words and n-gram models. In this paper, we work with English, however most of our techniques can be easily adapted for other languages.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Arora, S., Mayfield, E., Penstein-Rosé, C., Nyberg, E.: Sentiment classification using automatically extracted subgraph features. In: Proceedings of the NAACL HLT 2010 Workshop on Computational Approaches to Analysis and Generation of Emotion in Text, CAAGET 2010, Morristown, NJ, USA, pp. 131–139. Association for Computational Linguistics (2010)

    Google Scholar 

  2. Aue, A., Gamon, M.: Customizing Sentiment Classifiers to New Domains: a Case Study. In: Proc. International Conference on Recent Advances in NLP (2005)

    Google Scholar 

  3. Becker, I., Aharonson, V.: Last but definitely not least: on the role of the last sentence in automatic polarity-classification. In: Proceedings of the ACL 2010 Conference Short Papers, ACLShort 2010, Morristown, NJ, USA, pp. 331–335. Association for Computational Linguistics (2010)

    Google Scholar 

  4. Chaumartin, F.-R.: Upar7: a knowledge-based system for headline sentiment tagging. In: Proceedings of the 4th International Workshop on Semantic Evaluations, SemEval 2007, Morristown, NJ, USA, pp. 422–425. Association for Computational Linguistics (2007)

    Google Scholar 

  5. de Marneffe, M.-C., Maccartney, B., Manning, C.D.: Generating Typed Dependency Parses from Phrase Structure Parses. In: LREC (2006)

    Google Scholar 

  6. Fan, R.-E., Chang, K.-W., Hsieh, C.-J., Wang, X.-R., Lin, C.-J.: Liblinear: A library for large linear classification. J. Mach. Learn. Res. 9, 1871–1874 (2008)

    MATH  Google Scholar 

  7. Meena, A., Prabhakar, T.V.: Sentence level sentiment analysis in the presence of conjuncts using linguistic analysis. In: Amati, G., Carpineto, C., Romano, G. (eds.) ECIR 2007. LNCS, vol. 4425, pp. 573–580. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  8. Nakagawa, T., Inui, K., Kurohashi, S.: Dependency tree-based sentiment classification using crfs with hidden variables. In: Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics, HLT 2010, Morristown, NJ, USA, pp. 786–794. Association for Computational Linguistics (2010)

    Google Scholar 

  9. Paltoglou, G., Thelwall, M.: A study of information retrieval weighting schemes for sentiment analysis. In: Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics, ACL 2010, Morristown, NJ, USA, pp. 1386–1395. Association for Computational Linguistics (2010)

    Google Scholar 

  10. Pang, B., Lee, L.: A sentimental education: Sentiment analysis using subjectivity summarization based on minimum cuts. In: Proceedings of the ACL, pp. 271–278 (2004)

    Google Scholar 

  11. Pang, B., Lee, L., Vaithyanathan, S.: Thumbs up?: sentiment classification using machine learning techniques. In: Proceedings of the ACL 2002 Conference on Empirical Methods in Natural Language Processing, EMNLP 2002, Morristown, NJ, USA, vol. 10, pp. 79–86. Association for Computational Linguistics (2002)

    Google Scholar 

  12. Whitelaw, C., Garg, N., Argamon, S.: Using appraisal groups for sentiment analysis. In: Proceedings of the 14th ACM International Conference on Information and Knowledge Management, CIKM 2005, pp. 625–631. ACM, New York (2005)

    Google Scholar 

  13. Zhuang, L., Jing, F., Zhu, X.-Y.: Movie review mining and summarization. In: Proceedings of the 15th ACM International Conference on Information and Knowledge Management, CIKM 2006, pp. 43–50. ACM, New York (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pak, A., Paroubek, P. (2011). Text Representation Using Dependency Tree Subgraphs for Sentiment Analysis. In: Xu, J., Yu, G., Zhou, S., Unland, R. (eds) Database Systems for Adanced Applications. DASFAA 2011. Lecture Notes in Computer Science, vol 6637. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20244-5_31

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-20244-5_31

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-20243-8

  • Online ISBN: 978-3-642-20244-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics