ACL '05 Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics
Opinion Mining and Sentiment Analysis
Foundations and Trends in Information Retrieval
Multi-domain sentiment classification
HLT-Short '08 Proceedings of the 46th Annual Meeting of the Association for Computational Linguistics on Human Language Technologies: Short Papers
Domain adaptation with structural correspondence learning
EMNLP '06 Proceedings of the 2006 Conference on Empirical Methods in Natural Language Processing
TextGraphs-1 Proceedings of the First Workshop on Graph Based Methods for Natural Language Processing
Graph ranking for sentiment transfer
ACLShort '09 Proceedings of the ACL-IJCNLP 2009 Conference Short Papers
Cross-domain sentiment classification via spectral feature alignment
Proceedings of the 19th international conference on World wide web
LIBSVM: A library for support vector machines
ACM Transactions on Intelligent Systems and Technology (TIST)
Lexicon-based methods for sentiment analysis
Computational Linguistics
HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies - Volume 1
Biographies or blenders: which resource is best for cross-domain sentiment analysis?
CICLing'12 Proceedings of the 13th international conference on Computational Linguistics and Intelligent Text Processing - Volume Part I
Sentiment strength detection for the social web
Journal of the American Society for Information Science and Technology
Damping sentiment analysis in online communication: discussions, monologs and dialogs
CICLing'13 Proceedings of the 14th international conference on Computational Linguistics and Intelligent Text Processing - Volume 2
Taxonomy-based regression model for cross-domain sentiment classification
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Hi-index | 0.00 |
This paper presents a comparative study of graph-based approaches for cross-domain sentiment classification. In particular, the paper analyses two existing methods: an optimisation problem and a ranking algorithm. We compare these graph-based methods with each other and with the other state-of-the-art approaches and conclude that graph domain representations offer a competitive solution to the domain adaptation problem. Analysis of the best parameters for graph-based algorithms reveals that there are no optimal values valid for all domain pairs and that these values are dependent on the characteristics of corresponding domains.