loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Proceedings of the 38th Annual Hawaii International Conference on System Sciences (HICSS'05) - Track 3
Big Island, Hawaii
January 03-January 06
ISBN: 0-7695-2268-8
Xue Bai, Carnegie Mellon University
Rema Padman, Carnegie Mellon University
Edoardo Airoldi, Carnegie Mellon University
Extracting sentiments from unstructured text has emerged as an important problem in many disciplines. An accurate method would enable us, for example, to mine on-line opinions from the Internet and learn customers' preferences for economic or marketing research, or for leveraging a strategic advantage. In this paper, we propose a two-stage Bayesian algorithm that is able to capture the dependencies among words, and, at the same time, finds a vocabulary that is efficient for the purpose of extracting sentiments. Experimental results on the Movie Reviews data set show that our algorithm is able to select a parsimonious feature set with substantially fewer predictor variables than in the full data set and leads to better predictions about sentiment orientations than several state-of-the-art machine learning methods. Our findings suggest that sentiments are captured by conditional dependence relations among words, rather than by keywords or high-frequency words.
Citation:
Xue Bai, Rema Padman, Edoardo Airoldi, "On Learning Parsimonious Models for Extracting Consumer Opinions," hicss, vol. 3, pp.75b, Proceedings of the 38th Annual Hawaii International Conference on System Sciences (HICSS'05) - Track 3, 2005
Usage of this product signifies your acceptance of the Terms of Use.