12 research outputs found

    Rumor Detection on Social Media with Bi-Directional Graph Convolutional Networks

    Full text link
    Social media has been developing rapidly in public due to its nature of spreading new information, which leads to rumors being circulated. Meanwhile, detecting rumors from such massive information in social media is becoming an arduous challenge. Therefore, some deep learning methods are applied to discover rumors through the way they spread, such as Recursive Neural Network (RvNN) and so on. However, these deep learning methods only take into account the patterns of deep propagation but ignore the structures of wide dispersion in rumor detection. Actually, propagation and dispersion are two crucial characteristics of rumors. In this paper, we propose a novel bi-directional graph model, named Bi-Directional Graph Convolutional Networks (Bi-GCN), to explore both characteristics by operating on both top-down and bottom-up propagation of rumors. It leverages a GCN with a top-down directed graph of rumor spreading to learn the patterns of rumor propagation, and a GCN with an opposite directed graph of rumor diffusion to capture the structures of rumor dispersion. Moreover, the information from the source post is involved in each layer of GCN to enhance the influences from the roots of rumors. Encouraging empirical results on several benchmarks confirm the superiority of the proposed method over the state-of-the-art approaches.Comment: 8 pages, 4 figures, AAAI 202

    Rumor detection technology based on ubiquitous relationship

    Get PDF
    This paper addresses the limitations of existing rumor detection methods that heavily rely on single or local features, which restrict their ability to capture comprehensive and detailed characteristics of rumors. The main objective of this study is to enhance the efficiency of rumor detection. To achieve this, we propose a novel approach that integrates user attributes, comment structure, and propagation models, introducing the concept of ubiquitous relationships for messages in social networks. We construct a Tweet-word-user ubiquitous relationship network using a propagation model and further leverage the Graph Convolutional Neural Network (GCN) to enhance semantic features. Consequently, we present a novel rumor detection model, the Ubiquitous Relationship-based Graph Convolutional Neural Network (U-GCN), which effectively combines user, text, and comment features within a unified framework, while also enhancing semantic features from the source post for comprehensive detection. Extensive experiments are conducted on two publicly available Twitter Datasets. The results demonstrate that our proposed U-GCN model achieves an accuracy rate of above 0.9, outperforming methods that solely consider single or local features. Our findings highlight the effectiveness of leveraging ubiquitous relationships in rumor detection

    ์†Œ์…œ ๋ฏธ๋””์–ด ์† ๋ฃจ๋จธ ํƒ์ง€๋ฅผ ์œ„ํ•œ ๊ทธ๋ž˜ํ”„ ํ•ฉ์„ฑ๊ณฑ ์‹ ๊ฒฝ๋ง๊ณผ ์–ดํ…์…˜ ๋ฉ”์ปค๋‹ˆ์ฆ˜

    Get PDF
    ํ•™์œ„๋…ผ๋ฌธ (์„์‚ฌ) -- ์„œ์šธ๋Œ€ํ•™๊ต ๋Œ€ํ•™์› : ๊ณต๊ณผ๋Œ€ํ•™ ์ปดํ“จํ„ฐ๊ณตํ•™๋ถ€, 2020. 8. ๊น€์ข…๊ถŒ.Social media has been a great disseminator for new information and thoughts. Due to its accessibility of sharing information, however, social media has also become an ideal platform for propagations of rumors, fake news, and misinformation. Rumors on social media not only mislead the users of online but also affects the real world immensely. Thus, detecting the rumors and preventing their spread became an essential task. Previous learning-based rumor detection methods adopted to use contents, users, or propagation features of rumors. However, the methods are limited to represent rumor propagation as static graphs, which arent optimal for capturing the dynamic information of the rumors. In this study, we propose a novel graph convolutional networks with attention mechanism model named, Dynamic GCN, for rumor detection. We first represent rumor posts with their responsive posts as dynamic graphs. The temporal information is used to generate a sequence of graph snapshots. The representation learning on graph snapshots with attention mechanism captures both structural and temporal information of rumor spreads. The conducted experiments on two real-world datasets demonstrate that our model, Dynamic GCN, achieves superior results over the state-of-the-art models in the rumor detection task.์†Œ์…œ ๋ฏธ๋””์–ด๋Š” ๊ฐ•๋ ฅํ•œ ์ •๋ณด ์ „๋‹ฌ๋ ฅ์„ ๊ฐ€์ง„ ๋งค์ฒด๋กœ ์ƒˆ๋กœ์šด ์ •๋ณด์™€ ์ƒ๊ฐ์˜ ์ „ํŒŒ ์ฐฝ๊ตฌ์ด๋‹ค. ์†Œ์…œ ๋ฏธ๋””์–ด์˜ ํŠน์ง•์ธ ์ ‘๊ทผ์„ฑ์€ ๋•Œ๋ก  ๋ฃจ๋จธ, ๊ฐ€์งœ ๋‰ด์Šค, ์ž˜๋ชป๋œ ์ •๋ณด์˜ ์ „ํŒŒ์—์„œ๋„ ์ด์ƒ์ ์ธ ํ”Œ๋žซํผ์ด ๋œ๋‹ค. ์†Œ์…œ ๋ฏธ๋””์–ด ์† ๋ฃจ๋จธ๋Š” ์˜จ๋ผ์ธ ์‚ฌ์šฉ์ž๋ฅผ ์˜ค๋„ํ•  ๋ฟ๋งŒ ์•„๋‹ˆ๋ผ ๋•Œ๋ก  ํ˜„์‹ค ์„ธ๊ณ„์—๋„ ํฐ ์˜ํ–ฅ์„ ๋ฏธ์นœ๋‹ค. ๋”ฐ๋ผ์„œ, ๋ฃจ๋จธ๋ฅผ ํƒ์ง€ํ•˜๊ณ  ๊ทธ ์ „ํŒŒ๋ฅผ ๋ง‰๋Š” ๋…ธ๋ ฅ์ด ์š”๊ตฌ๋œ๋‹ค. ๊ธฐ์กด์˜ ๋ฃจ๋จธ ํƒ์ง€ ๋ฐฉ๋ฒ•์€ ๋ฃจ๋จธ์˜ ๋‚ด์šฉ, ์‚ฌ์šฉ์ž, ๋˜๋Š” ์ „ํŒŒ ๊ณผ์ •์˜ ์ •๋ณด๋ฅผ ํŠน์„ฑ์œผ๋กœ ์ด์šฉํ•œ๋‹ค. ์ด๋Ÿฌํ•œ ๋ฐฉ๋ฒ•์€ ๋ฃจ๋จธ์˜ ์ „ํŒŒ๋ฅผ ์ •์  ๊ทธ๋ž˜ํ”„๋กœ ํ‘œํ˜„ํ•˜๋ฉฐ ๊ทธ ๊ตฌ์กฐ์  ํŠน์„ฑ์„ ์ด์šฉํ•œ๋‹ค. ํ•˜์ง€๋งŒ ์ด๋Š” ๋ฃจ๋จธ์˜ ๋™์  ํŠน์„ฑ์„ ํฌ์ฐฉํ•˜์ง€ ๋ชปํ•œ๋‹ค๋Š” ํ•œ๊ณ„๋ฅผ ๊ฐ€์ง€๊ณ  ์žˆ๋‹ค. ๋ณธ ์—ฐ๊ตฌ์—์„œ๋Š” ๊ทธ๋ž˜ํ”„ ํ•ฉ์„ฑ๊ณฑ ์‹ ๊ฒฝ๋ง (graph convolutional networks: GCN)๊ณผ ์–ดํ…์…˜ ๋ฉ”์ปค๋‹ˆ์ฆ˜ (attention mechanism)์„ ํ™œ์šฉํ•œ ๋™์  ๊ทธ๋ž˜ํ”„ ํ•ฉ์„ฑ๊ณฑ ์‹ ๊ฒฝ๋ง (Dynamic GCN) ๋ฃจ๋จธ ํƒ์ง€ ๋ชจ๋ธ์„ ์ œ์‹œํ•œ๋‹ค. ๋จผ์ €, ์†Œ์…œ ๋ฏธ๋””์–ด ์† ๋ฃจ๋จธ ๊ฒŒ์‹œ๊ธ€๋“ค (posts) ๊ณผ ๊ทธ์˜ ๋‹ต์žฅ์ด ๋˜๋Š” ๊ธ€๋“ค(responsive posts)์„ ์ด์šฉํ•˜์—ฌ ๋ฃจ๋จธ์˜ ์ „ํŒŒ ๊ณผ์ •์„ ์ •์  ๊ทธ๋ž˜ํ”„๋กœ ํ‘œํ˜„ํ•œ๋‹ค. ์‹œ๊ฐ„ ์ •๋ณด๋ฅผ ํ†ตํ•ด ์ „ํŒŒ ๊ณผ์ •์„ ํฌํ•จํ•˜๊ณ  ์žˆ๋Š” ์ •์  ๊ทธ๋ž˜ํ”„์˜ ์ง‘ํ•ฉ์ธ ๊ทธ๋ž˜ํ”„ ์Šค๋ƒ…์ˆ (graph snapshot) ์‹œํ€€์Šค (sequence)๋ฅผ ๋งŒ๋“ค๊ฒŒ ๋œ๋‹ค. ์–ดํ…์…˜ ๋ฉ”์ปค๋‹ˆ์ฆ˜์„ ํ™œ์šฉํ•œ ๊ทธ๋ž˜ํ”„ ์Šค๋ƒ…์ˆ ํ‘œํ˜„ ํ•™์Šต์€ ๋ฃจ๋จธ ์ „ํŒŒ์˜ ๊ตฌ์กฐ์  ์‹œ๊ฐ„์  ์ •๋ณด๋ฅผ ๋ชจ๋‘ ํšจ๊ณผ์ ์œผ๋กœ ๋ฐ˜์˜ํ•œ๋‹ค. ์‹ค์ œ ํŠธ์œ„ํ„ฐ ๋ฐ์ดํ„ฐ๋ฅผ ์ด์šฉํ•œ ์‹คํ—˜์„ ํ†ตํ•˜์—ฌ ์ œ์‹œ๋œ ๋ชจ๋ธ์˜ ์„ฑ๋Šฅ์ด ๋‹ค๋ฅธ ๋น„๊ต ๋ชจ๋ธ๋“ค๋ณด๋‹ค ๋†’์Œ์„ ํ™•์ธํ•  ์ˆ˜ ์žˆ์—ˆ๋‹ค.Chapter I Introduction 1 Chapter II Related Work 5 2.1 Rumor Detection 5 2.2 Graph Convolutional Networks 6 2.3 Learning Sequences & Attention Mechanism 7 Chapter III Problem Definition 9 Chapter IV Dynamic GCN with Attention Mechanism 11 4.1 Snapshot Generation 13 4.2 Graph Convolutional Networks 14 4.3 Readout Layer 15 4.4 Attention Mechanism 16 4.5 Training & Prediction 17 Chapter V Experiments 18 5.1 Datasets 18 5.2 Baselines 20 5.3 Experimental Setup & Implementation Details 21 5.4 Performance Evaluations 24 5.5 Ablation Study 25 Chapter VI Conclusion 30 Bibliography 31 ์ดˆ ๋ก 40Maste

    Evaluating the generalisability of neural rumour verification models

    Get PDF
    Research on automated social media rumour verification, the task of identifying the veracity of questionable information circulating on social media, has yielded neural models achieving high performance, with accuracy scores that often exceed 90%. However, none of these studies focus on the real-world generalisability of the proposed approaches, that is whether the models perform well on datasets other than those on which they were initially trained and tested. In this work we aim to fill this gap by assessing the generalisability of top performing neural rumour verification models covering a range of different architectures from the perspectives of both topic and temporal robustness. For a more complete evaluation of generalisability, we collect and release COVID-RV, a novel dataset of Twitter conversations revolving around COVID-19 rumours. Unlike other existing COVID-19 datasets, our COVID-RV contains conversations around rumours that follow the format of prominent rumour verification benchmarks, while being different from them in terms of topic and time scale, thus allowing better assessment of the temporal robustness of the models. We evaluate model performance on COVID-RV and three popular rumour verification datasets to understand limitations and advantages of different model architectures, training datasets and evaluation scenarios. We find a dramatic drop in performance when testing models on a different dataset from that used for training. Further, we evaluate the ability of models to generalise in a few-shot learning setup, as well as when word embeddings are updated with the vocabulary of a new, unseen rumour. Drawing upon our experiments we discuss challenges and make recommendations for future research directions in addressing this important problem

    Combating Fake News on Social Media: A Framework, Review, and Future Opportunities

    Get PDF
    Social media platforms facilitate the sharing of a vast magnitude of information in split seconds among users. However, some false information is also widely spread, generally referred to as โ€œfake newsโ€. This can have major negative impacts on individuals and societies. Unfortunately, people are often not able to correctly identify fake news from truth. Therefore, there is an urgent need to find effective mechanisms to fight fake news on social media. To this end, this paper adapts the Straub Model of Security Action Cycle to the context of combating fake news on social media. It uses the adapted framework to classify the vast literature on fake news to action cycle phases (i.e., deterrence, prevention, detection, and mitigation/remedy). Based on a systematic and inter-disciplinary review of the relevant literature, we analyze the status and challenges in each stage of combating fake news, followed by introducing future research directions. These efforts allow the development of a holistic view of the research frontier on fighting fake news online. We conclude that this is a multidisciplinary issue; and as such, a collaborative effort from different fields is needed to effectively address this problem

    Rumor Detection on Social Media with Bi-Directional Graph Convolutional Networks

    No full text
    corecore