ArticleExpert systems with applications2023
A novel rumor detection with multi-objective loss functions in online social networks.
Article in Expert systems with applications, 2023. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 1 paper.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
1 citing paper in PubMed.
- Rumor detection model with weighted GraphSAGE focusing on node location.Scientific reports · 2024Article
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
5 authors.
Funding
No grant is acknowledged in the PubMed record.
Abstract
COVID-19 quickly swept across the world, causing the consequent infodemic represented by the rumors that have brought immeasurable losses to the world. It is imminent to achieve rumor detection as quickly and accurately as possible. However, the existing methods either focus on the accuracy of rumor detection or set a fixed threshold to attain early detection that unfortunately cannot adapt to various rumors. In this paper, we focus on textual rumors in online social networks and propose a novel rumor detection method. We treat the detection time, accuracy and stability as the three training objectives, and continuously adjust and optimize this objective instead of using a fixed value during the entire training process, thereby enhancing its adaptability and universality. To improve the efficiency, we design a sliding interval to intercept the required data rather than using the entire sequence data. To solve the problem of hyperparameter selection brought by integration of multiple optimization objectives, a convex optimization method is utilized to avoid the huge computational cost of enumerations. Extensive experimental results demonstrate the effectiveness of the proposed method. Compared with state-of-art counterparts in three different datasets, the recognition accuracy is increased by an average of 7%, and the stability is improved by an average of 50%.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.