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

Rumor Identification with Maximum Entropy in MicroNet

Author

Listed:
  • Suisheng Yu
  • Mingcai Li
  • Fengming Liu

Abstract

The widely used applications of Microblog, WeChat, and other social networking platforms (that we call MicroNet) shorten the period of information dissemination and expand the range of information dissemination, which allows rumors to cause greater harm and have more influence. A hot topic in the information dissemination field is how to identify and block rumors. Based on the maximum entropy model, this paper constructs the recognition mechanism of rumor information in the micronetwork environment. First, based on the information entropy theory, we obtained the characteristics of rumor information using the maximum entropy model. Next, we optimized the original classifier training set and the feature function to divide the information into rumors and nonrumors. Finally, the experimental simulation results show that the rumor identification results using this method are better than the original classifier and other related classification methods.

Suggested Citation

  • Suisheng Yu & Mingcai Li & Fengming Liu, 2017. "Rumor Identification with Maximum Entropy in MicroNet," Complexity, Hindawi, vol. 2017, pages 1-8, September.
    • Handle: RePEc:hin:complx:1703870
    DOI: 10.1155/2017/1703870
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/8503/2017/1703870.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/8503/2017/1703870.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2017/1703870?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
    ---><---

    References listed on IDEAS

    as
    1. Zhao Zhang & Wen Xu & Weili Wu & Ding-Zhu Du, 2017. "A novel approach for detecting multiple rumor sources in networks with partial observations," Journal of Combinatorial Optimization, Springer, vol. 33(1), pages 132-146, January.
    2. Devavrat Shah & Tauhid Zaman, 2016. "Finding Rumor Sources on Random Trees," Operations Research, INFORMS, vol. 64(3), pages 736-755, June.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Hai, Audrey Hang & Franklin, Cynthia & Cole, Allan Hugh & Panisch, Lisa S. & Yan, Yueqi & Jones, Kristian, 2021. "Impact of MindUP on elementary school students’ classroom behaviors: A single-case design pilot study," Children and Youth Services Review, Elsevier, vol. 125(C).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Gong, Chang & Li, Jichao & Qian, Liwei & Li, Siwei & Yang, Zhiwei & Yang, Kewei, 2024. "HMSL: Source localization based on higher-order Markov propagation," Chaos, Solitons & Fractals, Elsevier, vol. 182(C).
    2. Edward Anderson & David Gamarnik & Anton Kleywegt & Asuman Ozdaglar, 2016. "Preface to the Special Issue on Information and Decisions in Social and Economic Networks," Operations Research, INFORMS, vol. 64(3), pages 561-563, June.
    3. Jiang, Meiling & Gao, Qingwu & Zhuang, Jun, 2021. "Reciprocal spreading and debunking processes of online misinformation: A new rumor spreading–debunking model with a case study," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 565(C).
    4. Michel Grabisch & Agnieszka Rusinowska & Xavier Venel, 2019. "Diffusion in countably infinite networks," Documents de travail du Centre d'Economie de la Sorbonne 19017, Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne.
    5. Bin Liu & Yuxia Yan & Qizhi Fang & Junyu Dong & Weili Wu & Huijuan Wang, 2019. "Maximizing profit of multiple adoptions in social networks with a martingale approach," Journal of Combinatorial Optimization, Springer, vol. 38(1), pages 1-20, July.
    6. Harry Crane & Min Xu, 2021. "Inference on the history of a randomly growing tree," Journal of the Royal Statistical Society Series B, Royal Statistical Society, vol. 83(4), pages 639-668, September.
    7. Vahideh Manshadi & Sidhant Misra & Scott Rodilitz, 2020. "Diffusion in Random Networks: Impact of Degree Distribution," Operations Research, INFORMS, vol. 68(6), pages 1722-1741, November.
    8. Sahand Negahban & Sewoong Oh & Devavrat Shah, 2017. "Rank Centrality: Ranking from Pairwise Comparisons," Operations Research, INFORMS, vol. 65(1), pages 266-287, February.
    9. Shi, Chaoyi & Zhang, Qi & Chu, Tianguang, 2022. "Source estimation in continuous-time diffusion networks via incomplete observation," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 592(C).
    10. Sahand Negahban & Sewoong Oh & Devavrat Shah, 2017. "Rank Centrality: Ranking from Pairwise Comparisons," Operations Research, INFORMS, vol. 65(1), pages 266-287, February.

    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:1703870. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.