conference-paper Open access

Leveraging Latent Sentiment Constraint in Probabilistic Matrix Factorization for Cross-domain Sentiment Classification

  • Procedia Computer Science
  • Elsevier BV
Research footprint

At a glance

Citations
6
References
21
Comments
0
Paper overview

Öz

Sentiment analysis is concerned with classifying a subjective text into positive or negative according to the opinion expressed in it. The performance of traditional sentiment classification algorithms rely heavily on manually labeled training data. However, not every domain has the labeled data because the labeling work is time-consuming and expensive. In this paper, we propose a latent sentiment factorization (LSF) algorithm based on probabilistic matrix factorization technique for cross-domain sentiment classification. LSF works in the setting where there are only labeled data in the source domain and unlabeled data in the target domain. It bridges the gap between domains by exploiting the sentiment correlations between domain-shared and domain-specific words in a two-dimensional sentiment space. Experimental results demonstrate the superiority of our method over the state-of-the-art approaches.

Record transparency

Publication details

DOI
10.1016/j.procs.2016.05.353
OpenAlex
W2462643775
Document type
conference-paper
Language
EN
Source
Procedia Computer Science
Last metadata update
Community

Comments

Oturum Açın to join the discussion.

  1. No comments yet. Start the discussion.