Efficient semi-streaming algorithms for local triangle counting in massive graphs

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2008, Pages 16-24

  Becchetti, Luca ^a   Boldi, Paolo ^b   Castillo, Carlos ^c   Gionis, Aristides ^c  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b UNIVERSITY OF MILAN   (Italy)

^c YAHOO RESEARCH   (Spain)

Author keywords

Graph mining; Probabilistic algorithms; Semi streaming

Indexed keywords

CONTENT QUALITIES; EXTERNAL MEMORIES; GRAPH MINING; LARGE GRAPHS; LOCAL CLUSTERING; MAIN MEMORIES; MASSIVE GRAPHS; MIN-WISE INDEPENDENT PERMUTATIONS; NUMBER OF TRIANGLES; PROBABILISTIC ALGORITHMS; SEMI-STREAMING; SOCIAL NETWORKS; STREAMING ALGORITHMS; WEB GRAPHS;

DRUG PRODUCTS PLANTS; GRAPH THEORY; INFORMATION MANAGEMENT; MINING;

APPROXIMATION ALGORITHMS;

EID: 61649118133     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1401890.1401898     Document Type: Conference Paper

References (32)

1. N. Alon, R. Yuster, and U. Zwick. Finding and counting given length cycles. Algorithmica, 17(3):209-223, 1997.
2. Z. Bar-Yossef, R. Kumar, and D. Sivakumar. Reductions in streaming algorithms, with an application to counting triangles in graphs. In SODA, 2002.
3. V. Batagelj and A. Mrvar. A subquadratic triad census algorithm for large sparse networks with small maximum degree. Social Networks, 23:237-243, 2001.
4. T. Bohman, C. Cooper, and A. M. Frieze. Min-wise independent linear permutations. Electr. J. Comb, 7, 2000.
5. P. Boldi and S. Vigna. The webgraph framework I: compression techniques. In WWW, 2004.
6. A. Z. Broder. On the resemblance and containment of documents. In Compression and Complexity of Sequences, IEEE Computer Society, 1998.
7. A. Z. Broder. Identifying and filtering near-duplicate documents. In CPM. Springer, 2000.
8. A. Z. Broder, M. Charikar, A. M. Frieze, and M. Mitzenmacher. Min-wise independent permutations. In STOC, New York, NY, USA, 1998.
9. A. Z. Broder, S. C. Glassman, M. S. Manasse, and G. Zweig. Syntactic clustering of the web. In WWW, 1997.
10. L. S. Buriol, G. Frahling, S. Leonardi, A. Marchetti-Spaccamela, and C. Sohler. Counting triangles in data streams. In PODS, 2006.
11. C. Castillo, D. Donato, L. Becchetti, P. Boldi, S. Leonardi, M. Santini, and S. Vigna. A reference collection for web spam. SIGIR Forum, 40(2):11-24, December 2006.
12. C. Castillo, D. Donato, A. Gionis, V. Murdock, and F. Silvestri. Know your neighbors: Web spam detection using the web topology. In SIGIR, 2007.
13. D. Coppersmith and R. Kumar. An improved data stream algorithm for frequency moments. In SODA, 2004.
14. D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions. Journal of Symbolic Computation, 9(3):251-280, 1990.
15. C. Demetrescu, I. Finocchi, and A. Ribichini. Trading off space for passes in graph streaming problems. In SODA, 2006.
16. J.-P. Eckmann and E. Moses. Curvature of co-links uncovers hidden thematic layers in the world wide web. PNAS, 99(9):5825-5829, 2002.
17. J. Feigenbaum, S. Kannan, M. A. Gregor, S. Suri, and J. Zhang. On graph problems in a semi-streaming model. In ICALP, 2004.
18. D. Fetterly, M. Manasse, and M. Najork. Spam, damn spam, and statistics: Using statistical analysis to locate spam web pages. In WebDB, 2004.
19. D. Fogaras and B. Rácz. Scaling link-based similarity search. In WWW, 2005.
20. D. Gibson, R. Kumar, and A. Tomkins. Discovering large dense subgraphs in massive graphs. In VLDB, 2005.
21. A. Gulli and A. Signorini. The indexable Web is more than 11.5 billion pages. In WWW, 2005.
22. T. Haveliwala. Efficient computation of pagerank. Technical report, Stanford University, 1999.
23. M. R. Henzinger, P. Raghavan, and S. Rajagopalan. Computing on data streams. Dimacs Series In Discrete Mathematics And Theoretical Computer Science, pages 107-118, 1999.
24. P. Indyk. A small approximately min-wise independent family of hash functions. In SODA, 1999.
25. A. Itai and M. Rodeh. Finding a minimum circuit in a graph. SIAM Journal of Computing, 7(4):413-423, 1978.
26. G. Jeh and J. Widom. Simrank: a measure of structural-context similarity. In KDD, New York, NY, USA, 2002.
27. R. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins. Trawling the Web for emerging cyber-communities. Computer Networks, 31(11-16):1481-1493, 1999.
28. J. Leskovec, J. Kleinberg, and C. Faloutsos. Graphs over time: densification laws, shrinking diameters and possible explanations. In KDD, 2005.
29. M. E. J. Newman. The structure and function of complex networks. SIAM Review, 45(2):167-256, 2003.
30. T. Schank and D. Wagner. Finding, counting and listing all triangles in large graphs, an experimental study. In Proceedings of the 4th International Workshop on Experimental and Efficient Algorithms (WEA), 2005.
31. J. S. Vitter. External memory algorithms and data structures. ACM Computing Surveys, 33(2):209-271, 2001.
32. H. T. Weiser, E. Gleave, D. Fisher, and M. Smith. Visualizing the signatures of social roles in online discussion groups. The Journal of Social Structure, 8(2), 2007.