IIT Home Page CNR Home Page

Extraction and classification of dense implicit communities in the Web grap

The World Wide Web (WWW) is rapidly becoming important for society as a medium for sharing data, information, and services, and there is a growing interest in tools for understanding collective behavior and emerging phenomena in theWWW. In this article we focus on the problem of searching and classifying communities in the Web. Loosely speaking a community is a group of pages related to a common interest. More formally, communities have been associated in the computer science literature with the existence of a locally dense subgraph of the Web graph (where Web pages are nodes and hyperlinks are arcs of the Web graph). The core of our contribution is a new scalable algorithm for finding relatively dense subgraphs in massive graphs. We apply our algorithm on Web graphs built on three publicly available large crawls of the Web (with raw sizes up to 120M nodes and 1G arcs). The effectiveness of our algorithm in finding dense subgraphs is demonstrated experimentally by embedding artificial communities in the Web graph and counting how many of these are blindly found. Effectiveness increases with the size and density of the communities: it is close to 100% for communities of thirty nodes or more (even at low density). It is still about 80% even for communities of twenty nodes with density over 50% of the arcs present. At the lower extremes the algorithm catches 35% of dense communities made of ten nodes.We also develop some sufficient conditions for the detection of a community under some local graph models and not-toorestrictive hypotheses. We complete our Community Watch system by clustering the communities found in theWeb graph into homogeneous groups by topic and labeling each group by representative keywords.


ACM Transactions on the Web , 2009

Autori IIT:

Tipo: Articoli su riviste ISI
Area di disciplina: Computer Science & Engineering
Da pagina 7:1 a pagina 7:36

Attività: Algoritmica per tecnologie web