Extracting Latent Weblog Communities: A Partitioning Algorithm for Bipartite Graphs

Kazunari Ishida

I propose the concept of a latent weblog community (LBC), as a means to promote the automomous organizaiton of knowledge on the Internet. Such communities can be illustrated in terms of bipartite graphs based on weblog update information, and they can effectively function to create meeting spaces for bloggers who write about similar or closely related topics but do not know each other. To extract these communities from blogspace, I developed a partioning algorithm known as the Weakest Pair (WP) algorithm, which separates the weakest pairs of bloggers and webpages, respectively, using co-citation information.

Presented by Kazunari Ishida, Tokyo University of Agriculture

Paper

WWE2005