Structure Learning Via Meta-Hyperedge for Dynamic Rumor Detection

被引:24
作者
Sun, Xiangguo [1 ]
Yin, Hongzhi [2 ]
Liu, Bo [1 ,3 ]
Meng, Qing [1 ]
Cao, Jiuxin [1 ,3 ]
Zhou, Alexander [4 ]
Chen, Hongxu [5 ]
机构
[1] Southeast Univ, Nanjing 211189, Jiangsu, Peoples R China
[2] Univ Queensland, St Lucia, Qld 4072, Australia
[3] Purple Mt Labs, Nanjing 211111, Jiangsu, Peoples R China
[4] Hong Kong Univ Sci & Technol, Hong Kong, Peoples R China
[5] Univ Technol Sydney, Ultimo, NSW 2007, Australia
基金
澳大利亚研究理事会; 中国国家自然科学基金;
关键词
Index Terms-Graph neural networks; hypergraph learning; rumor detection; social network analysis;
D O I
10.1109/TKDE.2022.3221438
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Online social networks have greatly facilitated our lives but have also propagated the spreading of rumours. Traditional works mostly find rumors from content, but content can be strategically manipulated to evade such detection, making these methods brittle. To improve the accuracy and robustness of rumor detection, we propose to integrate and exploit the content, propagation structure, and temporal relations because information in the networks always spreads dynamically with significant structures. In this paper, we propose a novel rumor detection framework in online temporal networks via structure learning. Specifically, to exploit the propagation structure, we propose a novel hyperedge walking strategy on a meta-hyperedge graph to learn the representations of sub-structures in the networks. Then a hyperedge expansion method is proposed to generate more global structural features. The expanded hyperedges are more hierarchical, making the learned structural embeddings more expressive. To make full use of content, we design a hypergraph learning model using hyperedge expansion to fuse node content with structural features and generate comprehensive representations for the entire graph. To exploit temporal relations, we design a masked temporal attention unit for learning the evolving patterns of the network. Extensive evaluations with six state-of-the-art baselines on two real-world datasets demonstrate the superiority of our solution.
引用
收藏
页码:9128 / 9139
页数:12
相关论文
共 46 条
  • [1] [Anonymous], 2011, P 2011 C EMP METH NA
  • [2] Bian T, 2020, AAAI CONF ARTIF INTE, V34, P549
  • [3] A survey on fake news and rumour detection techniques
    Bondielli, Alessandro
    Marcelloni, Francesco
    [J]. INFORMATION SCIENCES, 2019, 497 : 38 - 55
  • [4] Counting Graphlets: Space vs Time
    Bressan, Marco
    Chierichetti, Flavio
    Kumar, Ravi
    Leucci, Stefano
    Panconesi, Alessandro
    [J]. WSDM'17: PROCEEDINGS OF THE TENTH ACM INTERNATIONAL CONFERENCE ON WEB SEARCH AND DATA MINING, 2017, : 557 - 566
  • [5] Castillo C., 2011, P 20 INT C WORLD WID, P675, DOI DOI 10.1145/1963405.1963500
  • [6] Call Attention to Rumors: Deep Attention Based Recurrent Neural Networks for Early Rumor Detection
    Chen, Tong
    Li, Xue
    Yin, Hongzhi
    Zhang, Jun
    [J]. TRENDS AND APPLICATIONS IN KNOWLEDGE DISCOVERY AND DATA MINING: PAKDD 2018 WORKSHOPS, 2018, 11154 : 40 - 52
  • [7] VRoC: Variational Autoencoder-aided Multi-task Rumor Classifier Based on Text
    Cheng, Mingxi
    Nazarian, Shahin
    Bogdan, Paul
    [J]. WEB CONFERENCE 2020: PROCEEDINGS OF THE WORLD WIDE WEB CONFERENCE (WWW 2020), 2020, : 2892 - 2898
  • [8] User Preference-aware Fake News Detection
    Dou, Yingtong
    Shu, Kai
    Xia, Congying
    Yu, Philip S.
    Sun, Lichao
    [J]. SIGIR '21 - PROCEEDINGS OF THE 44TH INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL, 2021, : 2051 - 2055
  • [9] Cascade-LSTM: A Tree-Structured Neural Classifier for Detecting Misinformation Cascades
    Ducci, Francesco
    Kraus, Mathias
    Feuerriegel, Stefan
    [J]. KDD '20: PROCEEDINGS OF THE 26TH ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY & DATA MINING, 2020, : 2666 - 2676
  • [10] Rumor Detection with Hierarchical Social Attention Network
    Guo, Han
    Cao, Juan
    Zhang, Yazi
    Guo, Junbo
    Li, Jintao
    [J]. CIKM'18: PROCEEDINGS OF THE 27TH ACM INTERNATIONAL CONFERENCE ON INFORMATION AND KNOWLEDGE MANAGEMENT, 2018, : 943 - 951