paper-with-me

홈 › Papers

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

2023-02-23 · Ciprian-Octavian Truică, Elena-Simona Apostol, Radu-Cătălin Nicolescu, Panagiotis Karras

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 to detect untruthful information, also known as fake news, arises. 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.

📄 PDF Abstract BibTeX arXiv:2302.12190

Code (1)

ds4ai-upb/mcwdst 공식 구현

Methods 이 논문이 사용한 방법론

Tanh Activation 설명 없음
Sigmoid Activation 설명 없음
LSTM An LSTM is a type of recurrent neural network that addresses the vanishing gradient problem in vanilla…

Similar Papers 제목 키워드 기반

Optimal Multimarginal Schrödinger Bridge: Minimum Spanning Tree over Measure-valued Vertices

2025-09-12 · Georgiy A. Bondar, Abhishek Halder arxiv

The Multimarginal Schrödinger Bridge (MSB) finds the optimal coupling among a collection of random vectors with known statistics and a known correlation structure. In the MSB formulation, this correlation structure is sp…

A gentle tutorial and a structured reformulation of Bock's algorithm for minimum directed spanning trees

2026-03-29 · Yuxi Wang, Jungyeul Park arxiv

This paper presents a gentle tutorial and a structured reformulation of Bock's 1971 Algol procedure for constructing minimum directed spanning trees. Our aim is to make the original algorithm readable and reproducible fo…

Dependency Parsing

Minimum spanning tree release under differential privacy constraints

2018-01-19 · Rafael Pinot

We investigate the problem of nodes clustering under privacy constraints when representing a dataset as a graph. Our contribution is threefold. First we formally define the concept of differential privacy for structured …

Clustering

Alignment and Comparison of Directed Networks via Transition Couplings of Random Walks

2021-06-13 · Bongsoo Yi, Kevin O'Connor, Kevin McGoff, Andrew B. Nobel

We describe and study a transport based procedure called NetOTC (network optimal transition coupling) for the comparison and alignment of two networks. The networks of interest may be directed or undirected, weighted or …

A Three-Phase Search Approach for the Quadratic Minimum Spanning Tree Problem

2014-02-06 · Zhang-Hua Fu, Jin-Kao Hao

Given an undirected graph with costs associated with each edge as well as each pair of edges, the quadratic minimum spanning tree problem (QMSTP) consists of determining a spanning tree of minimum total cost. This proble…