Beyond 'caveman communities': Hubs and spokes for graph compression and mining

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2011, Pages 300-309

  Kang, U ^a   Faloutsos, Christos ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Graph compression; Graph mining; Hubs and spokes

Indexed keywords

CONNECTED COMPONENT; DATA SETS; EXECUTION TIME; GRAPH MINING; GRAPH PROCESSING; HUBS AND SPOKES; LAY-OUT; MATRIX-VECTOR; MENTAL IMAGES; REAL-WORLD GRAPHS; RUNNING TIME;

DATA MINING;

EID: 84857180154     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2011.26     Document Type: Conference Paper

References (28)

1. J. Shi and J. Malik, "Normalized cuts and image segmentation," CVPR, 1997.
2. A. Y. Ng, M. I. Jordan, and Y. Weiss, "On spectral clustering: Analysis and an algorithm," NIPS, 2002.
3. I. S. Dhillon, S. Mallela, and D. S. Modha, "Information-theoretic co-clustering," in KDD, 2003, pp. 89-98.
4. D. Chakrabarti, S. Papadimitriou, D. S. Modha, and C. Faloutsos, "Fully automatic cross-associations," in KDD, 2004, pp. 79-88.
5. F. Chierichetti, R. Kumar, S. Lattanzi, M. Mitzenmacher, A. Panconesi, and P. Raghavan, "On compressing social networks," in KDD, 2009, pp. 219-228.
6. M. Faloutsos, P. Faloutsos, and C. Faloutsos, "On power-law relationships of the internet topology," SIGCOMM, pp. 251-262, Aug-Sept. 1999.
7. J. Leskovec, K. J. Lang, A. Dasgupta, and M. W. Mahoney, "Statistical properties of community structure in large social and information networks," in WWW, 2008, pp. 695-704.
8. U. Kang, C. Tsourakakis, and C. Faloutsos, "Pegasus: A peta-scale graph mining system - implementation and observations," ICDM, 2009.
9. U. Kang, C. Tsourakakis, A. P. Appel, C. Faloutsos, and J. Leskovec., "Radius plots for mining tera-byte scale graphs: Algorithms, patterns, and observations," SIAM International Conference on Data Mining, 2010.
10. J. Dean and S. Ghemawat, "Mapreduce: Simplified data processing on large clusters," OSDI, 2004.
11. J. Rissanen and G. G. L. Jr., "Arithmetic coding," IBM Journal of Research and Development, vol. 23, no. 2, pp. 149-162, 1979.
12. S. P. Borgatti and M. G. Everett, "A graph-theoretic perspective on centrality," Social Networks, 2006.
13. B. A. Prakash, H. Tong, N. Valler, M. Faloutsos, and C. Faloutsos, "Virus propagation on time-varying networks: Theory and immunization algorithms," in ECML/PKDD, 2010.
14. P. Boldi and S. Vigna, "The webgraph framework i: compression techniques," in WWW, 2004.
15. P. Erdo″s and A. Rényi, "On random graphs," Publicationes Mathematicae, vol. 6, pp. 290-297, 1959.
16. R. Albert, H. Jeong, and A.-L. Barabasi, "Error and attack tolerance of complex networks," Nature, 2000.
17. A. P. Appel, D. Chakrabarti, C. Faloutsos, R. Kumar, J. Leskovec, and A. Tomkins, "Shatterplots: Fast tools for mining large graphs," in SDM, 2009.
18. Y. gChen, G. Paul, R. Cohen, S. Havlin, S. P. Borgatti, F. Liljeros, and H. E. Stanley, "Percolation theory and fragmentation measures in social networks," in Physica A 378, 2007, pp. 11-19.
19. G. Karypis and V. Kumar, "Multilevel -way hypergraph partitioning," in DAC, 1999, pp. 343-348.
20. V. Satuluri and S. Parthasarathy, "Scalable graph clustering using stochastic flows: applications to community discovery," in KDD, 2009.
21. M. Girvan and M. Newman, "Community structure in social and biological networks," National Academy of Sciences, vol. 99, pp. 7821-7826, 2002.
22. S. Papadimitriou and J. Sun, "Disco: Distributed coclustering with map-reduce," ICDM, 2008.
23. U. von Luxburg, "A tutorial on spectral clustering," Technical Report 149, Max Plank Institute for Biological Cybernetics, 2006.
24. A. Apostolico and G. Drovandi, "Graph compression by bfs," Algorithms, vol. 2, no. 3, pp. 1031-1044, 2009.
25. H. Maserrat and J. Pei, "Neighbor query friendly compression of social networks," in KDD, 2010.
26. U. Kang, C. E. Tsourakakis, A. P. Appel, C. Faloutsos, and J. Leskovec, "Hadi: Mining radii of large graphs," ACM Trans. Knowl. Discov. Data, vol. 5, pp. 8:1-8:24, February 2011.
27. C. Liu, H. chih Yang, J. Fan, L.-W. He, and Y.-M. Wang, "Distributed nonnegative matrix factorization for web-scale dyadic data analysis on mapreduce," in WWW, 2010, pp. 681-690.
28. G. Siganos, S. L. Tauro, and M. Faloutsos, "Jellyfish: A conceptual model for the as internet topology," Journal of Communications and Networks, 2006.