Towards early identification of online rumors based on long short-term memory networks
In the social media environment, rumors are constantly breeding and rapidly spreading, which has become a severe social problem, often leading to serious consequences (e.g., social panic and even chaos). Therefore, how to identify rumors quickly and accurately has become a key prerequisite for takin...
Saved in:
Published in | Information processing & management Vol. 56; no. 4; p. 1457 |
---|---|
Main Authors | , , |
Format | Journal Article |
Language | English |
Published |
Oxford
Elsevier Science Ltd
01.07.2019
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | In the social media environment, rumors are constantly breeding and rapidly spreading, which has become a severe social problem, often leading to serious consequences (e.g., social panic and even chaos). Therefore, how to identify rumors quickly and accurately has become a key prerequisite for taking effective measures to curb the spread of rumors and reduce their influence. However, most existing studies employ machine learning based methods to carry out automatic rumor identification by extracting features of rumor contents, posters, and static spreading processes (e.g., follow-ups, thumb-ups, etc.) or by learning the presentation of forwarding contents. These studies fail to take into account the dynamic differences between the spreaders and diffusion structures of rumors and non-rumors. To fill this gap, this paper proposes Long Short-Term Memory (LSTM) network based models for identifying rumors by capturing the dynamic changes of forwarding contents, spreaders and diffusion structures of the whole (in the afterwards identification mode) or only the beginning part (in the halfway identification mode, i.e., early rumor identification) of the spreading process. Experiments conducted on a rumor and non-rumor dataset from Sina Weibo show that the proposed models perform better than existing baselines. |
---|---|
ISSN: | 0306-4573 1873-5371 |
DOI: | 10.1016/j.ipm.2019.11.003 |