IDEAS home Printed from https://ideas.repec.org/a/hin/complx/6659430.html
   My bibliography  Save this article

An End-to-End Rumor Detection Model Based on Feature Aggregation

Author

Listed:
  • Aoshuang Ye
  • Lina Wang
  • Run Wang
  • Wenqi Wang
  • Jianpeng Ke
  • Danlei Wang
  • Hocine Cherifi

Abstract

The social network has become the primary medium of rumor propagation. Moreover, manual identification of rumors is extremely time-consuming and laborious. It is crucial to identify rumors automatically. Machine learning technology is widely implemented in the identification and detection of misinformation on social networks. However, the traditional machine learning methods profoundly rely on feature engineering and domain knowledge, and the learning ability of temporal features is insufficient. Furthermore, the features used by the deep learning method based on natural language processing are heavily limited. Therefore, it is of great significance and practical value to study the rumor detection method independent of feature engineering and effectively aggregate heterogeneous features to adapt to the complex and variable social network. In this paper, a deep neural network- (DNN-) based feature aggregation modeling method is proposed, which makes full use of the knowledge of propagation pattern feature and text content feature of social network event without feature engineering and domain knowledge. The experimental results show that the feature aggregation model has achieved 94.4% of accuracy as the best performance in recent works.

Suggested Citation

  • Aoshuang Ye & Lina Wang & Run Wang & Wenqi Wang & Jianpeng Ke & Danlei Wang & Hocine Cherifi, 2021. "An End-to-End Rumor Detection Model Based on Feature Aggregation," Complexity, Hindawi, vol. 2021, pages 1-16, May.
  • Handle: RePEc:hin:complx:6659430
    DOI: 10.1155/2021/6659430
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/complexity/2021/6659430.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/complexity/2021/6659430.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2021/6659430?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:complx:6659430. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.