Extraction and classification of dense implicit communities in the Web graph

ACM Transactions on the Web

Volumn 3, Issue 2, 2009, Pages

  Dourisboure, Yon ^a   Geraci, Filippo ^b   Pellegrini, Marco ^b  

^a UNIVERSITÉ DE PAU ET DES PAYS DE L'ADOUR   (France)

^b CNR   (Italy)

Author keywords

Communities; Detection of dense subgraph; Web graph

Indexed keywords

COLLECTIVE BEHAVIOR; COMMUNITIES; COMMUNITY IS; DETECTION OF DENSE SUBGRAPH; GRAPH MODEL; HOMOGENEOUS GROUP; HYPERLINKS; LOW DENSITY; MASSIVE GRAPH; REPRESENTATIVE KEYWORDS; SCALABLE ALGORITHMS; SUBGRAPHS; SUFFICIENT CONDITIONS; WEB GRAPH; WEB GRAPHS; WEB PAGE;

HYPERTEXT SYSTEMS; WORLD WIDE WEB;

ALGORITHMS;

EID: 70349754411     PISSN: 15591131     EISSN: 1559114X     Source Type: Journal    
DOI: 10.1145/1513876.1513879     Document Type: Article

References (43)

1. AMITAY, E., CARMEL, D., DARLOW, A., LEMPEL, R., AND SOFFER, A. 2003. The connectivity sonar: Detecting site functionality by structural patterns. In Proceedings of the 14th ACM Conference on Hypertext and Hypermedia (HYPERTEXT). 38-47.
2. BHARAT, K., BRODER, A. Z., DEAN,J., AND HENZINGER, M. R. 2000. A comparison of techniques to find mirrored hosts on the WWW. J. Amer. Soc. Inform. Sci. 51, 12, 1114-1122.
3. BIANCHINI, M., GORI, M., AND SCARSELLI, F. 2005. Inside pagerank. ACM Trans. Inter. Tech. 5, 1, 92-128.
4. BOLDI, P., CODENOTTI, B., SANTINI, M., AND VIGNA, S. 2004. Ubicrawler: A scalable fully distributed Web crawler. Sof tw. Prac. Exper. 34, 8, 711-726.
5. BOLDI,P. AND VIGNA, S. 2004. The Webgraph framework I: Compression techniques. In Proceedings of the 13th International Conference on the World Wide Web. 595-601.
6. BRODER, A., KUMAR, R., MAGHOUL, F., RAGHAVAN, P., RAJAGOPALAN, S., STATA, R., TOMKINS, A., AND WIENER, J. 2000a. Graph structure in the Web. Comput. Netw. 33, 1-6, 309-320.
7. BRODER, A. Z., CHARIKAR, M., FRIEZE,A.M., AND MITZENMACHER, M. 2000b. Min-wise independent permutations. J. Comput. Syst. Sci. 60, 3, 630-659.
8. BRODER, A. Z., GLASSMAN, S. C., MANASSE,M.S., AND ZWEIG, G. 1997. Syntactic clustering of the web. In Selected Papers from the 6th International Conference on the World Wide Web. Elsevier Science Publishers Ltd., Essex, UK, 1157-1166.
9. CAPOCCI, A., SERVEDIO,V.D.P., CALDARELLI,G., AND COLAIORI, F. 2004. Communities detection in large networks. In Proceedings of the Algorithms and Models for the Web graph (WAW'04): Third International Workshop. 181-188.
10. CHAKRABARTI, S., DOM, B. E., KUMAR, S. R., RAGHAVAN, P., RAJAGOPALAN, S., TOMKINS, A., GIBSON,D., AND KLEINBERG, J. 1999. Mining the link structure of the World Wide Web. Comput. 32,8, 60-67.
11. CHO,J. AND GARCIA-MOLINA, H. 2000. WebBase and the Stanford interlib project. In Proceedings of the Kyoto International Conference on Digital Libraries: Research and Practice.
12. Cover,T.M. and Thomas, J. A. 1991. Elements of Information Theory. John Wiley and Sons.
13. DOURISBOURE, Y., GERACI,F., AND PELLEGRINI, M. 2007. Extraction and classification of dense communities in the web. in Proceedings of the 16th International Conference on the World Wide Web. ACM, New York, NY, 461-470.
14. FANG, R., MIKROYANNIDIS, A., AND THEODOULIDIS, B. 2006. A voting method for the classification of web pages. In Proceedings of the IEEE/WIC/ACM International Conference on Intelligent Agent Technology-Workshops. IEEE Computer Society, 610-613.
15. FEIGE, U. 2002. Relations between average case complexity and approximation complexity. In Proceedings of the ACM Symposium on Theory of Computing (STOC).
16. FEIGE,U. AND LANGBERG, M. 2001. Approximation algorithms for maximization problems arising in graph partitioning. J. Algor. 41, 174-211.
17. FEIGE, U., PELEG,D., AND KORTSARZ, G. 2001. The dense k-subgraph problem. Algorithmica 29, 3, 410-421.
18. FLAKE, G. W., LAWRENCE,S., AND GILES, C. L. 2000. Efficient identification of Web communities. In Proceedings of the Conference on Knowledge Discovery in Data (KDD). ACM Press, New York, NY, 150-160.
19. FLAKE, G. W., LAWRENCE, S., GILES,C.L., AND COETZEE, F. 2002. Self-organization of the web and identification of communities. IEEE Comput. 35, 3, 66-71.
20. GERACI, F., PELLEGRINI, M., MAGGINI, M., AND SEBASTIANI, F. 2007. Cluster generation and labeling for web snippets:a fast, accurate hierarchical solution. Internet Math. 3, 4, 413-443.
21. GIBSON, D., KLEINBERG, J., AND RAGHAVAN, P. 1998. Inferring web communities from link topology. In Proceedings of the ninth ACM Conference on Hypertext and Hypermedia (HYPERTEXT). ACM Press, New York, NY, 225-234.
22. GIBSON, D., KUMAR, R., AND TOMKINS, A. 2005. Discovering large dense subgraphs in massive graphs. In Proceedings of the International Conference on Very Large Databases (VLDB). VLDB Endowment, 721-732.
23. GIRVAN, M. AND NEWMAN, M. E. J. 2002. Community structure in social and biological networks. Proceedings of the National Academic Science, 7821-7826.
24. GLOVER, E.J., TSIOUTSIOULIKLIS, K., LAWRENCE, S., PENNOCK, D.M., AND FLAKE, G. W. 2002. Using web structure for classifying and describing web pages. In Proceedings of the International Conference on the World Wide Web (WWW). 562-569.
25. GULLI, A. AND SIGNORINI, A. 2005. The indexable web is more than 11.5 billion pages. In Proceedings of the 11th International Conference on the World Wide Web (WWW). Special Interest Tracks and Posters. 902-903.
26. GYÖNGYI, Z. and GARCIA-MOLINA, H. 2005. Web spam taxonomy. In Proceedings of the 1st International Workshop on Adversarial Information Retrieval on the Web.
27. HASTAD, J. 1999. Clique is hard to approximate within n1-E. Acta Mathematica 182, 105-142.
28. HAVELIWALA, T. H., GIONIS, A., AND INDYK, P. 2000. Scalable techniques for clustering the web. In Proceedings of the WebDB Workshop. 129-134.
29. Henzinger, M. 2002. Algorithmic challenges in Web search engines. Internet Math. 1, 1, 115-126.
30. IMAFUJI, N. AND KITSUREGAWA, M. 2003. Finding a web community by maximum flow algorithm with HITS score based capacity. In Proceedings of the 8th International Conference on Database Systems for Advanced Applications (DASFAA). 101-106.
31. INO, H., KUDO, M., AND NAKAMURA, A. 2005. Partitioning of Web graphs by community topology. in Proceedings of the International Conference on the World Wide Web (WWW). ACM Press, New York, NY, 661-669.
32. KAUTZ, H., SELMAN, B., AND SHAH, M. 1997. Referral Web: Combining social networks and collaborative filtering. Comm. ACM 40, 3, 63-65.
33. KUMAR, R., RAGHAVAN, P., RAJAGOPALAN, S., AND TOMKINS, A. 1999a. Extracting large-scale knowledge bases from the Web. In Proceedings of the International Conference on Very Large Databases (VLDB). 639-650.
34. KUMAR, R., RAGHAVAN, P., RAJAGOPALAN, S., AND TOMKINS, A. 1999b. Trawling the Web for emerging cyber-communities. Comput. Netw. 31, 11-16, 1481-1493.
35. KUMAR, R., RAGHAVAN, P., RAJAGOPALAN, S., AND TOMKINS, A. 2005. Method and system for trawling the world-wide Web to identify implicitly-defined communities of Web pages. US patent 6886129.
36. KUMAR, S. R., RAGHAVAN, P., RAJAGOPALAN, S., AND TOMKINS, A. 1999c. Extracting large-scale knowledge bases from the Web. VLDB J. 639-650.
37. LEMPEL, R. AND MORAN, S. 2000. The stochastic approach for link-structure analysis (SALSA) and the TKC effect. Comput. Netw. 33, 1-6, 387-401.
38. LINDEMANN, C. AND LITTIG, L. 2007. Classifying Web sites. In Proceedings of the 16th International Conference on World Wide Web (WWW). 1143-1144.
39. NEWMAN, M. 2003. The structure and function of complex networks. SIAM Rev. 45, 2, 167-256.
40. REDDY, P.K. AND KITSUREGAWA, M. 2001. An approach to relate the web communities throughbipartite graphs. in Proceedings of the International Conference on Web Information Systems Engineering(WISE). 301-310.
41. STAMOU, S., NTOULAS, A., KRIKOS, V., KOKOSIS, P., AND CHRISTODOULAKIS, D. 2006. Classifying web data in directory structures. In Frontiers of WWW Research and Development-APWeb, 8th Asia-Pacific Web Conference. Lecture Notes in Computer Science, vol.3841. Springer, 238-249.
42. WU, B. AND DAVISON, B. D. 2005. Identifying link farm spam pages. In Proceedings of the International Conference on World Wide Web (WWW). ACM Press, New York, NY, 820-829.
43. ABELLO, J., RESENDE,M.G.C., AND SUDARSKY, S. 2002. Massive quasi-clique detection. In Proceedings of the Latin American Theoretical Informatics Symposium (LATIN). 598-612.