一种改进的社区发现最大流算法

An improved maximum flow algorithm for web communities identification

为合理设计最大流算法中边容量的分配策略,利用网页的入度和出度的概率分布以及Web页面间链接重要性差异,合理分配边容量,提出改进的最大流算法MBP.实验结果表明,改进的最大流算法MBP发现的社区质量多数情况下优于HITS算法和原始最大流算法.

The allocation strategy for edge capacities in max-flow algorithm of community identification technique directly affect the quality of community finding. An improved maxflow-basedpowerlow algorithm （MBP） was put forward to design the allocation of edge capacities properly. The powerlaw distribution of web page＇s in-degree and out-degree, and the important difference for web links among pages were considered. The results show that the proposed algorithm performs better than that of the original max-flow algorithm and HITS algorithm in most cases.