Abstract
The goal of sentiment prediction is to automatically identify whether a given piece of text expresses positive or negative opinion towards a topic of interest. One can pose sentiment prediction as a standard text categorization problem, but gathering labeled data turns out to be a bottleneck. Fortunately, background knowledge is often available in the form of prior information about the sentiment polarity of words in a lexicon. Moreover, in many applications abundant unlabeled data is also available. In this paper, we propose a novel semi-supervised sentiment prediction algorithm that utilizes lexical prior knowledge in conjunction with unlabeled examples. Our method is based on joint sentiment analysis of documents and words based on a bipartite graph representation of the data. We present an empirical study on a diverse collection of sentiment prediction problems which confirms that our semi-supervised lexical models significantly outperform purely supervised and competing semi-supervised techniques. © 2008 IEEE.
Cite
CITATION STYLE
Sindhwani, V., & Melville, P. (2008). Document-word co-regularization for semi-supervised sentiment analysis. In Proceedings - IEEE International Conference on Data Mining, ICDM (pp. 1025–1030). https://doi.org/10.1109/ICDM.2008.113
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.