Abstract
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.
This research was supported by NSFC (61472183, 61170181).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Duric, A., Song, F.: Feature Selection for Sentiment Analysis Based on Content and Syntax Models. In: Proceedings of the 2nd Workshop on Computational Approaches to Subjectivity and Sentiment Analysis, ACL-HLT (2011)
Socher, R., Pennington, J., Huang, E.H., Andrew, Y.N., Manning, C.D.: Semi-supervised recursive autoencoders for predicting sentiment distributions. In: Proceedings of the 2011 Conference on Empirical Methods in Natural Language Processing (EMNLP) (2011)
Xia, R., Zong, C.Q., Li, S.S.: Ensemble of feature sets and classification algorithms for sentiment classification. Information Sciences 181(6), 1138–1152 (2011)
Das, S.R., Chen, M.Y.: Yahoo! for Amazon: Sentiment extraction from small talk on the Web. Management Science 53(9), 1375–1388 (2007)
Ponomareva, N., Thelwall, M.: Do neighbours help? an exploration of graphbased algorithms for cross-domain sentiment classification. In: Proceedings of the 2012 EMNLP-CoNLL, Jeju Island, Korea, pp. 655–665 (2012)
Wu, Y.B., Zhang, Q., Huang, X.J., Wu, L.D.: Structural Opinion Mining for Graph-based Sentiment Representation. In: Proceedings of the 2011 EMNLP, Edinburgh, Scotland, UK, pp. 1332–1341 (2011)
Kim, S.-M., Hovy, E.: Determining the Sentiment of Opinions. In: Proceedings of the 20th International Conference on Computational Linguistics. Association for Computational Linguistics (2004)
Pang, B., Lee, L., Vaithyanathan, S.: Thumbs up? Sentiment classification using machine learning techniques. In: Proceedings of EMNLP (2002)
Martins, A.F.T., Smith, N.A., Aguiar, P.M.Q., Figueiredo, M.A.T.: Structured Sparsity in Structured Prediction. In: Proceedings of EMNLP (2011)
Socher, R., Bauer, J., Manning, C.D., Andrew, Y.N.: Parsing With Compositional Vector Grammars. In: Proceedings of ACL (2013)
Fu, Q., Dai, X., Huang, S., Chen, J.: Forgetting word segmentation in Chinese text classification with L1-regularized logistic regression. In: Pei, J., Tseng, V.S., Cao, L., Motoda, H., Xu, G. (eds.) PAKDD 2013, Part II. LNCS, vol. 7819, pp. 245–255. Springer, Heidelberg (2013)
Tibshirani, R.: Regression Shrinkage and Selection Via the Lasso. Journal of the Royal Statistical Society, Series B 58(1), 267–288 (1994)
Yang, Y.M., Pedersen, J.O.: A comparative study on feature selection in text categorization. In: Proceedings ICML (1997)
Rafrafi, A., Guigue, V., Gallinari, P.: Coping with the Document Frequency Bias in Sentiment Classification. In: AAAI ICWSM (2012)
Buhlmann, P.L., van de Geer, S.A., Van de Geer, S.: Statistics for High-dimensional Data Methods, Theory and Applications. Springer, Heidelberg (2011)
Huang, J., Zhang, Z., Metaxas, D.: Learning with structured sparsity. Journal of Machine Learning Research 12, 3371–3412 (2011)
Bach, F., Jenatton, R., Mairal, J., Obozinski, G.: Optimization with sparsity-inducing penalties. Foundations and Trends in Machine Learning 4(1), 1–106 (2012)
Aggarwal, C.C., Zhao, P.X.: Towards graphical models for text processing. Knowledge and Information Systems (2013)
Mairal, J., Yu, B.: Supervised Feature Selection in Graphs with Path Coding Penalties and Network Flows. Journal of Machine Learning Research (2013)
Jacob, L., Obozinski, G., Vert, J.-P.: Group Lasso with overlap and graph Lasso. In: Proceedings of the International Conference on Machine Learning (ICML) (2009)
Fan, R.E., Chang, K.W., Hsieh, C.J., Wang, X.R., Lin, C.J.: LIBLINEAR: A library for large linear classification. Journal of Machine Learning Research 9, 1871–1874 (2008)
Chang, C.C., Lin, C.J.: LIBSVM: A library for support vector machines. ACM Transactions on Intelligent Systems and Technology 2 (2011)
Nakagawa, T., Inui, K., Kurohashi, S.: Dependency tree-based sentiment classification using CRFs with hidden variables. In: Proceedings of ACL:HLT (2010)
Socher, R., Pennington, J., Huang, E.H., Andrew, Y.N., Manning, C.D.: Semi-Supervised Recursive Autoencoders for Predicting Sentiment Distributions. In: Proceedings of EMNLP (2011)
Pang, B., Lee, L.: A Sentimental Education: Sentiment Analysis Using Subjectivity Summarization Based on Minimum Cuts. In: Proceedings of ACL (2004)
Goodman, J.: Exponential priors for maximum entropy models. In: Proceedings of the Annual Meeting of the Association for Computational Linguistics (2004)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Dai, XY., Cheng, C., Huang, S., Chen, J. (2015). Sentiment Classification with Graph Sparsity Regularization. In: Gelbukh, A. (eds) Computational Linguistics and Intelligent Text Processing. CICLing 2015. Lecture Notes in Computer Science(), vol 9042. Springer, Cham. https://doi.org/10.1007/978-3-319-18117-2_11
Download citation
DOI: https://doi.org/10.1007/978-3-319-18117-2_11
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-18116-5
Online ISBN: 978-3-319-18117-2
eBook Packages: Computer ScienceComputer Science (R0)