2011
DOI: 10.1007/978-3-642-20244-5_31
|View full text |Cite
|
Sign up to set email alerts
|

Text Representation Using Dependency Tree Subgraphs for Sentiment Analysis

Abstract: 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 bagof-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. O… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
17
0

Year Published

2014
2014
2019
2019

Publication Types

Select...
4
2
1

Relationship

1
6

Authors

Journals

citations
Cited by 20 publications
(17 citation statements)
references
References 6 publications
0
17
0
Order By: Relevance
“…The reason for selecting a sample of 1000 is that human annotation is a manual and time-intensive task. Similar research into the classification of emotive texts using a human annotated gold-standard has typically used a sample of 1000 to good effect [24] , [25] , [26] , [27] .…”
Section: The Collection Of Twitter Datamentioning
confidence: 99%
“…The reason for selecting a sample of 1000 is that human annotation is a manual and time-intensive task. Similar research into the classification of emotive texts using a human annotated gold-standard has typically used a sample of 1000 to good effect [24] , [25] , [26] , [27] .…”
Section: The Collection Of Twitter Datamentioning
confidence: 99%
“…All the parsers output in an adapted CoNLL 6 data format. Once we have the parsed output 7 we can extract the patterns and start experimenting.…”
Section: Data Preprocessingmentioning
confidence: 99%
“…Our patterns are dependency sub-trees obtained by generating sub-trees of all possible depth using either or both lemma and POS features. The use of sub-trees for text representation can be found in [7]. the significant features of our sub-tree patterns are, These patterns were extracted (as in [8]) automatically and since we focused on the dependency structure of a sentence, less significant tokens (e.g.…”
Section: Dependency Sub-tree Patternsmentioning
confidence: 99%
“…Pak and Paroubek used subgraphs extracted from the dependency tree of a parsed sentence for constructing the feature vector [12]. They performed experimentations on movie reviews and decided that the subgraph-based features along with SVM classifier gave the best performance.…”
Section: Related Workmentioning
confidence: 99%