IDEAS home Printed from https://ideas.repec.org/a/gam/jsusta/v15y2023i2p1249-d1030162.html
   My bibliography  Save this article

Hybrid Approach for Detecting Propagandistic Community and Core Node on Social Networks

Author

Listed:
  • Akib Mohi Ud Din Khanday

    (Department of Computer Sciences, BGSB University, Kashmir 185234, India)

  • Mudasir Ahmad Wani

    (EIAS Data Science Lab, Prince Sultan University, Riyadh 11586, Saudi Arabia)

  • Syed Tanzeel Rabani

    (Department of Computer Sciences, BGSB University, Kashmir 185234, India)

  • Qamar Rayees Khan

    (Department of Computer Sciences, BGSB University, Kashmir 185234, India)

Abstract

People share their views and daily life experiences on social networks and form a network structure. The information shared on social networks can be unreliable, and detecting such kinds of information may reduce mass panic. Propaganda is a kind of biased or unreliable information that can mislead or intend to promote a political cause. The disseminators involved in spreading such information create a sophisticated network structure. Detecting such communities can lead to a safe and reliable network for the users. In this paper, a Boundary-based Community Detection Approach (BCDA) has been proposed to identify the core nodes in a propagandistic community that detects propagandistic communities from social networks with the help of interior and boundary nodes. The approach consists of two phases, one is to detect the community, and the other is to detect the core member. The approach mines nodes from the boundary as well as from the interior of the community structure. The leader Ranker algorithm is used for mining candidate nodes within the boundary, and the Constraint coefficient is used for mining nodes within the boundary. A novel dataset is generated from Twitter. About six propagandistic communities are detected. The core members of the propagandistic community are a combination of a few nodes. The experiments are conducted on a newly collected Twitter dataset consisting of 16 attributes. From the experimental results, it is clear that the proposed model outperformed other related approaches, including Greedy Approach, Improved Community-based 316 Robust Influence Maximization (ICRIM), Community Based Influence Maximization Approach (CBIMA), etc. It was also observed from the experiments that most of the propagandistic information is being shared during trending events around the globe, for example, at times of the COVID-19 pandemic.

Suggested Citation

  • Akib Mohi Ud Din Khanday & Mudasir Ahmad Wani & Syed Tanzeel Rabani & Qamar Rayees Khan, 2023. "Hybrid Approach for Detecting Propagandistic Community and Core Node on Social Networks," Sustainability, MDPI, vol. 15(2), pages 1-15, January.
  • Handle: RePEc:gam:jsusta:v:15:y:2023:i:2:p:1249-:d:1030162
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2071-1050/15/2/1249/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2071-1050/15/2/1249/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Xiaojie Wang & Xue Zhang & Chengli Zhao & Dongyun Yi, 2016. "Maximizing the Spread of Influence via Generalized Degree Discount," PLOS ONE, Public Library of Science, vol. 11(10), pages 1-16, October.
    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. Pir Noman Ahmad & Yuanchao Liu & Gauhar Ali & Mudasir Ahmad Wani & Mohammed ElAffendi, 2023. "Robust Benchmark for Propagandist Text Detection and Mining High-Quality Data," Mathematics, MDPI, vol. 11(12), pages 1-23, June.
    2. Hasan, Md Ahsan Ul & Bakar, Azuraliza Abu & Yaakub, Mohd Ridzwan, 2024. "Measuring user influence in real-time on twitter using behavioural features," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 639(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.

      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:gam:jsusta:v:15:y:2023:i:2:p:1249-:d:1030162. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.