Surveying the identification of communities
International Journal of Web Based Communities
Detection of web communities from community cores
WISS'10 Proceedings of the 2010 international conference on Web information systems engineering
| Hi-index | 0.00 |
Recently, researches on extraction of densely connected subgraphs, which are called communities, from the graph representing link structure inWWW, are very popular. However, few methods guarantee that extracted subgraphs satisfy community conditions which are strictly defined. In this paper, we consider the problem of extracting subgraphs that strictly satisfy the community conditions proposed in [3]. It is known that finding all such communities is computationally hard. As methods that possibly find many communities efficiently, we experimentally compared two methods, a method with a Gomory-Hu tree construction and a method with calculating edge-betweenness. We also proposed evaluation criterion for ranking found communities.