arrow
返回

Solving the non-submodular network collapse problems via Decision Transformer

delete2024-08-01
delete0
PRE
AI
K
Kaili Ma *
杨涵 封面图
杨涵 (Han Yang)
S
Shanchao Yang
赵康菲 封面图
赵康菲 (Kangfei Zhao)
L
Lanqing Li
Y
Yongqiang Chen
Junzhou Huang 封面图
Junzhou Huang (Junzhou Huang)
J
James Cheng
R
Rong, Yu *
DOI:10.1016/j.neunet.2024.106328delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Given a graph G , the network collapse problem (NCP) selects a vertex subset S of minimum cardinality from G such that the difference in the values of a given measure function f ( G ) - f ( G \ S ) is greater than a predefined collapse threshold. Many graph analytic applications can be formulated as NCPs with different measure functions, which often pose a significant challenge due to their NP -hard nature. As a result, traditional greedy algorithms, which select the vertex with the highest reward at each step, may not effectively find the optimal solution. In addition, existing learning -based algorithms do not have the ability to model the sequence of actions taken during the decision -making process, making it difficult to capture the combinatorial effect of selected vertices on the final solution. This limits the performance of learning -based approaches in non-submodular NCPs. To address these limitations, we propose a unified framework called DT -NC, which adapts the D ecision T ransformer to the N etwork C ollapse problems. DT -NC takes into account the historical actions taken during the decision -making process and effectively captures the combinatorial effect of selected vertices. The ability of DT -NC to model the dependency among selected vertices allows it to address the difficulties caused by the non-submodular property of measure functions in some NCPs effectively. Through extensive experiments on various NCPs and graphs of different sizes, we demonstrate that DT -NC outperforms the state-of-the-art methods and exhibits excellent transferability and generalizability.
Keyword:
Graph neural network
Decision Transformer
Network collapse
Network dismantling
Collapsed k-core

期刊

Neural Networks 封面图
Neural Networks
IF:
6.3
论文数:
8.2K
被引数:
3.0W

机构

T
The Chinese University of Hong Kong, Shenzhen
学者数:
4.3K
论文数: 4.0K
被引数: 7
C
Chinese University of Hong Kong
学者数:
3.4W
论文数: 3.2W
被引数: 5.6W
U
university of texas system
学者数:
18.5W
论文数: 15.6W
被引数: 210
T
Tencent
学者数:
1.1K
论文数: 898
被引数: 5
学者 查看更多机构
引用论文

引用论文

Dry Eye Symptom Severity and Visual Field Reliability Metrics
err2022-03-18
err0
errOAAI
errAndrew S. Camp; Christopher P. Long; Anat Galor; Maya Yamane; James A. Proudfoot; Robert N. Weinreb
err分享
err收藏
The Critical Node Detection Problem in networks: A survey
err2018-05-01
err171
PREAI
errLalou, Mohammed; Tahraoui, Mohammed Amin; Kheddouci, Hamamache
err分享
err收藏
Generalized network dismantling广义网络拆解
err2019-03-15
err137
errOAAI
errRen, Xiao-Long; Gleinig, Niels; Helbing, Dirk; Antulov-Fantulin, Nino
err分享
err收藏
Finding Critical Users in Social Communities via Graph Convolutions
err2021-01-01
err9
PREAI
errZhao, Kangfei; Zhang, Zhiwei; Rong, Yu; Yu, Jeffrey Xu; Huang, Junzhou
err分享
err收藏
err分享
err收藏
学者 查看更多内容