arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2408.07161cs.DScs.SI
收藏

关于概率网络中期望模块度的精确计算

On the accurate computation of expected modularity in probabilistic networks

Xin Shen, Matteo Magnani, Christian Rohner, Fiona Skerman

AI总结:

针对概率网络中期望模块度计算困难的问题,提出FPWP技术,通过计算模块度概率分布及其期望值,在保证准确性的同时大幅提升计算效率,优于现有方法。

摘要:

模块度是评估网络中社区结构最广泛使用的度量之一。在概率网络中,边的存在性不确定,且这种不确定性由概率表示,此时可以使用模块度的期望值。然而,高效计算期望模块度具有挑战性。为应对这一挑战,我们提出了一种新颖且高效的技术(FPWP),用于计算模块度的概率分布及其期望值。本文中,我们实现并比较了我们的方法与多种用于概率网络中期望模块度计算的通用方法。这些方法包括:(1)通过移除低概率边或将概率视为权重,将概率网络转换为确定性网络;(2)使用蒙特卡洛采样来近似期望模块度;(3)暴力计算。我们通过在具有不同特征的真实网络和合成网络上进行的全面实验,评估了FPWP的准确性和时间效率。结果表明,移除低概率边或将概率视为权重会产生不准确的结果,而采样方法的收敛性随网络参数变化。暴力计算虽然准确,但速度过慢。相比之下,我们的方法比暴力计算快得多,同时保证结果的准确性。

英文摘要:

Modularity is one of the most widely used measures for evaluating communities in networks. In probabilistic networks, where the existence of edges is uncertain and uncertainty is represented by probabilities, the expected value of modularity can be used instead. However, efficiently computing expected modularity is challenging. To address this challenge, we propose a novel and efficient technique (FPWP) for computing the probability distribution of modularity and its expected value. In this paper, we implement and compare our method and various general approaches for expected modularity computation in probabilistic networks. These include: (1) translating probabilistic networks into deterministic ones by removing low-probability edges or treating probabilities as weights, (2) using Monte Carlo sampling to approximate expected modularity, and (3) brute-force computation. We evaluate the accuracy and time efficiency of FPWP through comprehensive experiments on both real-world and synthetic networks with diverse characteristics. Our results demonstrate that removing low-probability edges or treating probabilities as weights produces inaccurate results, while the convergence of the sampling method varies with the parameters of the network. Brute-force computation, though accurate, is prohibitively slow. In contrast, our method is much faster than brute-force computation, but guarantees an accurate result.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑