Radius plots for mining tera-byte scale graphs: Algorithms, patterns, and observations

Proceedings of the 10th SIAM International Conference on Data Mining, SDM 2010

Volumn , Issue , 2010, Pages 548-558

  Kang, U ^a   Tsourakakis, Charalampos E ^a   Appel, Ana Paula ^b   Faloutsos, Christos ^a   Leskovec, Jure ^c  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b UNIVERSITY OF SÃO PAULO   (Brazil)

^c CSD   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA MINING; GRAPHIC METHODS; SPACE DIVISION MULTIPLE ACCESS; WEB CRAWLER;

CENTRAL NODES; EFFECTIVE DIAMETER; LARGE NETWORKS; MASSIVE GRAPH; MULTI-MODAL; NODE GRAPH; PLANETARY SCALE; REAL-WORLD DATASETS;

GRAPH THEORY;

EID: 84880119194     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972801.48     Document Type: Conference Paper

References (39)

1. C. C. Aggarwal, Y. Xie, and P. S. Yu. Gconnect: A connectivity index for massive disk-resident graphs. PVLDB, 2009.
2. R. Albert, H. Jeong, and A.-L. Barabasi. Diameter of the world wide web. Nature, (401):130-131, 1999.
3. N. Alon, Y. Matias, and M. Szegedy. The space complexity of approximating the frequency moments, 1996.
4. D. A. Bader and K. Madduri. A graph-theoretic analysis of the human protein-interaction network using mul-ticore parallel algorithms. Parallel Comput., 2008.
5. L. Becchetti, P. Boldi, C. Castillo, and A. Gionis. Efficient semi-streaming algorithms for local triangle counting in massive graphs. In KDD, 2008.
6. K. Beyer, P. J. Haas, B. Reinwald, Y. Sismanis, and R. Gemulla. On synopses for distinct-value estimation under multiset operations. SIGMOD, 2007.
7. A. Broder, R. Kumar, F. Maghoul, P. Raghavan, S. Rajagopalan, R. Stata, A. Tomkins, and J. Wiener. Graph structure in the web. Computer Networks 33, 2000.
8. R. Chaiken, B. Jenkins, P.-A. Larson, B. Ramsey, D. Shakib, S. Weaver, and J. Zhou. Scope: easy and efficient parallel processing of massive data sets. VLDB, 2008.
9. D. Chakrabarti, S. Papadimitriou, D. S. Modha, and C. Faloutsos. Fully automatic cross-associations. In KDD, 2004.
10. M. Charikar, S. Chaudhuri, R. Motwani, and V. Narasayya. Towards estimation error guarantees for distinct values. PODS, 2000.
11. T. Cormen, C. Leiserson, and R. Rivest. Introduction to Algorithms. The MIT Press, 1990.
12. S. Daruru, N. M. Marin, M. Walker, and J. Ghosh. Pervasive parallelism in data mining: dataflow solution to co-clustering large and sparse netflix data. In KDD, 2009.
13. I. S. Dhillon, Y. Guan, and B. Kulis. Weighted graph cuts without eigenvectors a multilevel approach. IEEE TPAMT, 2007.
14. I. S. Dhillon, S. Mallela, and D. S. Modha. Information-theoretic co-clustering. In KDD, 2003.
15. P. Erdoš and A. Rényi. On random graphs. Publicationes Mathematicae, 1959.
16. J.-A. Ferrez, K. Fukuda, and T. Liebling. Parallel computation of the diameter of a graph. In HPCSA, 1998.
17. P. Flajolet and G. N. Martin. Probabilistic counting algorithms for data base applications. Journal of Computer and System Sciences, 1985.
18. M. N. Garofalakis and P. B. Gibbon. Approximate query processing: Taming the terabytes. VLDB, 2001.
19. R. L. Grossman and Y. Gu. Data mining using high performance data clouds: experimental studies using sector and sphere. KDD, 2008.
20. U. Kang, C. E. Tsourakakis, and C. Faloutsos. Pegasus: A peta-scale graph mining system - implementation and observations. ICDM, 2009.
21. G. Karypis and V. Kumar. Parallel multilevel k-way partitioning for irregular graphs. SIAM Review, 41(2):278-300, 1999.
22. Y. Ke, J. Cheng, and J. X. Yu. Top-k correlative graph mining. SDM, 2009.
23. T. G. Kolda and J. Sun. Scalable tensor decompositions for multi-aspect data mining. In ICDM, 2008.
24. J. Leskovec, D. Chakrabarti, J. M. Kleinberg, and C. Faloutsos. Realistic, mathematically tractable graph generation and evolution, using kronecker multiplication. PKDD, pages 133-145, 2005.
25. J. Leskovec, J. Kleinberg, and C. Faloutsos. Graphs over time: densification laws, shrinking diameters and possible explanations. In KDD, 2005.
26. J. Leskovec, K. J. Lang, A. Dasgupta, and M. W. Mahoney. Statistical properties of community structure in large social and information networks. In WWW '08, 2008.
27. J. Ma and S. Ma. Efficient parallel algorithms for some graph theory problems. JCST, 1993.
28. M. Mcglohon, L. Akoglu, and C. Faloutsos. Weighted graphs and disconnected components: patterns and a generator. KDD, 2008.
29. C. R. Palmer, P. B. Gibbons, and C. Faloutsos. Anf: a fast and scalable tool for data mining in massive graphs. KDD, pages 81-90, 2002.
30. S. Papadimitriou and J. Sun. Disco: Distributed co-clustering with map-reduce. ICDM, 2008.
31. A. Pavlo, E. Paulson, A. Rasin, D. J. Abadi, D. J. Dewitt, S. Madden, and M. Stonebraker. A comparison of approaches to large-scale data analysis. SIGMOD, June 2009.
32. R. Pike, S. Dorward, R. Griesemer, and S. Quinlan. Interpreting the data: Parallel analysis with sawzall. Scientific Programming Journal, 2005.
33. V. Satuluri and S. Parthasarathy. Scalable graph clustering using stochastic flows: applications to community discovery. KDD, 2009.
34. B. P. Sinha, B. B. Bhattacharya, S. Ghose, and P. K. Srimani. A parallel algorithm to compute the shortest paths and diameter of a graph and its vlsi implementation. IEEE Trans. Comput., 1986.
35. C. E. Tsourakakis, U. Kang, G. L. Miller, and C. Faloutsos. Doulion: Counting triangles in massive graphs with a coin. KDD, 2009.
36. C. E. Tsourakakis, M. N. Kolountzakis, and G. L. Miller. Approximate triangle counting. CoRR, abs/0904.3761, 2009.
37. C. Wang, W. Wang, J. Pei, Y. Zhu, and B. Shi. Scalable mining of large disk-based graph databases. KDD, 2004.
38. X. Yan and J. Han. gspan: Graph-based substructure pattern mining. ICDM, 2002.
39. C. H. You, L. B. Holder, and D. J. Cook. Learning patterns in the dynamics of biological networks. In KDD, 2009.