论文标题
有效的算法用于网络干预
Efficient Algorithms towards Network Intervention
论文作者
论文摘要
研究表明,社会关系对个人的健康成果产生了重大影响。通过仔细计划,网络干预可以帮助用户网络建立健康的关系。但是,大多数以前的工作并非旨在通过仔细检查和改善多个网络特征来帮助此类计划。在本文中,我们提出和评估算法,通过同时优化网络程度,紧密度,中间和局部聚类系数,以促进网络干预计划,在涉及有限降级的网络干预的情况下,单个目标(NILD -S)(NILD -S)和网络干预且具有有限的降级目标(NILD -MEDATES)(NILD -MED)。我们证明NILD-S和NILD-M是NP-固定的,除非p = np,否则在多项式时间内不能在任何比例内近似。我们提出了NILD-S的保留依赖性(CRPD)算法的候选重新选择,以及NILD-M的客观感知干预边缘选择和调整(OISA)算法。各种修剪策略旨在提高拟议算法的效率。对从公立学校和Web收集的各种真实社交网络以及一项实证研究的广泛实验,以表明CRPD和OISA在效率和有效性方面都优于基准。
Research suggests that social relationships have substantial impacts on individuals' health outcomes. Network intervention, through careful planning, can assist a network of users to build healthy relationships. However, most previous work is not designed to assist such planning by carefully examining and improving multiple network characteristics. In this paper, we propose and evaluate algorithms that facilitate network intervention planning through simultaneous optimization of network degree, closeness, betweenness, and local clustering coefficient, under scenarios involving Network Intervention with Limited Degradation - for Single target (NILD-S) and Network Intervention with Limited Degradation - for Multiple targets (NILD-M). We prove that NILD-S and NILD-M are NP-hard and cannot be approximated within any ratio in polynomial time unless P=NP. We propose the Candidate Re-selection with Preserved Dependency (CRPD) algorithm for NILD-S, and the Objective-aware Intervention edge Selection and Adjustment (OISA) algorithm for NILD-M. Various pruning strategies are designed to boost the efficiency of the proposed algorithms. Extensive experiments on various real social networks collected from public schools and Web and an empirical study are conducted to show that CRPD and OISA outperform the baselines in both efficiency and effectiveness.