Difference between revisions of "BinLu et al. ACL2011"
| Line 13: | Line 13: | ||
This paper address the [[problem::Sentiment analysis]] problem on sentence level for multiple languages. They propose to leverage parallel corpora to learn a [[UsesMethod::Maximum Entropy model|MaxEnt]]-based [[UsesMethod::Expectation-maximization algorithm|EM]] model that consider both languages simultaneously under the assumption that sentiment labels for parallel sentences should be similar. | This paper address the [[problem::Sentiment analysis]] problem on sentence level for multiple languages. They propose to leverage parallel corpora to learn a [[UsesMethod::Maximum Entropy model|MaxEnt]]-based [[UsesMethod::Expectation-maximization algorithm|EM]] model that consider both languages simultaneously under the assumption that sentiment labels for parallel sentences should be similar. | ||
| − | The experimented on 2 dataset: [[UsesDataset::MPQA Multi-Perspective Question Answering]] and [[UsesDataset::NTCIR]] | + | The experimented on 2 dataset: [[UsesDataset::MPQA Multi-Perspective Question Answering]] and [[UsesDataset::NTCIR-6 Opinion]] |
== Evaluation == | == Evaluation == | ||
Revision as of 20:31, 26 September 2012
Contents
Citation
Joint Bilinguial Sentiment Classification with Unlabeled Parallel Corpora, Bin Lu, Chenhao Tan, Claire Cardie and Benjamin K. Tsou, ACL 2011
Online version
Joint Bilingual Sentiment Classification with Unlabeled Parallel Corpora
Summary
This paper address the Sentiment analysis problem on sentence level for multiple languages. They propose to leverage parallel corpora to learn a MaxEnt-based EM model that consider both languages simultaneously under the assumption that sentiment labels for parallel sentences should be similar.
The experimented on 2 dataset: MPQA Multi-Perspective Question Answering and NTCIR-6 Opinion
Evaluation
They evaluate their methods by asking following 4 questions :
- Does NF find out meaningful neighborhoods? - How close is Approximate NF to exact NF? - Can AD detect injected anomalies? - How much time these methods take to run on graphs of varying sizes?
Discussion
This paper poses two important social problems related to bipartite social graphs and explained how those problems can be solved efficiently using random walks.
They also claim that the neighborhoods over nodes can represent personalized clusters depending on different perspectives.
During presentation one of the audiences raised question about is anomaly detection in this paper similar to betweenness of edges defined in Kleinber's text as discussed in Class Meeting for 10-802 01/26/2010. I think they are similar. In the texbook they propose, detecting edges with high betweenness and using them to partition the graph. In this paper they first try to create neighbourhood partitions based on random walk prbabilities and which as a by product gives us nodes and edges with high betweenness value.
Related papers
There has been a lot of work on anomaly detection in graphs.
- The paper by Moonesinghe and Tan ICTAI06 finds the clusters of outlier objects by doing random walk on the weighted graph.
- The paper by Aggarwal SIGMOD 2001 proposes techniques for projecting high dimensional data on lower dimensions to detect outliers.
