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

Weibo Rumor Recognition Based on Communication and Stacking Ensemble Learning

Author

Listed:
  • Yu Wu
  • Yan Zeng
  • Jie Yang
  • Zhenni Zhao

Abstract

Research on the identification of rumors in cyberspace helps to discover social issues that are of concern to the public and are not easily found, and it also can help to purify cyberspace and to maintain social stability. However, the real complexity of rumors makes it difficult for its recognition technology to bridge the semantic gap between qualitative description and quantitative calculation of rumors. Firstly, the existing rumor definitions are mostly qualitative descriptions, so we propose a technical definition of Internet rumors to facilitate quantitative calculations. Secondly, since the feature set used in rumor recognition research is not effective, by combining with communication, we construct a more suitable feature set for rumor recognition. Thirdly, aiming at the problem that traditional classification algorithms are not suitable for complex rumor information recognition, a rumor recognition method based on Stacking ensemble learning is proposed. Our experiment results show that the proposed method has higher accuracy, less algorithm execution time, and better practical application effect.

Suggested Citation

  • Yu Wu & Yan Zeng & Jie Yang & Zhenni Zhao, 2020. "Weibo Rumor Recognition Based on Communication and Stacking Ensemble Learning," Discrete Dynamics in Nature and Society, Hindawi, vol. 2020, pages 1-12, September.
  • Handle: RePEc:hin:jnddns:9352153
    DOI: 10.1155/2020/9352153
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/DDNS/2020/9352153.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/DDNS/2020/9352153.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2020/9352153?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:jnddns:9352153. 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.