内容网络广义社区发现有效算法

An Efficient Algorithm for General Community Detection in Content Networks

在对网络无任何先验知识情形下,PPSB-DC模型(popularity and productivity stochastic block model and discriminative content model)利用网络的内容和链接对网络生成过程进行建模,可有效地发现广义社区及社区间的链接模式。但该概率模型的参数估计算法耗时,初始链接模式参数设置敏感,限制了该模型的应用。对参数求解算法进行了改进,设计了一个有效的内容网络广义社区发现算法EPPSBDC(efficient PPSB-DC)。该算法通过采取抽样和并行技术,提高了算法运行速度,通过引入链接概率先验,消除了算法对初始参数的敏感性。在内容网络上与同类算法进行了比较,验证了EPPSBDC算法的有效性。

Without any prior knowledge about networks, the PPSB-DC （popularity and productivity stochastic block model and discriminative content model） models the generative process by contents and links, which makes it be able to detect general communities and identify link patterns between any two communities. However, the algorithm for this probabilistic model costs much time and is sensible to the initial parameters of link patterns. These disadvantages limit the application of the algorithm. In order to improve the parameter estimation algorithm, this paper proposes an efficient algorithm for general community detection in content networks EPPSBDC （efficient PPSB-DC）. EPPSBDC improves the speed by sampling and parallel strategies, and decreases the sensibility for the initial parameters by introducing a prior of link pattern. Comparisons of similar algorithms in content networks demonstrate the validity of EPPSBDC.