Anzeige
Erschienen in:
2015 | OriginalPaper | Buchkapitel
Sentiment Classification with Graph Sparsity Regularization
verfasst von : Xin-Yu Dai, Chuan Cheng, Shujian Huang, Jiajun Chen
Erschienen in: Computational Linguistics and Intelligent Text Processing
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Text representation is a preprocessing step in building a classifier for sentiment analysis. But in vector space model (VSM) or bag-of -features (BOF) model, features are independent of each other when to learn a classifier model. In this paper, we firstly explore the text graph structure which can represent the structural features in natural language text. Different to the BOF model, by directly embedding the features into a graph, we propose a graph sparsity regularization method which can make use of the the graph embedded features. Our proposed method can encourage a sparse model with a small number of features connected by a set of paths. The experiments on sentiment classification demonstrate our proposed method can get better results comparing with other methods. Qualitative discussion also shows that our proposed method with graph-based representation is interpretable and effective in sentiment classification task.