HADI: Mining radii of large graphs

ACM Transactions on Knowledge Discovery from Data

Volumn 5, Issue 2, 2011, Pages

  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 STANFORD UNIVERSITY   (United States)

Author keywords

Graph mining; HADI; Hadoop; Radius plot; Small web

Indexed keywords

GRAPH MINING; HADI; HADOOP; RADIUS PLOT; SMALL WEB;

GRAPHIC METHODS;

EID: 79952540632     PISSN: 15564681     EISSN: 1556472X     Source Type: Journal    
DOI: 10.1145/1921632.1921634     Document Type: Article

References (46)

1. AGGARWAL, C. C, XIE, Y., AND YU, P. S. 2009. Gconnect: A connectivity index for massive disk-resident graphs. In Proceedings of the International Conference on Very Large Databases.
2. Albert, R., Jeong, H., and Barabasi, A.-L. 1999. Diameter of the world wide web. Nature 401, 130-131.
3. Alon, N., Matias, Y., and Szegedy, M. 1996. The space complexity of approximating the frequency moments. In Proceedings of the Annual ACM Symposium on Theory ofComputing.
4. Bader, D. A. and Madduri, K. 2008. A graph-theoretic analysis of the human protein-interaction network using multicore parallel algorithms. Paral. Comput.
5. Becchetti, L., Boldi, P., Castillo, C., and Gionis, A. 2008. Efficient semi-streaming algorithms for local triangle counting in massive graphs. In Proceedings of the Annual ACM SIGKDD Conference on Knowledge Discovery and Data Mining.
6. Beyer, K., Haas, P.J., Reinwald, B., Sismanis, Y., and Gemulla, R. 2007. On synopses for distinct-value estimation under multiset operations. In Proceedings ofthe ACM SIGMOD International Conference on Management of Data.
7. Broder, A., Kumar, R., Maghoul, F., Raghavan, P., Rajagopalan, S., Stata, R., Tomkins, A., and Wiener, J. 2000. Graph structure in the web. Comput. Netw. 33.
8. Chaiken, R., Jenkins, B., Larson, P.-A., Ramsey, B., Shakib, D., Weaver, S., and Zhou, J. 2008. Scope: easy and efficient parallel processing of massive data sets. In Proceedings of the International Conference on Very Large Databases.
9. Chakrabarti, D., Papadimitriou, S., Modha, D.S., and Faloutsos, C. 2004. Fully automatic cross-associations. In Proceedings of the Annual ACM SIGKDD Conference on Knowledge Discovery and Data Mining.
10. Charikar, M., Chaudhuri, S., Motwani, R., and Narasayya, V. 2000. Towards estimation error guarantees for distinct values. In Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems.
11. Cormen, T., Leiserson, C., and Rivest, R. 1990. Introduction to Algorithms. The MIT Press.
12. Daruru, S., Marin, N. M., Walker, M., and Ghosh, J. 2009. Pervasive parallelism in data mining: dataflow solution to co-clustering large and sparse netflix data. In Proceedings of the Annual ACM SIGKDD Conference on Knowledge Discovery and Data Mining.
13. Dhillon, I. S., Mallela, S., and Modha, D. S. 2003. Information-theoretic co-clustering. In Proceedings of the Annual ACM SIGKDD Conference on Knowledge Discovery and Data Mining.
14. Dhillon, I. S., Guan, Y., and Kulis, B. 2007. Weighted graph cuts without eigenvectors a multilevel approach. IEEE Trans. Patt. Anal. Mach. Intel.
15. Erdo″s, P. and Rényi, A. 1959. On random graphs. Publicationes Mathematicae.
16. Ferrez, J.-A., Fukuda, K., and Liebling, T. 1998. Parallel computation of the diameter of a graph. In Proceedings of the International Symposium on High-Performance Computer Architecture.
17. Flajolet, P. and Martin, G. N. 1985. Probabilistic counting algorithms for data base applications. J. Comput. Syst. Sci.
18. Garofalakis, M. N. and Gibbon, P. B. 2001. Approximate query processing: Taming the terabytes. In Proceedings of the International Conference on Very Large Databases.
19. Grossman, R. L. and Gu, Y. 2008. Data mining using high performance data clouds: experimental studies using sector and sphere. In Proceedings of the Annual ACM SIGKDD Conference on Knowledge Discovery and Data Mining.
20. Kang, U., Tsourakakis, C. E., and Faloutsos, C. 2009. Pegasus: A peta-scale graph mining system - implementation and observations. In Proceedings of the IEEE International Conference on Data Mining.
21. Kang, U., Chau, D., and Faloutsos, C. 2010a. Inference of beliefs on billion-scale graphs. In Proceedings of the 2nd Workshop on Large-Scale Data Mining: Theory and Applications.
22. Kang, U., Tsourakakis, C., Appel, A. P., Faloutsos, C., and Leskovec., J. 2010b. Radius plots for mining tera-byte scale graphs: Algorithms, patterns, and observations. In Proceedings of SIAM International Conference on Data Mining.
23. Kang, U., Tsourakakis, C., and Faloutsos, C. 2010c. Pegasus: Mining peta-scale graphs. Knowl. Inform. Syst. Springer.
24. Karypis, G. and Kumar, V. 1999. Parallel multilevel k-way partitioning for irregular graphs. SIAM Rev. 41, 2, 278-300.
25. Ke, Y., Cheng, J., and Yu, J. X. 2009. Top-k correlative graph mining. In Proceedings of the SIAM International Conference on Data Mining.
26. Kolda, T. G.and Sun, J. 2008. Scalable tensor decompositions for multi-aspect data mining. In Proceedings of the IEEE International Conference on Data Mining.
27. Leskovec, J., Chakrabarti, D., Kleinberg, J. M., and Faloutsos, C. 2005. Realistic, mathematically tractable graph generation and evolution, using kronecker multiplication. In Proceedings of the European Conference on Principles of Data Mining and Knowledge Discovery. 133-145.
28. Leskovec, J., Kleinberg, J., and Faloutsos, C. 2007. Graph evolution: Densification and shrinking diameters. ACM Trans. Knowl. Discov. Data 1, 1, 2.
29. Leskovec, J., Lang, K.J., Dasgupta, A., and Mahoney, M. W. 2008. Statistical properties of community structure in large social and information networks. In Proceedings of the International World Wide Web Conference.
30. LEWIS., T. G. 2009. Network Science: Theory and Applications. Wiley.
31. Ma, J. and Ma, S. 1993. Efficient parallel algorithms for some graph theory problems. J. Comput. Sci. Technol.
32. Mcglohon, M., Akoglu, L., and Faloutsos, C. 2008. Weighted graphs and disconnected components: patterns and a generator. In Proceedings of the Annual ACMSIGKDD Conference on Knowledge Discovery and Data Mining.
33. Newman., M. 2005. A measure of betweenness centrality based on random walks. Social Netw.
34. Palmer, C. R., Gibbons, P. B., and Faloutsos, C. 2002. Anf: a fast and scalable tool for data mining in massive graphs. In Proceedings of the Annual ACM SIGKDD Conference on Knowledge Discovery and Data Mining. 81-90.
35. Papadimitriou, S. and Sun, J. 2008. Disco: Distributed co-clustering with map-reduce. In Proceedings of the IEEE International Conference on Data Mining.
36. Pavlo, A., Paulson, E., Rasin, A., Abadi, D. J., Dewitt, D. J., Madden, S., and Stonebraker, M. 2009. A comparison of approaches to large-scale data analysis. In Proceedings of the ACM SIGMOD International Conference on Management of Data.
37. PiKE, R., DoRWARD, S., Griesemer, R., and QuINLAN, S. 2005. Interpreting the data: Parallel analysis with sawzall. Scien. Program. J.
38. SATULURI, V. and Parthasarathy, S. 2009. Scalable graph clustering using stochastic flows: applications to community discovery. In Proceedings of the Annual ACM SIGKDD Conference on Knowledge Discovery and Data Mining.
39. Sinha, B. P., Bhattacharya, B. B., Ghose, S., and Srimani, P. K. 1986. A parallel algorithm to compute the shortest paths and diameter of a graph and its vlsi implementation. IEEE Trans. Comput.
40. TSOURAKAKIS, C. E. 2008. Fast counting of triangles in large real networks without counting: Algorithms and laws. In Proceedings of the IEEE International Conference on Data Mining. 608-617.
41. TSOURAKAKIS, C. E. 2009. Mach: Fast randomized tensor decompositions. CoRR abs/0909.4969.
42. TSOURAKAKIS, C. E., Kang, U., Miller, G. L., and FALOUTSOS, C. 2009a. Doulion: Counting triangles in massive graphs with a coin. In Proceedings of the Annual ACM SIGKDD Conference on Knowledge Discovery and Data Mining.
43. TSOURAKAKIS, C. E., Kolountzakis, M. N., and Miller, G. L. 2009b. Approximate triangle counting. CoRR abs/0904.3761.
44. WANG, C., Wang, W., Pei, J., Zhu, Y., and Shi, B. 2004. Scalable mining of large disk-based graph databases. In Proceedings of the Annual ACM SIGKDD Conference on Knowledge Discovery and Data Mining.
45. Yan, X. and Han, J. 2002. gspan: Graph-based substructure pattern mining. In Proceedings of the IEEE International Conference on Data Mining.
46. You, C. H., Holder, L. B., and Cook, D. J. 2009. Learning patterns in the dynamics of biological networks. In Proceedings of the Annual ACM SIGKDD Conference on Knowledge Discovery and Data Mining.