Difference between revisions of "Turney, ACL 2002"

From Cohen Courses
Jump to navigationJump to search
Line 1: Line 1:
 
== Citation ==
 
== Citation ==
  
Jure Leskovec, Lars Backstrom, Jon M. Kleinberg: Meme-tracking and the dynamics of the news cycle. KDD 2009: 497-506.
+
Turney, P. D. 2002. Thumbs up or thumbs down? Semantic orientation applied to unsupervised classification of reviews. In Proceedings of the 40th annual meeting of the Association for Computational Linguistics, 417–424.
  
 
== Online version ==
 
== Online version ==
  
[http://snap.stanford.edu/class/cs224w-readings/leskovec09meme.pdf]
+
[http://acl.ldc.upenn.edu/P/P02/P02-1053.pdf ACL anthology]
  
 
== Summary ==
 
== Summary ==
This is a highly cited KDD paper [[Category::paper]] presenting an unsupervised approach to [[AddressesProblem::Temporal information extraction]]. Specifically it introduces a framework for tracking topic shifts, e.g. news and events, over short time scales.
 
  
The key idea is to track news by short, distinctive phrase, which acts as the analogue of "genetic signatures" for different topics. It also produces quantitative analysis of the news cycle on their representative data set.
+
This is an early and influential [[Category::paper]] presenting an unsupervised approach to [[AddressesProblem::review classification]]. There are three basic ideas introduced here.
  
== The method ==
+
One key idea is to score the polarity of a review based on the total polarity of the phrases in it.
Some words alternation in a phrase during the quotes called (textual mutation) could inhibit the accurate tracking. To solve this problem, the authors propose a robust method to cluster textual variants of quotes consisting of two stages namely '''phrase graph construction''' and '''clustering'''.
 
  
== pre-processing ==
+
A second idea is to use patterns of part of speech tags to pick out phrases that are likely to be meaningful and unambiguous with respect to semantic orientation (e.g. ADJ NOUN might pick out "good service" or "delicious desserts"). 
First of all, pre-processing is conducted to eliminate the noisy phrases within the data set including:
 
  
1. remove the phrases whose word-length is less than 4.
+
Finally, these potentially-meaningful phrases are then scored using [[UsesMethod::pointwise mutual information]] (PMI) to seed words on known polarity. Specifically, Turney uses PMI to compare each phrase to the words "excellent" or "poor", and then uses these distances to give an overall score for the polarity to each phrase, based on the difference of its PMI with "excellent" to the PMI with "poor".  A very large corpus was used here (the Web, via queries to a search engine), which appears to be important in making this simple technique work.
  
2. remove the phrases whose term-frequency is less than 10.
+
== Brief description of the method ==
 +
The algorithm takes a written review as an input. First it assigns a POS tag to each word in the review to identify adjective or adverb phrases in the input review. They have used PMI-IR algorithm to estimate the semantic orientation of a phrase. The Pointwise Mutual Information (PMI) between two words <math> w_1 </math> and <math> w_2 </math> is defined as follow:
  
3. eliminate the phrases whose domain-frequency is at least 25% (avoid spammers).
+
<math>
 +
PMI(w_1,w_2)=log_2(p(w_1\ and\ w_2)/p(w_1)p(w_2))
 +
</math>
  
== Graph construction ==
+
where <math> p(w_1,w_2) </math> is the probability that <math> w_1 </math> and <math> w_2 </math> co-occur. They have defined the semantic orientation of a phrase as follow:
Each node <math>p</math> in the phrase graph <math>G</math> represents a phrase extracted from the corpus. An edge <math>(p,q)</math> is included for every pair of phrases p and q, which always points from shorter phrases to longer phrases. Two phrases are connected either the edit-distance (treating a word as a token) is smaller than 1 or there is at least a 10-word consecutive overlap between them. In other words, the edge implies the inclusion relation between the phrases and since the direction is strictly pointing to longer phrases the graph becomes a directed acyclic graph (DAG).
 
  
The authors fail to elaborate how the weight <math>w_{pq}</math> on each edge is calculated. They only state that the weight is increased as the directed edit distance as well as the frequency of q grows.
+
<math>
 +
SO(phrase)=PMI(phrase,'excellent')-PMI(phrase,'poor')
 +
</math>
  
== Clustering ==
+
We can modify the above definition to obtain the following formula:
The goal of clustering is to retrieve all ''single rooted'' components so that all phrases in a component are closely related by deleting a set of edges of minimum total weight. The single rooted indicates a directed acyclic sub-graph if it contains exactly one root node (out-degree = 0). As other clustering problem, it proves to be a NP-hard problem. Therefore the authors propose three heuristic towards a feasible clustering solution. And the authors claim using the heuristic (although, in my opinion , the contribution of the heuristic is obscure) they found that keeping an edge to the shortest phrase yields 9% improvement over the baseline, 12% improvement keeping an edge to the most frequent phrases and 13% greedily assigning the node to the cluster with the most edges. The experimental result demonstrates that the volume distribution for both phrase and phrase cluster generated by their cluster method follows power law distribution.
 
  
+
<math>
 +
SO(phrase)=log_2(\frac{hits(phrase\ NEAR\ 'excellent')hits('excellent')}{hits(phrase\ NEAR\ 'poor')hits('poor')} )
 +
</math>
  
== Data set ==
+
where operator NEAR means that the two phrases should be appeared close to each other in the corpus. Using the above formula they have calculated the average semantic orientation for a review. They have shown that the value of average semantic orientation for phrases in the items that are tagged as "recommended" by the users are usually positive and those that are tagged as "not recommended" are usually negative.
90 million news and blog articles collected over the final three months of the 2008 U.S.
 
Presidential Election (from August 1 to October 31 2008).
 
  
 
== Experimental Result ==
 
== Experimental Result ==

Revision as of 21:46, 26 September 2012

Citation

Turney, P. D. 2002. Thumbs up or thumbs down? Semantic orientation applied to unsupervised classification of reviews. In Proceedings of the 40th annual meeting of the Association for Computational Linguistics, 417–424.

Online version

ACL anthology

Summary

This is an early and influential paper presenting an unsupervised approach to review classification. There are three basic ideas introduced here.

One key idea is to score the polarity of a review based on the total polarity of the phrases in it.

A second idea is to use patterns of part of speech tags to pick out phrases that are likely to be meaningful and unambiguous with respect to semantic orientation (e.g. ADJ NOUN might pick out "good service" or "delicious desserts").

Finally, these potentially-meaningful phrases are then scored using pointwise mutual information (PMI) to seed words on known polarity. Specifically, Turney uses PMI to compare each phrase to the words "excellent" or "poor", and then uses these distances to give an overall score for the polarity to each phrase, based on the difference of its PMI with "excellent" to the PMI with "poor". A very large corpus was used here (the Web, via queries to a search engine), which appears to be important in making this simple technique work.

Brief description of the method

The algorithm takes a written review as an input. First it assigns a POS tag to each word in the review to identify adjective or adverb phrases in the input review. They have used PMI-IR algorithm to estimate the semantic orientation of a phrase. The Pointwise Mutual Information (PMI) between two words and is defined as follow:

where is the probability that and co-occur. They have defined the semantic orientation of a phrase as follow:

We can modify the above definition to obtain the following formula:

where operator NEAR means that the two phrases should be appeared close to each other in the corpus. Using the above formula they have calculated the average semantic orientation for a review. They have shown that the value of average semantic orientation for phrases in the items that are tagged as "recommended" by the users are usually positive and those that are tagged as "not recommended" are usually negative.

Experimental Result

This approach was fairly successful on a range of review-classification tasks: it achieved accuracy of between 65% and 85% in predicting an author-assigned "recommended" flag for Epinions ratings for eight diverse products, ranging from cars to movies. Many later writers used several key ideas from the paper, including: treating polarity prediction as a document-classification problem; classifying documents based on likely-to-be-informative phrases; and using unsupervised or semi-supervised learning methods.

Related papers

The widely cited Pang et al EMNLP 2002 paper was influenced by this paper - but considers supervised learning techniques. The choice of movie reviews as the domain was suggested by the (relatively) poor performance of Turney's method on movies.

An interesting follow-up paper is Turney and Littman, TOIS 2003 which focuses on evaluation of the technique of using PMI for predicting the semantic orientation of words.