Name
Title | ||
|---|---|---|
Selecting Social Media Responses to News: A Convex Framework Based On Data Reconstruction. |
Abstract | ||
|---|---|---|
With the explosive growth of social media, it has gained significantly increasing attention from both journalists and their readership in recent years by enhancing the reading experience with its timeliness, high participation, interactivity, etc. On the other hand, the popularity of social media services such as Twitter also leads to the challenge of information overload by generating thousands of responses (tweets) for each article of hot news, which will be overwhelming for readers. In this paper, we address the problem of selecting a representative subset of responses to news in order to deliver the most important information. We consider different criteria regarding the importance of the selected subset, and treat the problem from the data reconstruction perspective with concerns for both quality and generalizability of the selection. The intuition behind our work is that a good selection should be relevant from two levels: i) at the message level, it brings readers new information as much as possible or generalizes other people’s opinions comprehensively; ii) at the text level, it is able to reconstruct the corpus. Specifically, the task of selecting responses to news can be formulated as a convex optimization problem where sparse non-negative weights are introduced for all the responses indicating whether they are selected or not. Several gradient based optimization and step size selection methods are also investigated in this paper to achieve a faster rate of convergence. More importantly, the proposed framework evaluates the utility of a set of responses jointly and therefore is able to reduce redundancy of the selected responses. We evaluate our approach on real-world data obtained from Twitter, and the results demonstrate superior performance over the state of the art in both accuracy and generalizability. |
Year | Venue | Field |
|---|---|---|
2015 | SDM | Generalizability theory,Interactivity,Information overload,Social media,Computer science,Popularity,Redundancy (engineering),Artificial intelligence,Rate of convergence,Convex optimization,Machine learning |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
11 | 6 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zaiyi Chen | 1 | 35 | 4.77 |
| Linli Xu | 2 | 790 | 42.51 |
| Enhong Chen | 3 | 2106 | 165.57 |
| Biao Chang | 4 | 31 | 3.38 |
| Zhefeng Wang | 5 | 29 | 9.34 |
| Yitan Li | 6 | 32 | 3.11 |