Constructing Max-Flow Community Graph
Noriko Imafuji, Masaru Kitsuregawa · 2004
A web community is a set of web pages created by individuals or associations with a common interest on a topic. Maximum-flow algorithm extracts web communities which are sets of web pages having more links within the community than the outside. We call the web community Max-Flow community . Our previous work has characterized the properties of Max-Flow community (i.e., local properties) by comparing communities obtained by other methods and confirmed that while topics of communities by HITS and its derivations tend to be rather general, those of Max-Flow communities tend to be spe- cific. In this paper, we analyze the global properties of Max-Flow community. First we construct Max-Flow community graph whose nodes and edges are Max-Flow communities and relevancies between the communities respectively. The next, we study the differences between Max-Flow community graph and an existing community graph based on HITS related methods.