Graph ranking for sentiment transfer
Published 1 January 2009Open access
Qiong Wu, Songbo Tan, Xueqi Cheng
Citations65
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
A novel approach is proposed, which integrates the sentiment orientations of documents into the graph-ranking algorithm using the accurate labels of old- domain documents as well as the "pseudo" labels of new-domain documents.
Abstract
With the aim to deal with sentiment-transfer problem, we proposed a novel approach, which integrates the sentiment orientations of documents into the graph-ranking algorithm. We apply the graph-ranking algorithm using the accurate labels of old-domain documents as well as the "pseudo" labels of new-domain documents. Experimental results show that proposed algorithm could improve the performance of baseline methods dramatically for sentiment transfer.
Keywords
Computer Science
Thumbs up?
6,987 Citations2002Bo Pang, Lillian Lee +1 more
This work considers the problem of classifying documents not by topic, but by overall sentiment, e.g., determining whether a review is positive or negative, and concludes by examining factors that make the sentiment classification problem more challenging.
now publishers, Inc. eBooksOpinion Mining and Sentiment Analysis
6,745 Citations2008Bo Pang, Lillian Lee
arXiv (Cornell University)Thumbs up? Sentiment Classification using Machine Learning Techniques
2,208 Citations2002Bo Pang, Lillian Lee +1 more
Biographies, Bollywood, Boom-boxes and Blenders: Domain Adaptation for Sentiment Classification
2,026 Citations2007John Blitzer, Mark Dredze +1 more
This work extends to sentiment classification the recently-proposed structural correspondence learning (SCL) algorithm, reducing the relative error due to adaptation between domains by an average of 30% over the original SCL algorithm and 46% over a supervised baseline.
Opinion Mining and Sentiment Analysis
480 Citations2011Bing Liu
This chapter focuses on mining opinions which indicate positive or negative sentiments, which are of great importance for businesses and consumers wanting to find public or consumer opinions on their products and services.
Recent Advances in Natural Language ProcessingCustomizing Sentiment Classifiers to New Domains: a Case Study
370 Citations2005Anthony Aue, Michael Gamon
Four different approaches to customizing a sentiment classification system to a new target domain in the absence of large amounts of labeled data are surveyed and their advantages, disadvantages and performance are discussed.
Expert Systems with ApplicationsAn effective refinement strategy for KNN text classifier
275 Citations2005S TAN
This paper proposes a new refinement strategy, which is called as DragPushing, for the K-Nearest Neighbors Classifier, and shows that DragP pushing achieved a significant improvement on the performance of the KNN Classifier.
Lecture notes in computer scienceAdapting Naive Bayes to Domain Adaptation for Sentiment Analysis
190 Citations2009Songbo Tan, Xueqi Cheng +2 more
The experimental results indicate that proposed approach could improve the performance of base classifier dramatically, and even provide much better performance than the transfer-learning baseline, i.e. the Naive Bayes Transfer Classifier (NTBC).
When Specialists and Generalists Work Together: Overcoming Domain Dependence in Sentiment Tagging
165 Citations2008Alina Andreevskaia, Sabine Bergler
A sentiment annotation system that integrates a corpus-based classifier trained on a small set of annotated in-domain data and a lexicon-based system trained on WordNet, and a new system consisting of the ensemble of two classifiers with precision-based vote weighting that provides significant gains in accuracy and recall.
A novel scheme for domain-transfer problem in the context of sentiment analysis
113 Citations2007Songbo Tan, Gaowei Wu +2 more
The experimental results demonstrate that proposed scheme can significantly boost the accuracy of the base sentiment classifier on new domain.
A novel refinement approach for text categorization
106 Citations2005Songbo Tan, Xueqi Cheng +3 more
The results indicate that in each case, the refined classifiers achieve significant performance improvement over the base classifiers used, and the performance of the Refined Centroid Classifier implemented is comparable, if not better, to that of state-of-the-art support vector machine (SVM)-based classifier, but offers a much lower computational cost.
On Learning Parsimonious Models for Extracting Consumer Opinions
28 Citations2005Xue Bai, Rema Padman +1 more
Using Cross-Document Random Walks for Topic-Focused Multi-Document
25 Citations2006Xiaojun Wan, Jianwu Yang +1 more
The relevance of the sentences to the specified topic is integrated into the graph-ranking based method for topic-focused multi-document summarization and the great importance of the cross-document relationships between sentences is demonstrated.
Random-Walk Models of Term Semantics: An Application to Opinion-Related Properties
23 Citations2007Andrea Esuli, Fabrizio Sebastiani
This paper contends that two other random-walk algorithms may be equally adequate to this task, and provides an intuitive justification to support this claim.
Using unlabeled data to handle domain-transfer problem of semantic detection
8 Citations2008Songbo Tan, Yuefen Wang +2 more
This work attempts to tackle the problem of transferring supervised sentiment classifiers by combining old-domain labeled examples with new-domain unlabeled ones, and dramatically boosts the accuracy of the base sentiment classifier on new domain.