MCWDST: A Minimum-Cost Weighted Directed Spanning Tree Algorithm for Real-Time Fake News Mitigation in Social Media

Research output: Contribution to journalJournal articleResearchpeer-review

Standard

MCWDST : A Minimum-Cost Weighted Directed Spanning Tree Algorithm for Real-Time Fake News Mitigation in Social Media. / Truica, Ciprian Octavian; Apostol, Elena Simona; Nicolescu, Radu Catalin; Karras, Panagiotis.

In: IEEE Access, Vol. 11, 2023, p. 125861-125873.

Research output: Contribution to journalJournal articleResearchpeer-review

Harvard

Truica, CO, Apostol, ES, Nicolescu, RC & Karras, P 2023, 'MCWDST: A Minimum-Cost Weighted Directed Spanning Tree Algorithm for Real-Time Fake News Mitigation in Social Media', IEEE Access, vol. 11, pp. 125861-125873. https://doi.org/10.1109/ACCESS.2023.3331220

APA

Truica, C. O., Apostol, E. S., Nicolescu, R. C., & Karras, P. (2023). MCWDST: A Minimum-Cost Weighted Directed Spanning Tree Algorithm for Real-Time Fake News Mitigation in Social Media. IEEE Access, 11, 125861-125873. https://doi.org/10.1109/ACCESS.2023.3331220

Vancouver

Truica CO, Apostol ES, Nicolescu RC, Karras P. MCWDST: A Minimum-Cost Weighted Directed Spanning Tree Algorithm for Real-Time Fake News Mitigation in Social Media. IEEE Access. 2023;11:125861-125873. https://doi.org/10.1109/ACCESS.2023.3331220

Author

Truica, Ciprian Octavian ; Apostol, Elena Simona ; Nicolescu, Radu Catalin ; Karras, Panagiotis. / MCWDST : A Minimum-Cost Weighted Directed Spanning Tree Algorithm for Real-Time Fake News Mitigation in Social Media. In: IEEE Access. 2023 ; Vol. 11. pp. 125861-125873.

Bibtex

@article{29f85941e1d7461bad839c7c4bc0f12b,
title = "MCWDST: A Minimum-Cost Weighted Directed Spanning Tree Algorithm for Real-Time Fake News Mitigation in Social Media",
abstract = "The widespread availability of internet access and handheld devices confers to social media a power similar to the one newspapers used to have. People seek affordable information on social media and can reach it within seconds. Yet this convenience comes with dangers; any user may freely post whatever they please and the content can stay online for a long period, regardless of its truthfulness. A need arises to detect untruthful information, also known as fake news. In this paper, we present an end-to-end solution that accurately detects fake news and immunizes network nodes that spread them in real-time. To detect fake news, we propose two new stack deep learning architectures that utilize convolutional and bidirectional LSTM layers. To mitigate the spread of fake news, we propose a real-time network-aware strategy that (1) constructs a minimum-cost weighted directed spanning tree for a detected node, and (2) immunizes nodes in that tree by scoring their harmfulness using a novel ranking function. We demonstrate the effectiveness of our solution on five real-world datasets. ",
keywords = "Fake news detection, fake news propagation, network-aware fake news mitigation, real-time network immunization",
author = "Truica, {Ciprian Octavian} and Apostol, {Elena Simona} and Nicolescu, {Radu Catalin} and Panagiotis Karras",
note = "Publisher Copyright: {\textcopyright} 2013 IEEE.",
year = "2023",
doi = "10.1109/ACCESS.2023.3331220",
language = "English",
volume = "11",
pages = "125861--125873",
journal = "IEEE Access",
issn = "2169-3536",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

RIS

TY - JOUR

T1 - MCWDST

T2 - A Minimum-Cost Weighted Directed Spanning Tree Algorithm for Real-Time Fake News Mitigation in Social Media

AU - Truica, Ciprian Octavian

AU - Apostol, Elena Simona

AU - Nicolescu, Radu Catalin

AU - Karras, Panagiotis

N1 - Publisher Copyright: © 2013 IEEE.

PY - 2023

Y1 - 2023

N2 - The widespread availability of internet access and handheld devices confers to social media a power similar to the one newspapers used to have. People seek affordable information on social media and can reach it within seconds. Yet this convenience comes with dangers; any user may freely post whatever they please and the content can stay online for a long period, regardless of its truthfulness. A need arises to detect untruthful information, also known as fake news. In this paper, we present an end-to-end solution that accurately detects fake news and immunizes network nodes that spread them in real-time. To detect fake news, we propose two new stack deep learning architectures that utilize convolutional and bidirectional LSTM layers. To mitigate the spread of fake news, we propose a real-time network-aware strategy that (1) constructs a minimum-cost weighted directed spanning tree for a detected node, and (2) immunizes nodes in that tree by scoring their harmfulness using a novel ranking function. We demonstrate the effectiveness of our solution on five real-world datasets.

AB - The widespread availability of internet access and handheld devices confers to social media a power similar to the one newspapers used to have. People seek affordable information on social media and can reach it within seconds. Yet this convenience comes with dangers; any user may freely post whatever they please and the content can stay online for a long period, regardless of its truthfulness. A need arises to detect untruthful information, also known as fake news. In this paper, we present an end-to-end solution that accurately detects fake news and immunizes network nodes that spread them in real-time. To detect fake news, we propose two new stack deep learning architectures that utilize convolutional and bidirectional LSTM layers. To mitigate the spread of fake news, we propose a real-time network-aware strategy that (1) constructs a minimum-cost weighted directed spanning tree for a detected node, and (2) immunizes nodes in that tree by scoring their harmfulness using a novel ranking function. We demonstrate the effectiveness of our solution on five real-world datasets.

KW - Fake news detection

KW - fake news propagation

KW - network-aware fake news mitigation

KW - real-time network immunization

U2 - 10.1109/ACCESS.2023.3331220

DO - 10.1109/ACCESS.2023.3331220

M3 - Journal article

AN - SCOPUS:85177056475

VL - 11

SP - 125861

EP - 125873

JO - IEEE Access

JF - IEEE Access

SN - 2169-3536

ER -

ID: 374650389