2005
DOI: 10.1007/11430919_37
|View full text |Cite
|
Sign up to set email alerts
|

Sentiment Classification Using Word Sub-sequences and Dependency Sub-trees

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
78
0
10

Year Published

2011
2011
2024
2024

Publication Types

Select...
5
1
1

Relationship

0
7

Authors

Journals

citations
Cited by 148 publications
(88 citation statements)
references
References 7 publications
0
78
0
10
Order By: Relevance
“…Finally, the sentences of a new review are classified based on the highest-ranking matching pattern. This is in contrast to the work in [16], which treats dependency tree patterns as features in an SVM classifier.…”
Section: Introductionmentioning
confidence: 85%
See 3 more Smart Citations
“…Finally, the sentences of a new review are classified based on the highest-ranking matching pattern. This is in contrast to the work in [16], which treats dependency tree patterns as features in an SVM classifier.…”
Section: Introductionmentioning
confidence: 85%
“…Matsumoto et al [16] is the closest work to our proposed method, which we experimentally compare in the Results section. They extract frequent word sub-sequences and dependency subtrees from the training data and use them as features in an SVM sentiment classifier.…”
Section: Sentiment Analysis With Dependency Treesmentioning
confidence: 99%
See 2 more Smart Citations
“…Most sentiment classification experiments were carried out by using Support Vector Machine (SVM) [12], Naive Bayes [18], Decision Trees [19], Maximum Entropy [20] and Conditional Random Fields (CRFs) [14]. The sentiment classification experiment implemented by [15] proved that CRFs classifiers outperform SVM classifiers.…”
Section: Related Workmentioning
confidence: 99%