CSDL Home I ICDEW 2005 2013 IEEE 29th International Conference on Data Engineering Workshops (ICDEW)
Apr. 5, 2005 to Apr. 8, 2005
Hidehiko Ino , Hokkaido University, Sapporo, Japan
Mineichi Kudo , Hokkaido University, Sapporo, Japan
Atsuyoshi Nakamura , Hokkaido University, Sapporo, Japan
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICDE.2005.159
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 . 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.
Hidehiko Ino, Mineichi Kudo, Atsuyoshi Nakamura, "A Comparative Study of Algorithms for Finding Web Communities", ICDEW, 2005, 2013 IEEE 29th International Conference on Data Engineering Workshops (ICDEW), 2013 IEEE 29th International Conference on Data Engineering Workshops (ICDEW) 2005, pp. 1257, doi:10.1109/ICDE.2005.159