ACM Home Page
Please provide us with feedback. Feedback
Rated aspect summarization of short comments
Full text PdfPdf (1.34 MB)
Source
International World Wide Web Conference archive
Proceedings of the 18th international conference on World wide web table of contents
Madrid, Spain
SESSION: Data mining/session: opinions table of contents
Pages 131-140  
Year of Publication: 2009
ISBN:978-1-60558-487-4
Authors
Yue Lu  University of Illinois at Urbana-Champaign, Urbana, USA
ChengXiang Zhai  University of Illinois at Urbana-Champaign, Urbana, USA
Neel Sundaresan  eBay Research Labs, San Jose, USA
Sponsor
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 23,   Downloads (12 Months): 154,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1526709.1526728
What is a DOI?

ABSTRACT

Web 2.0 technologies have enabled more and more people to freely comment on different kinds of entities (e.g. sellers, products, services). The large scale of information poses the need and challenge of automatic summarization. In many cases, each of the user-generated short comments comes with an overall rating. In this paper, we study the problem of generating a ``rated aspect summary'' of short comments, which is a decomposed view of the overall ratings for the major aspects so that a user could gain different perspectives towards the target entity. We formally define the problem and decompose the solution into three steps. We demonstrate the effectiveness of our methods by using eBay sellers' feedback comments. We also quantitatively evaluate each step of our methods and study how well human agree on such a summarization task. The proposed methods are quite general and can be used to generate rated aspect summary automatically given any collection of short comments each associated with an overall rating.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
H. Cui, V. Mittal, and M. Datar. Comparative experiments on sentiment classification for online product reviews. In Twenty-First National Conference on Artificial Intelligence, 2006.
 
3
A. P. Dempster, N. M. Laird, and D. B. Rubin. Maximum likelihood from incomplete data via the EM algorithm. Journal of Royal Statist. Soc. B, 39:1--38, 1977.
 
4
T. Hofmann. Probabilistic latent semantic analysis. In Proc. of Uncertainty in Artificial Intelligence, Stockholm, 1999.
5
6
 
7
8
 
9
L. Lovasz and M. Plummer. Matching theory. In Annals of Discrete Mathematics, North Holland, Amsterdam, 1986.
 
10
J. B. MacQueen. Some methods for classification and analysis of multivariate observations. In Proc. of the fifth Berkeley Symposium on Mathematical Statistics and Probability, volume 1, pages 281--297. University of California Press, 1967.
11
12
 
13
 
14
 
15
 
16
B. Snyder and R. Barzilay. Multiple aspect ranking using the good grief algorithm. In HLT-NAACL, 2007.
 
17
I. Titov and R. McDonald. A joint model of text and aspect ratings for sentiment summarization. In Proceedings of ACL-08: HLT, pages 308--316, June 2008.
 
18
19
20

Collaborative Colleagues:
Yue Lu: colleagues
ChengXiang Zhai: colleagues
Neel Sundaresan: colleagues