Efficient Reinforcement of Bipartite Networks at Billion Scale

二部图 计算机科学 人工智能 算法 理论计算机科学 图形
作者
Yizhang He,Kai Wang,Wenjie Zhang,Xuemin Lin,Ying Zhang
标识
DOI:10.1109/icde53745.2022.00038
摘要

Bipartite networks, which model relationships between two different types of entities, are prevalent in many real-world applications. On bipartite networks, the cascading node departure undermines the networks' ability to provide sustainable services, which makes reinforcing bipartite networks a vital problem. Although network reinforcement is extensively studied on unipartite networks, it remains largely unexplored on bipartite graphs. On bipartite networks, ( $\alpha, \beta$ ) -core is a stable structure that ensures different minimum engagement levels of the vertices from different layers, and we aim to reinforce bipartite networks by maximizing the ( $\alpha, \beta$ ) -core. Specifically, given a bipartite network $G$ , degree constraints $\alpha$ and $\beta$ , budgets $b_{1}$ and $b_{2}$ , we aim to find $b_{1}$ upper layer vertices and $b_{2}$ lower layer vertices as anchors and bring them into the ( $\alpha, \beta$ ) -core s.t. the number of non-anchor vertices entering in the ( $\alpha, \beta$ ) -core is maximized. We prove the problem is NP-hard and propose a heuristic algorithm FILVER to solve the problem. FILVER runs $b_{1}+b_{2}$ iterations and choose the best anchor in each iteration. Under a filter-verification framework, it reduces the pool of candidate anchors (in the filter stage) and computes the resulting ( $\alpha, \beta$ ) - core for each anchor vertex more efficiently (in the verification stage). In addition, filter-stage optimizations are proposed to further reduce “dominated” anchors and allow computation-sharing across iterations. To optimize the verification stage, we explore the cumulative effect of placing multiple anchors, which effectively reduces the number of running iterations. Extensive experiments on 18 real-world datasets and a billion-scale synthetic dataset validate the effectiveness and efficiency of our proposed techniques.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
更新
PDF的下载单位、IP信息已删除 (2025-6-4)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
忧虑的靖巧完成签到 ,获得积分10
1秒前
科研通AI5应助Hexagram采纳,获得10
1秒前
文汉天女完成签到,获得积分10
1秒前
哒哒哒哒完成签到,获得积分10
2秒前
2秒前
4秒前
miao2发布了新的文献求助10
4秒前
玛卡巴卡发布了新的文献求助10
4秒前
Jieh发布了新的文献求助10
5秒前
5秒前
咩咩咩发布了新的文献求助10
5秒前
谈舒怡发布了新的文献求助10
6秒前
刘述发布了新的文献求助10
6秒前
6秒前
标致谷菱发布了新的文献求助10
7秒前
搜集达人应助147采纳,获得10
7秒前
雪山飞龙发布了新的文献求助10
8秒前
欧阳慕山发布了新的文献求助10
8秒前
9秒前
科研小猫完成签到,获得积分10
9秒前
无花果应助邢文瑞采纳,获得10
10秒前
10秒前
芋圆Z.发布了新的文献求助10
11秒前
蒋瑞轩发布了新的文献求助10
11秒前
寻123发布了新的文献求助10
12秒前
善学以致用应助科研怪人采纳,获得10
13秒前
cxy发布了新的文献求助10
16秒前
17秒前
17秒前
杭谷波完成签到,获得积分10
18秒前
爆米花应助科研通管家采纳,获得10
19秒前
隐形曼青应助科研通管家采纳,获得10
19秒前
orixero应助科研通管家采纳,获得10
19秒前
Rondab应助科研通管家采纳,获得10
19秒前
JamesPei应助科研通管家采纳,获得10
19秒前
思源应助科研通管家采纳,获得10
19秒前
Jasper应助霏166采纳,获得10
20秒前
orixero应助科研通管家采纳,获得10
20秒前
20秒前
小红发布了新的文献求助10
20秒前
高分求助中
A new approach to the extrapolation of accelerated life test data 1000
Picture Books with Same-sex Parented Families: Unintentional Censorship 700
ACSM’s Guidelines for Exercise Testing and Prescription, 12th edition 500
Nucleophilic substitution in azasydnone-modified dinitroanisoles 500
不知道标题是什么 500
Indomethacinのヒトにおける経皮吸収 400
Effective Learning and Mental Wellbeing 400
热门求助领域 (近24小时)
化学 材料科学 医学 生物 工程类 有机化学 生物化学 物理 内科学 纳米技术 计算机科学 化学工程 复合材料 遗传学 基因 物理化学 催化作用 冶金 细胞生物学 免疫学
热门帖子
关注 科研通微信公众号,转发送积分 3976126
求助须知:如何正确求助?哪些是违规求助? 3520340
关于积分的说明 11202586
捐赠科研通 3256847
什么是DOI,文献DOI怎么找? 1798509
邀请新用户注册赠送积分活动 877645
科研通“疑难数据库(出版商)”最低求助积分说明 806516