Evidence map›Paper›PMID 39771761›Full record

ArticleSensors (Basel, Switzerland)2024

Network Dismantling on Signed Network by Evolutionary Deep Reinforcement Learning.

Yuxuan Ou, Fujing Xiong, Hairong Zhang, Huijia Li

Abstract read
In one paragraph

Article in Sensors (Basel, Switzerland), 2024. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

0numbers the graph read from it
0cells of the map it votes in
0citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

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.

2 · The registry

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.

3 · Its place in the literature

Who cites it

0 citing papers in PubMed.

No citing paper in PubMed yet.

4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

4 authors.

Yuxuan OuSchool of Statistics and Data Science, Nankai University, Tianjin 300074, China.ORCID 0009-0004-3456-2180
Fujing XiongSchool of Statistics and Data Science, Nankai University, Tianjin 300074, China.ORCID 0009-0000-7828-0565
Hairong ZhangSchool of Statistics and Data Science, Nankai University, Tianjin 300074, China.ORCID 0009-0000-2233-5053
Huijia LiSchool of Statistics and Data Science, Nankai University, Tianjin 300074, China.

Funding

Beijing Natural Science Foundation 9182015National Natural Science Foundation of China 71871233
6 · The paper itself

Abstract

Network dismantling is an important question that has attracted much attention from many different research areas, including the disruption of criminal organizations, the maintenance of stability in sensor networks, and so on. However, almost all current algorithms focus on unsigned networks, and few studies explore the problem of signed network dismantling due to its complexity and lack of data. Importantly, there is a lack of an effective quality function to assess the performance of signed network dismantling, which seriously restricts its deeper applications. To address these questions, in this paper, we design a new objective function and further propose an effective algorithm named as DSEDR, which aims to search for the best dismantling strategy based on evolutionary deep reinforcement learning. Especially, since the evolutionary computation is able to solve global optimization and the deep reinforcement learning can speed up the network computation, we integrate it for the signed network dismantling efficiently. To verify the performance of DSEDR, we apply it to a series of representative artificial and real network data and compare the efficiency with some popular baseline methods. Based on the experimental results, DSEDR has superior performance to all other methods in both efficiency and interpretability.

Indexed as

deep learningevolutionary computationnetwork dismantlingreinforcement learningsigned network

Identifiers

PMID39771761
PMCPMC11678963

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

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.