Mining Web community based on improved maximum flow algorithm
一种改进的基于最大流的Web社区挖掘算法

Given that the original maximum flow algorithm set a fixed edge capacity to each edge, which caused poor quality and improper size of communities, this paper proposed an improved algorithm for mining Web communities. The algorithm considered the differences between edges in terms of importance, and assigned different capacities to different edges by transforming the significant measurements of pages evaluated by weighted PageRank algorithm to edge-transferring probability scores to measure the importance of edges, and assigning them to corresponding edges as their capacities. The experimental results show that the improved maximum flow algorithm improves the quality of Web community effectively.